On the observational theory of the CPS-calculus
From MaRDI portal
Publication:968276
Recommendations
Cites work
- scientific article; zbMATH DE number 3716792 (Why is no real title available?)
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 1241702 (Why is no real title available?)
- scientific article; zbMATH DE number 1330448 (Why is no real title available?)
- scientific article; zbMATH DE number 4119610 (Why is no real title available?)
- A complete, co-inductive syntactic theory of sequential control and state
- An algebraic interpretation of the \(\lambda\beta K\)-calculus; and an application of a labelled \(\lambda\)-calculus
- Bisimilarity as a theory of functional programming
- Bisimulation for higher-order process calculi
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- Continuations: A mathematical semantics for handling full jumps
- Full abstraction in the lazy lambda calculus
- Fully abstract models of typed \(\lambda\)-calculi
- On asynchrony in name-passing calculi
- On the bisimulation proof method
- On the call-by-value CPS transform and its semantics
- Programming Languages and Systems
- Reasoning about functions with effects
- Relational reasoning about contexts
- Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms
- The \(\pi\)-calculus: A theory of mobile processes
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Typed Normal Form Bisimulation
Cited in
(2)
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)