The following pages link to Paramorphisms (Q1201295):
Displaying 23 items.
- Constructing language processors with algebra combinators (Q608238) (← links)
- Metamorphisms: streaming representation-changers (Q870275) (← links)
- Datatype-generic termination proofs (Q1015386) (← links)
- See more through lenses than bananas (Q1349889) (← links)
- Reasoning about algebraic data types with abstractions (Q1694026) (← links)
- Theory and applications of inverting functions as folds (Q1881267) (← links)
- Functional programming with apomorphisms (corecursion) (Q2718773) (← links)
- Conjugate hylomorphisms -- or: the mother of all structured recursion schemes (Q2819837) (← links)
- Scala for generic programmers (Q3070770) (← links)
- The algebra of recursive graph transformation language UnCAL: complete axiomatisation and iteration categorical semantics (Q3130301) (← links)
- The Expression Lemma (Q3521989) (← links)
- (Q3561146) (← links)
- When is a function a fold or an unfold? (Q4917036) (← links)
- Folding left and right over Peano numbers (Q4972067) (← links)
- (Q5014444) (← links)
- Algebraic Specialization of Generic Functions for Recursive Types (Q5166621) (← links)
- Some Remarks on Type Systems for Course-of-value Recursion (Q5178964) (← links)
- Unifying structured recursion schemes (Q5371980) (← links)
- A Duality of Sorts (Q5410453) (← links)
- Least and greatest fixed points in intuitionistic natural deduction (Q5958300) (← links)
- Folding left and right matters: Direct style, accumulators, and continuations (Q6099203) (← links)
- Classical (co)recursion: Mechanics (Q6132720) (← links)
- Recursion schemes in Coq (Q6536316) (← links)
