Checking equivalence of corecursive streams: an inductive procedure

DOI10.1016/J.TCS.2024.114680MaRDI QIDQ6589842zbMATH OpenFDO

Authors Davide Ancona, Pietro Barbieri, Elena Zucca

Publication date 20 August 2024

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2024.114680

zbMATH Keywords

operational semanticsregular treesstream programming

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A coinductive calculus of streams
• A productivity checker for logic programming
• An algebraic definition for control structures
• Automatic sequences and zip-specifications
• Checked corecursive streams: expressivity and completeness
• Co-induction in relational semantics
• Co-Logic Programming: Extending Logic Programming with Coinduction
• Coalgebraic logic programming: from Semantics to Implementation
• CoCaml: functional programming with regular coinductive types
• Coinduction in uniform: foundations for corecursive proof search with Horn clauses
• Coinductive big-step operational semantics
• Computing with capsules
• Concrete stream calculus: an extended study
• Enhancing expressivity of checked corecursive streams
• Flexible coinductive logic programming
• Foundations of regular coinduction
• Free iterative theories: a coalgebraic view
• Fundamental properties of infinite trees
• On the complexity of stream equality
• Recursive subtyping revealed
• Using Structural Recursion for Corecursion

Cited in

(1)

• Preface

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)