Computable stack functions for semantics of stack programs

DOI10.1016/0022-0000(79)90024-2zbMath0428.68057OpenAlexW2061393234MaRDI QIDQ1137385

Giorgio Germano, Andrea Maggiolo-Schettini

Publication date: 1979

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(79)90024-2

zbMATH Keywords

Church's thesispartial recursive functionsprogramsalgebraic characterization of computable functionsrepetition operatorsstack machines

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Recursive functions and relations, subrecursive hierarchies (03D20) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items (8)

Computable functions in tabular databases ⋮ Sequence recursiveness without cylindrification and limited register machines ⋮ Primitive program algebras of computable functions ⋮ General iteration and unary functions ⋮ Succinct iterative characterizations of primitive computable unary functions ⋮ Completeness problems in classes of computable named functions ⋮ Mutual derivability of operations in program algebras. I ⋮ Closure functions and general iterates as reflectors

Cites Work

• Proving a compiler correct: A simple approach
• Sequence-to-sequence recursiveness
• An arithmetical reconstruction of the liar's antinomy using addition and multiplication
• Equivalence of partial recursivity and computability by algorithms without concluding formulas
• A flow diagram composition of Markov's normal algorithms without concluding formulas
• ITERATION AND RECURSION
• General Recursive Functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computable stack functions for semantics of stack programs