Applicative bisimilarities for call-by-name and call-by-value -calculus
From MaRDI portal
Publication:283739
DOI10.1016/J.ENTCS.2014.10.004zbMATH Open1337.68056OpenAlexW2122794371WikidataQ113317852 ScholiaQ113317852MaRDI QIDQ283739FDOQ283739
Authors: Dariusz Biernacki, Sergueï Lenglet 
Publication date: 13 May 2016
Full work available at URL: https://doi.org/10.1016/j.entcs.2014.10.004
Recommendations
Cites Work
- Title not available (Why is that?)
- 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
- \(\lambda\mu\)-calculus and Böhm's theorem
- Applicative bisimulations for delimited-control operators
- A complete, co-inductive syntactic theory of sequential control and state
- Title not available (Why is that?)
- From applicative to environmental bisimulation
Cited In (7)
- Term Rewriting and Applications
- Effectful applicative similarity for call-by-name lambda calculi
- The Benefit of Being Non-Lazy in Probabilistic λ-calculus
- Bisimulations for delimited-control operators
- Fully abstract encodings of \(\lambda\)-calculus in HOcore through abstract machines
- On applicative similarity, sequentiality, and full abstraction
- Applicative bisimulations for delimited-control operators
This page was built for publication: Applicative bisimilarities for call-by-name and call-by-value \(\lambda\mu\)-calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q283739)
