Applicative bisimilarities for call-by-name and call-by-value -calculus
From MaRDI portal
(Redirected from Publication:283739)
Applicative bisimilarities for call-by-name and call-by-value \(\lambda\mu\)-calculus
Applicative bisimilarities for call-by-name and call-by-value \(\lambda\mu\)-calculus
Recommendations
Cites work
- scientific article; zbMATH DE number 1324438 (Why is no real title available?)
- scientific article; zbMATH DE number 1330448 (Why is no real title available?)
- A complete, co-inductive syntactic theory of sequential control and state
- Applicative bisimulations for delimited-control operators
- Bisimilarity as a theory of functional programming
- From applicative to environmental bisimulation
- Proving congruence of bisimulation in functional programming languages
- The revised report on the syntactic theories of sequential control and state
- \(\lambda\mu\)-calculus and Böhm's theorem
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)
