On the observational theory of the CPS-calculus

DOI10.1007/S00236-009-0112-9zbMath1211.68270OpenAlexW2074139511WikidataQ62041647 ScholiaQ62041647MaRDI QIDQ968276

Massimo Merro

Publication date: 5 May 2010

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-009-0112-9

zbMATH Keywords

labelled transition systemContinuation-Passing Style transformslabelled bisimilarityMorris' context-equivalence.

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bisimulation for higher-order process calculi
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms
• Call-by-name, call-by-value and the \(\lambda\)-calculus
• An algebraic interpretation of the \(\lambda\beta K\)-calculus; and an application of a labelled \(\lambda\)-calculus
• Fully abstract models of typed \(\lambda\)-calculi
• Full abstraction in the lazy lambda calculus
• Continuations: A mathematical semantics for handling full jumps
• Bisimilarity as a theory of functional programming
• On the call-by-value CPS transform and its semantics
• A complete, co-inductive syntactic theory of sequential control and state
• Typed Normal Form Bisimulation
• On the bisimulation proof method
• On asynchrony in name-passing calculi
• Programming Languages and Systems

This page was built for publication: On the observational theory of the CPS-calculus