Typed Normal Form Bisimulation
From MaRDI portal
Publication:3608419
DOI10.1007/978-3-540-74915-8_23zbMath1179.68038OpenAlexW1491719272MaRDI QIDQ3608419
Søren B. Lassen, Paul Blain Levy
Publication date: 5 March 2009
Published in: Computer Science Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-74915-8_23
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Combinatory logic and lambda calculus (03B40)
Related Items (11)
Eager functions as processes ⋮ Proving soundness of extensional normal-form bisimilarities ⋮ On bisimilarity in lambda calculi with continuous probabilistic choice ⋮ A Complete, Co-inductive Syntactic Theory of Sequential Control and State ⋮ Deciding contextual equivalence of \(\nu \)-calculus with effectful contexts ⋮ A curry-style semantics of interaction: from untyped to second-order lazy \(\lambda\mu\)-calculus ⋮ Complete trace models of state and control ⋮ Infinite trace equivalence ⋮ On the observational theory of the CPS-calculus ⋮ From Applicative to Environmental Bisimulation ⋮ Unnamed Item
This page was built for publication: Typed Normal Form Bisimulation
