Corecursion
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
- ESOP
- 2017
We introduce AmiCo, a tool that extends a proof assistant, Isabelle/ HOL, with flexible function definitions well beyond… (More)
Is this relevant?
2015
2015
- CALCO
- 2015
Kurz et al. have recently shown that infinite λ-trees with finitely many free variables modulo α-equivalence form a final… (More)
Is this relevant?
2015
2015
- ICFP
- 2015
This paper presents a formalized framework for defining corecursive functions safely in a total setting, based on corecursion up… (More)
Is this relevant?
2014
2014
- ArXiv
- 2014
This paper presents a formalized framework for defining corecursive functions safely in a total setting, based on corecursion up… (More)
Is this relevant?
2012
2012
- ArXiv
- 2012
We investigate feasible computation over a fairly general notion of data and codata. Specifically, we present a direct Bellantoni… (More)
Is this relevant?
2012
2012
- CMCS
- 2012
Gabbay and Pitts proved that lambda-terms up to alphaequivalence constitute an initial algebra for a certain endofunctor on the… (More)
Is this relevant?
2009
2009
- SBMF
- 2009
We study general structured corecursion, dualizing the work of Osius, Taylor, and others on general structured recursion. We call… (More)
Is this relevant?
1998
1998
- 1998
In the mainstream categorical approach to typed (total) functional programming, functions with inductive source types deened by… (More)
Is this relevant?
1998
1998
- Electr. Notes Theor. Comput. Sci.
- 1998
This paper investigates corecursive deenitions which are at the same time monadic. This corresponds to functions that generate a… (More)
Is this relevant?
Review
1997
Review
1997
- Logic Journal of the IGPL
- 1997
We consider foundational questions related to the de nition of functions by corecursion. This method is especially suited to… (More)
Is this relevant?