scientific article; zbMATH DE number 7437708

zbMath1476.68060arXiv1509.03014MaRDI QIDQ5014441

Naohi Eguchi

Publication date: 2 December 2021

Full work available at URL: https://arxiv.org/abs/1509.03014

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) First-order arithmetic and fragments (03F30) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quasi-interpretations. A way to control resources
• Orderings for term-rewriting systems
• Termination proofs for term rewriting systems by lexicographic path orderings imply multiply recursive derivation lengths
• Analysing the implicit complexity of programs.
• A term rewriting characterization of the functions computable in polynomial space
• Proof-theoretic analysis of termination proofs
• Relationships between nondeterministic and deterministic tape complexities
• Algorithms with polynomial interpretation termination proof
• Termination proofs by multiset path orderings imply primitive recursive derivation lengths
• Improved witnessing and local improvement principles for second-order bounded arithmetic
• Subrecursiveness: Machine-independent notions of computability in restricted time and storage

This page was built for publication: