A predicative analysis of structural recursion

Journal of Functional Programming

Volumn 12, Issue 1, 2002, Pages 1-41

  Abel, Andreas ^a   Altenkirch, Thorsten ^b  

^a UNIVERSITY OF MUNICH   (Germany)

^b UNIVERSITY OF NOTTINGHAM   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL OPERATORS; RECURSIVE FUNCTIONS; SEMANTICS; SYNTACTICS; TREES (MATHEMATICS);

FUNCTIONAL PROGRAMMING;

COMPUTER PROGRAMMING LANGUAGES;

EID: 0036010443     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/s0956796801004191     Document Type: Article

References (30)

1. Specification and verification of a formal system for structurally recursive functions
2. A predicative strong normalisation proof for a λ-calculus with interleaving inductive types
3. Analysis of a guard condition in type theory
4. Inductive data type systems
5. Pattern matching with dependent types
6. The calculus of constructions
7. Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem
8. Termination of rewriting
9. Termination analysis for functional programs using term orderings
10. Codifying guarded definitions with recursive schemes
11. Structural recursive definitions in type theory
12. Extensions to the estimation calculus
13. A framework for defining logics
14. The size-change principle for program termination
15. Walther recursion
16. Termination and reduction checking in the logical framework
17. A lattice-theoretical fixpoint theorem and its applications
18. Ensuring termination in ESFP
19. Argument-bounded algorithms as a basis for automated termination proofs