On the observational theory of the CPS-calculus
From MaRDI portal
Publication:968276
DOI10.1007/S00236-009-0112-9zbMATH Open1211.68270OpenAlexW2074139511WikidataQ62041647 ScholiaQ62041647MaRDI QIDQ968276FDOQ968276
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
Recommendations
labelled transition systemContinuation-Passing Style transformslabelled bisimilarityMorris' context-equivalence.
Cites Work
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bisimulation for higher-order process calculi
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Bisimilarity as a theory of functional programming
- A complete, co-inductive syntactic theory of sequential control and state
- Title not available (Why is that?)
- Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms
- On the bisimulation proof method
- The \(\pi\)-calculus: A theory of mobile processes
- On asynchrony in name-passing calculi
- Title not available (Why is that?)
- Programming Languages and Systems
- Full abstraction in the lazy lambda calculus
- Fully abstract models of typed \(\lambda\)-calculi
- Continuations: A mathematical semantics for handling full jumps
- On the call-by-value CPS transform and its semantics
- Relational reasoning about contexts
- Reasoning about functions with effects
- Typed Normal Form Bisimulation
- Title not available (Why is that?)
Cited In (1)
This page was built for publication: On the observational theory of the CPS-calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968276)