Howe's method for higher-order languages
From MaRDI portal
Publication:5411983
DOI10.1017/CBO9780511792588.006zbMath1285.68110MaRDI QIDQ5411983
No author found.
Publication date: 25 April 2014
Published in: Advanced Topics in Bisimulation and Coinduction (Search for Journal in Brave)
Formal languages and automata (68Q45) Functional programming and lambda calculus (68N18) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (8)
A categorical framework for congruence of applicative bisimilarity in higher-order languages ⋮ On bisimilarity in lambda calculi with continuous probabilistic choice ⋮ Fairness and communication-based semantics for session-typed languages ⋮ Contextual Equivalences in Call-by-Need and Call-By-Name Polymorphically Typed Calculi (Preliminary Report) ⋮ Effectful applicative similarity for call-by-name lambda calculi ⋮ A case study in programming coinductive proofs: Howe’s method ⋮ Observational program calculi and the correctness of translations ⋮ Contextual equivalence for inductive definitions with binders in higher order typed functional programming
This page was built for publication: Howe's method for higher-order languages