Classical (co)recursion: Mechanics

DOI10.1017/s0956796822000168arXiv2103.08521OpenAlexW3152464979MaRDI QIDQ6132720

Paul Downen, Zena M. Ariola

Publication date: 14 July 2023

Published in: Journal of Functional Programming (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear logic
• Strong categorical datatypes II: A term logic for categorical programming
• Data structures and program transformation
• Automatic synthesis of typed \(\Lambda\)-programs on term algebras
• On a hitherto unexploited extension of the finitary standpoint
• Paramorphisms
• Untersuchungen über das logische Schliessen. I
• Abstracting models of strong normalization for classical calculi
• A call-by-name lambda-calculus machine
• A lattice-theoretical fixpoint theorem and its applications
• Practical Foundations for Programming Languages
• Copatterns
• The duality of computation
• Structures for structural recursion
• Introduction to Bisimulation and Coinduction
• CoCaml: Functional Programming with Regular Coinductive Types
• Flexible coinductive logic programming
• The Duality of Classical Intersection and Union Types
• Wellfounded recursion with copatterns
• Unifying structured recursion schemes
• Call-by-value is dual to call-by-name