Foundations of regular coinduction

MaRDI QIDQ5028421zbMATH OpenFDO

Authors Francesco Dagnino

Publication date 9 February 2022

Full work available at URL https://arxiv.org/abs/2006.02887, https://lmcs.episciences.org/8539

zbMATH Keywords

coinductionfixed pointsinference systemsregular trees

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Recommendations

• scientific article; zbMATH DE number 7037626
• Generalizing inference systems by coaxioms
• Algebra and Coalgebra in Computer Science
• Circular coinduction: a proof theoretical foundation
• On the Proof Theory of Regular Fixed Points

Cites work

• A general account of coinduction up-to
• A lattice-theoretical fixpoint theorem and its applications
• A new foundation for finitary corecursion and iterative algebras
• A new foundation for finitary corecursion. The locally finite fixpoint and its properties
• A theoretical perspective of coinductive logic programming
• Automated Reasoning with Analytic Tableaux and Related Methods
• Co-Logic Programming: Extending Logic Programming with Coinduction
• CoCaml: functional programming with regular coinductive types
• Coinductive big-step operational semantics
• Coinductive Logic Programming
• Finiteness and rational sequences, constructively
• Flexible coinductive logic programming
• Fundamental properties of infinite trees
• Generalizing inference systems by coaxioms
• Grammar Analysis and Parsing by Abstract Interpretation
• scientific article; zbMATH DE number 1728247 (Why is no real title available?)
• scientific article; zbMATH DE number 6680140 (Why is no real title available?)
• scientific article; zbMATH DE number 7037626 (Why is no real title available?)
• scientific article; zbMATH DE number 3506643 (Why is no real title available?)
• scientific article; zbMATH DE number 1748069 (Why is no real title available?)
• scientific article; zbMATH DE number 2087442 (Why is no real title available?)
• Infinite trees and completely iterative theories: A coalgebraic view
• Introduction to bisimulation and coinduction
• Iterative algebras at work
• Language constructs for non-well-founded computation
• Sequent calculi for induction and infinite descent
• The power of parameterization in coinductive proof

Cited in

(7)

• Non-well-founded deduction for induction and coinduction
• Enhancing expressivity of checked corecursive streams
• On the Foundations of Corecursion
• Deconfined Global Types for Asynchronous Sessions
• Checked corecursive streams: expressivity and completeness
• Checking equivalence of corecursive streams: an inductive procedure
• Dependent type refinements for futures

Describes a project that uses

Uses Software

• coFJ
• Paco
• CoCaml

This page was built for publication: Foundations of regular coinduction

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