Syntax and semantics of universal programming languages

DOI10.1080/00207167708803129zbMath0358.68013OpenAlexW2123675649MaRDI QIDQ4130955

Richard Hamlet

Publication date: 1977

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207167708803129

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) General topics in the theory of software (68N01)

Cites Work

• Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
• Gödel numberings of partial recursive functions
• A transportable extendable compiler
• Computational complexity of formal translations
• An Algorithm for Structuring Flowgraphs
• Hilbert's Tenth Problem is Unsolvable
• A Machine-Independent Theory of the Complexity of Recursive Functions
• On the size of machines
• A note on “axioms” for computational complexity and computation of finite functions
• On Computable Numbers, with an Application to the Entscheidungsproblem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Syntax and semantics of universal programming languages