Recommendations
Cited in
(19)- Eager functions as processes
- Proving soundness of extensional normal-form bisimilarities
- On bisimilarity in lambda calculi with continuous probabilistic choice
- A curry-style semantics of interaction: from untyped to second-order lazy -calculus
- Complete trace models of state and control
- Infinite trace equivalence
- Normal form simulation for McCarthy's \textsf{amb}
- A Complete, Co-inductive Syntactic Theory of Sequential Control and State
- scientific article; zbMATH DE number 1330448 (Why is no real title available?)
- Proving soundness of extensional normal-form bisimilarities
- Bisimulations for delimited-control operators
- From applicative to environmental bisimulation
- Deciding contextual equivalence of \(\nu \)-calculus with effectful contexts
- Effectful normal form bisimulation
- From bounded checking to verification of equivalence via symbolic up-to techniques
- Fully abstract normal form bisimulation for call-by-value PCF
- Pushdown normal-form bisimulation: a nominal context-free approach to program equivalence
- A logical approach to type soundness
- On the observational theory of the CPS-calculus
This page was built for publication: Typed Normal Form Bisimulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608419)