|
7
|
Program Generation, Termination, and Binding-time Analysis
– Neil D. Jones, Arne J. Glenstrup
- 2002
|
|
14
|
Termination Analysis and Specialization-Point Insertion in Off-line Partial Evaluation
– Arne John Glenstrup, Neil D. Jones
- 2004
|
|
2
|
T.: Innermost reductions find all normal forms on right-linear terminating overlay TRSs
– Masahiko Sakai, Kouji Okamoto, Toshiki Sakabe
- 2003
|
|
30
|
Type-Based Termination of Recursive Definitions
– G. Barthe, M. J. Frade, E. Giménez, L. Pinto, T. Uustalu
- 2002
|
|
195
|
Termination of Term Rewriting Using Dependency Pairs
– Thomas Arts, Jürgen Giesl
- 2000
|
|
4
|
Binding-Time Analysis in Partial Evaluation: One Size Does Not Fit All
– Niels H. Christensen, Robert Glück, Søren Laursen
- 2000
|
|
18
|
Finiteness Analysis in Polynomial Time
– Chin Soon Lee
- 2002
|
|
38
|
Decidable Approximations of Sets of Descendants and Sets of Normal Forms
– Thomas Genet, Thomas Genet
- 1997
|
|
|
An implementation of a termination checker for Alfa
– Davidf Wahlstedt
- 2002
|
|
|
A Predicative Strong Normalisation Proof for a lambda-Calculus with Interleaving Inductive Types
– Andreas Abel, Thorsten Altenkirch
- 2000
|
|
|
Termination of Mutually Recursive Functions
– Andreas Abel
- 2000
|
|
|
Termination Checking = Type Checking: Structural Recursion beyond Subterm Ordering
– Andreas Abel
- 2001
|
|
|
A Predicative Strong Normalisation Proof for a
– Calculus With Interleaving, Andreas Abel, Thorsten Altenkirch
|
|
|
[[σ]] : P (Val τ (
– Andreas Abel, Abel Altenkirch
- 2004
|
|
8
|
A predicative strong normalisation proof for a λ-calculus with interleaving inductive types
– Andreas Abel, Thorsten Altenkirch
- 1999
|
|
6
|
Specification and Verification of a Formal System for Structurally Recursive Functions
– Andreas Abel
- 2000
|
|
|
DOI: 10.1017/S0960129503004122 Printed in the United Kingdom Type-based termination of recursive definitions
– G. Barthe, M. J. Frade, E. Gim Énez, L. Pinto
- 2000
|
|
6
|
Miniagda: Integrating sized and dependent types
– Andreas Abel
- 2010
|
|
1
|
Termination Checking Nested Inductive and Coinductive Types
– Thorsten Altenkirch, Nils Anders Danielsson
|