Coinductive characterizations of applicative structures

DOI10.1017/S096012959900287XzbMath0935.03046OpenAlexW2110860127MaRDI QIDQ4704763

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

monotone operatorsfunctorlambda calculuscoinductionobservational equivalencesCartesian graphsobservational congruencesapplicative structuresfinal semanticsmaximal fixed pointsreasoning on program equivalencesstrongly extensional coalgebra

Mathematics Subject Classification ID

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

Related Items (2)

Coalgebraic description of generalised binary methods ⋮ Finally tagless, partially evaluated: Tagless staged interpreters for simpler typed languages

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