Computable stack functions for semantics of stack programs

DOI10.1016/0022-0000(79)90024-2MaRDI QIDQ1137385zbMATH OpenOpenAlexFDO

Authors G. M. 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) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Recursive functions and relations, subrecursive hierarchies (03D20)

Cites work

• scientific article; zbMATH DE number 3657799 (Why is no real title available?)
• scientific article; zbMATH DE number 3681118 (Why is no real title available?)
• scientific article; zbMATH DE number 3506659 (Why is no real title available?)
• scientific article; zbMATH DE number 3530942 (Why is no real title available?)
• scientific article; zbMATH DE number 3203821 (Why is no real title available?)
• scientific article; zbMATH DE number 3335016 (Why is no real title available?)
• scientific article; zbMATH DE number 3339390 (Why is no real title available?)
• scientific article; zbMATH DE number 3196257 (Why is no real title available?)
• A flow diagram composition of Markov's normal algorithms without concluding formulas
• An arithmetical reconstruction of the liar's antinomy using addition and multiplication
• Equivalence of partial recursivity and computability by algorithms without concluding formulas
• General Recursive Functions
• ITERATION AND RECURSION
• Proving a compiler correct: A simple approach
• Sequence-to-sequence recursiveness

Cited in

(8)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1137385)