Applicative bisimilarities for call-by-name and call-by-value \(\lambda\mu\)-calculus

DOI10.1016/j.entcs.2014.10.004zbMath1337.68056OpenAlexW2122794371WikidataQ113317852 ScholiaQ113317852MaRDI QIDQ283739

Sergueï Lenglet, Dariusz Biernacki

Publication date: 13 May 2016

Full work available at URL: https://doi.org/10.1016/j.entcs.2014.10.004

zbMATH Keywords

continuationapplicative bisimulationcontextual equivalencecontrol operator

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Related Items

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• The revised report on the syntactic theories of sequential control and state
• Bisimilarity as a theory of functional programming
• Proving congruence of bisimulation in functional programming languages
• λμ-calculus and Böhm's theorem
• Applicative Bisimulations for Delimited-Control Operators
• A complete, co-inductive syntactic theory of sequential control and state
• From Applicative to Environmental Bisimulation