Structured general corecursion and coinductive graphs (extended abstract)

MaRDI QIDQ5854739zbMATH OpenFDO

Authors Tarmo Uustalu

Publication date 17 March 2021

Full work available at URL https://arxiv.org/abs/1202.3502, http://eptcs.web.cse.unsw.edu.au/paper.cgi?FICS2012.8

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• Using Structural Recursion for Corecursion
• Inductive and coinductive components of corecursive functions in Coq
• Corecursive algebras: a study of general structured corecursion
• Another look at function domains
• A term calculus for (co-)recursive definitions on streamlike data structures

Cited in

(7)

• Generalized coiteration schemata
• Inductive and coinductive components of corecursive functions in Coq
• Using Structural Recursion for Corecursion
• Corecursive algebras: a study of general structured corecursion
• Cograph editing: Merging modules is equivalent to editing P₄s
• V→M: A Virtual Machine for Strict Evaluation of (Co)Recursive Functions
• Implicit complexity for coinductive data: a characterization of corecurrence

This page was built for publication: Structured general corecursion and coinductive graphs (extended abstract)

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