Another Look at Nested Recursion
- 1 January 2000
- book chapter
- Published by Springer Nature
- p. 498-518
- https://doi.org/10.1007/3-540-44659-1_31
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Automatic Derivation and Application of Induction Schemes for Mutually Recursive FunctionsPublished by Springer Nature ,2000
- Derivation and use of induction schemes in higher-order logicPublished by Springer Nature ,1997
- Termination of Nested and Mutually Recursive AlgorithmsJournal of Automated Reasoning, 1997
- Partial Functions in a Total SettingJournal of Automated Reasoning, 1997
- ML for the Working ProgrammerPublished by Cambridge University Press (CUP) ,1996
- Automating induction over mutually recursive functionsPublished by Springer Nature ,1996
- LCF examples in HOLThe Computer Journal, 1995
- Terminating general recursionBIT Numerical Mathematics, 1988
- Verifying the unification algorithm in LCFScience of Computer Programming, 1985
- Deductive synthesis of the unification algorithmScience of Computer Programming, 1981