Enhancing expressivity of checked corecursive streams

DOI10.1007/978-3-030-99461-7_1MaRDI QIDQ2163153zbMATH OpenOpenAlexFDO

Authors Davide Ancona, Pietro Barbieri, Elena Zucca

Publication date 10 August 2022

Full work available at URL https://arxiv.org/abs/2202.06868

zbMATH Keywords

operational semanticsruntime checkingstream programming

Mathematics Subject Classification ID

Logic programming (68N17) Functional programming and lambda calculus (68N18)

Recommendations

• Using Structural Recursion for Corecursion
• Well-Definedness of Streams by Termination
• Well-definedness of streams by transformation and termination
• Concrete stream calculus: an extended study
• Productivity of stream definitions

Cites work

• A coinductive calculus of streams
• A new coinductive confluence proof for infinitary lambda calculus
• A productivity checker for logic programming
• A theoretical perspective of coinductive logic programming
• Co-Logic Programming: Extending Logic Programming with Coinduction
• Coalgebraic logic programming: from Semantics to Implementation
• CoCaml: functional programming with regular coinductive types
• Computing with capsules
• Concrete stream calculus: an extended study
• Enhancing expressivity of checked corecursive streams
• Flexible coinductive logic programming
• Foundations of regular coinduction
• Fundamental properties of infinite trees
• Generalizing inference systems by coaxioms

Cited in

(3)

• Enhancing expressivity of checked corecursive streams
• Checked corecursive streams: expressivity and completeness
• Checking equivalence of corecursive streams: an inductive procedure

Describes a project that uses

Uses Software

• CoALP
• coFJ
• CoCaml

This page was built for publication: Enhancing expressivity of checked corecursive streams

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2163153)