Howe's method for higher-order languages

DOI10.1017/CBO9780511792588.006MaRDI QIDQ5411983zbMATH OpenFDO

Authors

Publication date 25 April 2014

Published in Advanced Topics in Bisimulation and Coinduction (Search for Journal in Brave)

Mathematics Subject Classification ID

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)

Recommendations

• Infinitary Howe's method
• scientific article; zbMATH DE number 1241702
• Operational and semantic equivalence between recursive programs.
• From operational to denotational semantics
• scientific article; zbMATH DE number 4180818

Cited in

(9)

• Effectful applicative similarity for call-by-name lambda calculi
• On bisimilarity in lambda calculi with continuous probabilistic choice
• Observational program calculi and the correctness of translations
• A case study in programming coinductive proofs: Howe's method
• Fairness and communication-based semantics for session-typed languages
• Light genericity
• Contextual Equivalences in Call-by-Need and Call-By-Name Polymorphically Typed Calculi (Preliminary Report)
• A categorical framework for congruence of applicative bisimilarity in higher-order languages
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5411983)