The congruence of two programming language definitions

DOI10.1016/0304-3975(81)90037-2zbMath0467.68012OpenAlexW2011001069MaRDI QIDQ1155952

Joseph E. Stoy

Publication date: 1981

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(81)90037-2

zbMATH Keywords

denotational semanticsinterpreter semantics

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) General topics in the theory of software (68N01)

Related Items (4)

Fully abstract submodels of typed lambda calculi ⋮ Transition systems, metric spaces and ready sets in the semantics of uniform concurrency ⋮ Correctness of procedure representations in higher-order assembly language ⋮ The correctness of a higher-order lazy functional language implementation: An exercise in mechanical theorem proving

Cites Work

• Continuations: A mathematical semantics for handling full jumps
• A lattice-theoretical fixpoint theorem and its applications
• On the power of list iteration
• The denotational semantics of programming languages
• An axiomatic basis for computer programming
• Fixpoint approach to the theory of computation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The congruence of two programming language definitions