The congruence of two programming language definitions

DOI10.1016/0304-3975(81)90037-2MaRDI QIDQ1155952zbMATH OpenOpenAlexFDO

Authors 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

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

Cites work

• scientific article; zbMATH DE number 3793435 (Why is no real title available?)
• scientific article; zbMATH DE number 3490449 (Why is no real title available?)
• scientific article; zbMATH DE number 3557184 (Why is no real title available?)
• scientific article; zbMATH DE number 3346088 (Why is no real title available?)
• scientific article; zbMATH DE number 3423547 (Why is no real title available?)
• A lattice-theoretical fixpoint theorem and its applications
• An axiomatic basis for computer programming
• Continuations: A mathematical semantics for handling full jumps
• Fixpoint approach to the theory of computation
• On the power of list iteration
• The denotational semantics of programming languages

Cited in

(4)

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

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

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