Well-founded coalgebras, revisited

DOI10.1017/S0960129515000481zbMath1376.68094MaRDI QIDQ5361146

Jean-Baptiste Jeannin, Alexandra Silva, Dexter Kozen

Publication date: 27 September 2017

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

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (1)

Generalizing Inference Systems by Coaxioms

Uses Software

• OCaml
• CalcCheck

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Compilation of extended recursion in call-by-value functional languages
• Categorical set theory: A characterization of the category of sets
• A fixpoint theorem for complete categories
• Recursive coalgebras of finitary functors
• Corecursive Algebras: A Study of General Structured Corecursion
• A programming language for the inductive sets, and applications
• CoCaml: Functional Programming with Regular Coinductive Types
• Elgot Algebras
• Language Constructs for Non-Well-Founded Computation
• Realization of Coinductive Types

This page was built for publication: Well-founded coalgebras, revisited