Termination Analysis of the Untyped λ-Calculus-Reference-Cited by-同舟云学术

Termination Analysis of the Untyped λ-Calculus

Published:2004 Issue: Volume: Page:1-23
ISSN:0302-9743
Container-title:Rewriting Techniques and Applications
language:
Short-container-title:

Author:

Jones Neil D.,Bohr Nina

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-25979-4_1

Reference9 articles.

1. Frederiksen, C.C., Jones, N.D.: Running-time Analysis and Implicit Complexity. Submitted to Journal of Automated reasoningJournal dadada

2. Girard, J.Y., Lafont, Y., Taylor, P.: Proofs and Types. Cambridge University Press, Cambridge (1989)

3. Jones, N.D., Nielson, F.: Abstract Interpretation: a Semantics-Based Tool for Program Analysis. In: Handbook of Logic in Computer Science, pp. 527–629. Oxford University Press, Oxford (1994)

4. Jones, N.D., Glenstrup, A.: Partial Evaluation Termination Analysis and Specialization-Point Insertion. ACM Transactions on Programming Languages and Systems (2004)

5. Lee, C.S., Jones, N.D., Ben-Amram, A.M.: The Size-Change Principle for Program Termination. In: POPL 2001: Proceedings 28th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (January 2001)

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The Strength of the SCT Criterion;Lecture Notes in Computer Science;2017

2. BÃ¼chi Complementation and Size-Change Termination;Logical Methods in Computer Science;2012-02-27

3. Binary Reachability Analysis of Higher Order Functional Programs;Static Analysis;2012

4. Lazy Abstraction for Size-Change Termination;Logic for Programming, Artificial Intelligence, and Reasoning;2010

5. A complexity tradeoff in ranking-function termination proofs;Acta Informatica;2008-12-03