Checking equivalence of corecursive streams: an inductive procedure
From MaRDI portal
Publication:6589842
DOI10.1016/J.TCS.2024.114680MaRDI QIDQ6589842
Pietro Barbieri, Elena Zucca, Davide Ancona
Publication date: 20 August 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Coinductive big-step operational semantics
- Fundamental properties of infinite trees
- An algebraic definition for control structures
- Co-induction in relational semantics
- Enhancing expressivity of checked corecursive streams
- A productivity checker for logic programming
- On the complexity of stream equality
- Automatic Sequences and Zip-Specifications
- Concrete stream calculus: An extended study
- Using Structural Recursion for Corecursion
- Free iterative theories: a coalgebraic view
- CoCaml: Functional Programming with Regular Coinductive Types
- A coinductive calculus of streams
- Recursive subtyping revealed
- Flexible coinductive logic programming
- Co-Logic Programming: Extending Logic Programming with Coinduction
- Coalgebraic logic programming: from Semantics to Implementation
- Checked corecursive streams: expressivity and completeness
- Coinduction in uniform: foundations for corecursive proof search with Horn clauses
Related Items (1)
This page was built for publication: Checking equivalence of corecursive streams: an inductive procedure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6589842)
