The following pages link to Terminating general recursion (Q1112584):
Displaying 13 items.
- Certified CYK parsing of context-free languages (Q465493) (← links)
- Normalising the associative law: An experiment with Martin-Löf's type theory (Q809071) (← links)
- Do-it-yourself type theory (Q911744) (← links)
- Program development in constructive type theory (Q1190474) (← links)
- Synthesis of ML programs in the system Coq (Q1322847) (← links)
- Inductive families (Q1336951) (← links)
- Set theory for verification. II: Induction and recursion (Q1904402) (← links)
- Formal derivation of greedy algorithms from relational specifications: a tutorial (Q2374306) (← links)
- Inductive and Coinductive Components of Corecursive Functions in Coq (Q2873661) (← links)
- A Decision Procedure for Regular Expression Equivalence in Type Theory (Q3100207) (← links)
- Using Structural Recursion for Corecursion (Q3638255) (← links)
- Algebra of programming in Agda: Dependent types for relational program derivation (Q3644935) (← links)
- Partiality and recursion in interactive theorem provers – an overview (Q5741556) (← links)
