A term calculus for (co-)recursive definitions on streamlike data structures
From MaRDI portal
Recommendations
Cites work
Cited in
(14)- Type-Based Productivity of Stream Definitions in the Calculus of Constructions
- Using Structural Recursion for Corecursion
- Lazy productivity via termination
- Coinduction for exact real number computation
- Productivity of stream definitions
- The $\Pi^0_2$ -Completeness of Most of the Properties of Rewriting Systems You Care About (and Productivity)
- Pure type systems with corecursion on streams, from finite to infinitary normalisation
- A user's friendly syntax to define recursive functions as typed λ-terms
- Upper Bounds on Stream I/O Using Semantic Interpretations
- Concrete stream calculus: an extended study
- Structured general corecursion and coinductive graphs (extended abstract)
- Inductive and coinductive components of corecursive functions in Coq
- Functional pearl: streams and unique fixed points
- scientific article; zbMATH DE number 3903936 (Why is no real title available?)
This page was built for publication: A term calculus for (co-)recursive definitions on streamlike data structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2566066)