Checked corecursive streams: expressivity and completeness
From MaRDI portal
Publication:6049926
DOI10.1016/j.tcs.2023.114081MaRDI QIDQ6049926
Pietro Barbieri, Davide Ancona, Elena Zucca
Publication date: 18 September 2023
Published in: Theoretical Computer Science (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fundamental properties of infinite trees
- Enhancing expressivity of checked corecursive streams
- A productivity checker for logic programming
- Generalizing Inference Systems by Coaxioms
- Concrete stream calculus: An extended study
- A Theoretical Perspective of Coinductive Logic Programming
- Using Structural Recursion for Corecursion
- Abstract interpretation and application to logic programs
- CoCaml: Functional Programming with Regular Coinductive Types
- A coinductive calculus of streams
- Flexible coinductive logic programming
- Co-Logic Programming: Extending Logic Programming with Coinduction
- Coalgebraic logic programming: from Semantics to Implementation
This page was built for publication: Checked corecursive streams: expressivity and completeness