scientific article; zbMATH DE number 7649963
From MaRDI portal
Publication:5875422
DOI10.4230/LIPICS.ITP.2019.14MaRDI QIDQ5875422FDOQ5875422
Authors: Łukasz Czajka 
Publication date: 3 February 2023
Title of this publication is not available (Why is that?)
Recommendations
- Programming and reasoning with guarded recursion for coinductive types
- Guarded dependent type theory with coinductive types
- The Guarded Lambda-Calculus: Programming and Reasoning with Guarded Recursion for Coinductive Types
- Formalized, effective domain theory in Coq
- Circular coinduction in Coq using bisimulation-up-to techniques
- Inductive and coinductive components of corecursive functions in Coq
- CoCaml: functional programming with regular coinductive types
- Initial semantics for higher-order typed syntax in \textsf{Coq}
- Coalgebraic Reasoning in Coq: Bisimulation and the λ-Coiteration Scheme
- Towards Rewriting in Coq
Cites Work
- The power of parameterization in coinductive proof
- Hammer for Coq: automation for dependent type theory
- Universal coalgebra: A theory of systems
- A lattice-theoretical fixpoint theorem and its applications
- Title not available (Why is that?)
- Introduction to bisimulation and coinduction
- An introduction to (co)algebra and (co)induction
- Inductive types and type constraints in the second-order lambda calculus
- Title not available (Why is that?)
- Practical coinduction
- Well-founded recursion with copatterns and sized types
- Title not available (Why is that?)
Cited In (2)
Uses Software
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5875422)
