Termination analysis of the untyped λ-calculus

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3091, Issue , 2004, Pages 1-23

  Jones, Neil D ^a   Bohr, Nina ^b  

^a UNIVERSITY OF COPENHAGEN   (Denmark)

^b IT UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; DIFFERENTIATION (CALCULUS); FUNCTION EVALUATION; RECURSIVE FUNCTIONS;

FIRST ORDER; MUTUAL RECURSION; RECURSIVE ALGORITHMS; RECURSIVE PROGRAMS; SIZE-CHANGE PRINCIPLE; TERMINATION ANALYSIS; UNTYPED LAMBDA CALCULUS; VALUE EVALUATIONS;

ALGORITHMS;

EID: 26444525305     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-25979-4_1     Document Type: Article

References (9)

1. C.C. Frederiksen and N.D. Jones. Running-time Analysis and Implicit Complexity. Submitted to Journal of Automated reasoning Journal dadada.
2. J.Y. Girard, Y. Lafont, P. Taylor. Proofs and Types. Cambridge University Press, 1989.
3. N.D. Jones and F. Nielson. Abstract Interpretation: a Semantics-Based Tool for Program Analysis. In Handbook of Logic in Computer Science, pp.527-629. Oxford University Press, 1994.
4. N.D. Jones and A. Glenstrup. Partial Evaluation Termination Analysis and Specialization-Point Insertion. ACM Transactions on Programming Languages and Systems, to appear in 2004.
5. th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, January 2001.
6. C.S. Lee. Finiteness analysis in polynomial time. In Static Analysis: 9th International Symposium, SAS 2002 (M Hermenegildo and G Puebla, eds.), pp. 493-508. Volume 2477 of Lecture Notes in Computer Science. Springer. September, 2002.
7. C.S. Lee. Program termination analysis in polynomial time. In Generative Programming and Component Engineering: ACM SIGPLAN/SIGSOFT Conference, GPCE 2002 (D Batory, C Consel, and W Taha, eds.), pp. 218-235. Volume 2487 of Lecture Notes in Computer Science.
8. C.S. Lee. Program Termination Analysis and the Termination of Offline Partial Evaluation Ph.D. thesis, University of Western Australia, March 2001
9. G.D. Plotkin. Call-by-name, call-by-value and the lambda-calculus. Theoretical Computer Science, 1, 1975.