Mutual recursion
Top View
- Chapter 3 Recursion in the Pointfree Style
- Defining (Co)Datatypes and Primitively (Co)Recursive Functions in Isabelle
- Some History of Functional Programming Languages
- Introduction and Scheme
- Recursion for the Masses
- Verifying Higher-Order Imperative Programs with Higher-Order Separation Logic
- Squibs and Discussions: Memoization in Top-Down Parsing
- The Decorator Pattern in Haskell
- The ZARF Architecture for Recursive Functions
- Recursive Structures for Standard ML
- Programming in Standard ML
- Inlining: a Tool for Eliminating Mutual Recursion
- Limited Second-Order Functionality in a First-Order Setting
- Faster Coroutine Pipelines: a Reconstruction
- Mutual Coinduction
- A Brief Introduction to SML
- Mechanizing Coinduction and Corecursion in Higher-Order Logic
- Unifying Functional Programming and Logical Reasoning in a Language Based on Mendler-Style Recursion Schemes and Term-Indexed Types