Coinductive characterizations of applicative structures

DOI10.1017/S096012959900287XMaRDI QIDQ4704763zbMATH OpenOpenAlexFDO

Authors Furio Honsell, Marina Lenisa

Publication date 25 November 1999

Published in Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s096012959900287x

zbMATH Keywords

applicative structuresCartesian graphscoinductionfinal semanticsfunctorlambda calculusmaximal fixed pointsmonotone operatorsobservational congruencesobservational equivalencesreasoning on program equivalencesstrongly extensional coalgebra

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Logic in computer science (03B70) Applications of set theory (03E75) Categorical logic, topoi (03G30) Categorical semantics of formal languages (18C50)

Recommendations

• A co-induction principle for recursively defined domains
• scientific article; zbMATH DE number 2185719
• A structural co-induction theorem
• scientific article; zbMATH DE number 860036

Cited in

(5)

• A co-induction principle for recursively defined domains
• scientific article; zbMATH DE number 7037626 (Why is no real title available?)
• Finally tagless, partially evaluated: Tagless staged interpreters for simpler typed languages
• Coalgebraic description of generalised binary methods
• Types, Tableaus and Gödel’s God in Isabelle/HOL

This page was built for publication: Coinductive characterizations of applicative structures

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