Functional programming with apomorphisms (corecursion)

MaRDI QIDQ2718773zbMATH OpenFDO

Authors Varmo Vene, Tarmo Uustalu

Publication date 9 May 2001

Published in Proceedings of the Estonian Academy of Sciences. Physics, Mathematics (Search for Journal in Brave)

zbMATH Keywords

functional programming

Mathematics Subject Classification ID

Special categories (18B99) Theory of programming languages (68N15) Functional programming and lambda calculus (68N18)

Recommendations

• scientific article; zbMATH DE number 1343506
• Paramorphisms
• Recursion schemes from comonads
• Corecursive algebras: a study of general structured corecursion
• scientific article; zbMATH DE number 1231629

Cited in

(19)

• Paramorphisms
• Undecidability of equality for codata types
• Recursion schemes from comonads
• APLicative Programming with Naperian Functors
• The Expression Lemma
• scientific article; zbMATH DE number 5319932 (Why is no real title available?)
• scientific article; zbMATH DE number 1231629 (Why is no real title available?)
• scientific article; zbMATH DE number 1343506 (Why is no real title available?)
• scientific article; zbMATH DE number 517048 (Why is no real title available?)
• CoCaml: functional programming with regular coinductive types
• When is a function a fold or an unfold?
• Some remarks on type systems for course-of-value recursion
• Unifying structured recursion schemes. An extended study
• A duality of sorts
• Proof methods for corecursive programs
• Ramified Corecurrence and Logspace
• Folding over neural networks
• Classical (co)recursion: Mechanics
• Fantastic morphisms and where to find them. A guide to recursion schemes

This page was built for publication: Functional programming with apomorphisms (corecursion)

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