Co-induction in relational semantics

DOI10.1016/0304-3975(91)90033-XzbMath0755.68100OpenAlexW2071095465MaRDI QIDQ1177158

Mads Tofte, Arthur J. Milner

Publication date: 26 June 1992

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(91)90033-x

zbMATH Keywords

functional programming languagerecursive functionsfixpoint induction

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Related Items

Simple type inference for term graph rewriting systems ⋮ A simplified account of polymorphic references ⋮ A structural co-induction theorem ⋮ A Co-inductive Language and Truth Degrees ⋮ Reasoning about object-based calculi in (co)inductive type theory and the theory of contexts ⋮ A concrete final coalgebra theorem for ZF set theory ⋮ Infinite objects in type theory ⋮ Practical coinduction ⋮ Type inference for polymorphic references ⋮ Control-flow analysis of function calls and returns by abstract interpretation ⋮ Generalizing Inference Systems by Coaxioms ⋮ Unnamed Item ⋮ The fixed-point theory of strictly causal functions ⋮ Bisimulation and coinduction enhancements: a historical perspective ⋮ Coinductive big-step operational semantics ⋮ Using a generalisation critic to find bisimulations for coinductive proofs ⋮ Universal coalgebra: A theory of systems ⋮ Final coalgebras and the Hennessy-Milner property ⋮ A hidden Herbrand theorem: Combining the object and logic paradigms ⋮ A proof method for the correctness of modularized 0CFA ⋮ A co-induction principle for recursively defined domains ⋮ Constructive design of a hierarchy of semantics of a transition system by abstract interpretation

Uses Software

• ML

Cites Work

• Type inference for polymorphic references
• A calculus of communicating systems
• A theory of type polymorphism in programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Co-induction in relational semantics