Detecting and removing dead-code using rank 2 intersection

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

Volumn 1512, Issue , 1998, Pages 66-87

  Damiani, Ferruccio ^a   Prost, Frédéric ^b  

^a UNIVERSITY OF TURIN   (Italy)

^b UNIVERSITÉ DE LYON   (France)

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATION PROGRAMS; CALCULATIONS; CODES (SYMBOLS); COMPUTATIONAL LINGUISTICS; DIFFERENTIATION (CALCULUS);

CARTESIAN PRODUCTS; FUNCTIONAL PROGRAMS; LOGICAL FRAMEWORKS; PROGRAM PROPERTIES; PROGRAM SPECIALIZATION; RANK-2 INTERSECTION; SIMPLY TYPED LAMBDA CALCULUS; TYPE INFERENCES;

STATIC ANALYSIS;

EID: 84958961452     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0097787     Document Type: Conference Paper

References (30)

1. H. P. Barendregt, M. Coppo, and M. Dezani-Ciancaglini. A filter lambda model and the completeness of type assignment. Journal of Symbolic Logic, 48:931-940, 1983.
2. B. Barras, S. Boutin, C. Comes, J. Courant, J.-C. Filliaˆtre, H. Herbelin, G. Huet, P. Manoury, C. Muñoz, C. Murthy, C. Parent, C. Paulin-Mohring, A. Saïbi, and B. Werner. The Coq Proof Assistant Reference Manual Version 6.1. INRIA-Rocquencourt-CNRS-ENS Lyon, December 1996.
3. P. N. Benton. Strictness Analysis of Lazy Functional Programs. PhD thesis, University of Cambridge, Pembroke College, 1992.
4. S. Berardi. Pruning Simply Typed Lambda Terms, 1993. Internal report. Dipartimento di Informatica, Universitá di Torino.
5. S. Berardi. Pruning Simply Typed Lambda Terms. Journal of Logic and Computation, 6(5):663-681, 1996.
6. S. Berardi and L. Boerio. Using Subtyping in Program Optimization. In Typed Lambda Calculus and Applications, 1995.
7. L. Boerio. Optimizing Programs Extracted from Proofs. PhD thesis, Universitá di Torino, 1995.
8. G. Castagna. Covariance and contravariance: conflict without a cause. ACM Transactions on Programming Languages and Systems, 17(3):431-447, 1995.
9. G. Castagna. Object-Oriented Programming: A Unified Foudation. Progress in Theoretical Computer Science Series. Birkhauser, Boston, December 1996.
10. M. Coppo, F. Damiani, and P. Giannini. Refinement Types for Program Analysis. In SAS’96, LNCS 1145, pages 143-158. Springer, 1996.
11. M. Coppo, F. Damiani, and P. Giannini. On Strictness and Totality. In TACS’97, LNCS 1281, pages 138-164. Springer, 1997.
12. M. Coppo and M. Dezani-Ciancaglini. An extension of basic functional theory for lambda-calculus. Notre Dame Journal of Formal Logic, 21(4):685-693, 1980.
13. D. Dussart and F. Henglein and C. Mossin. Polymorphic Recursion and Subtype Qualifications: Polymorphic Binding-Time Analysis in Polynomial Time. In SAS’95, LNCS 983, pages 118-135. Springer, 1995.
14. F. Damiani. Non-standard type inference for the static analysis of lazy functional programs. PhD thesis, Universitá di Torino. In preparation.
15. F. Damiani and P. Giannini. An Inference Algorithm for Strictness. In TLCA’97, LNCS 1210, pages 129-146. Springer, 1997.
16. C. Hankin and D. Le Métayer. Deriving algorithms for type inference systems: Applications to strictness analysis. In POPL’94, pages 202-212. ACM, 1994.
17. C. Hankin and D. Le Métayer. Lazy type inference and program analysis. Science of Computer Programming, 25:219-249, 1995.
18. T. P. Jensen. Abstract Interpretation in Logical Form. PhD thesis, University of London, Imperial College, 1992.
19. G. Kahn. Natural semantics. In K. Fuchi and M. Nivat, editors, Programming Of Future Generation Computer. Elsevier Sciences B.V. (North-Holland), 1988.
20. T. M. Kuo and P. Mishra. Strictness analysis: a new perspective based on type inference. In Functional Programming Languages and Computer Architecture, pages 260-272. ACM, 1989.
21. Z. Luo and R. Pollack. Lego proof development system: User’s manual. Technical Report ECS-LFCS-92-211, University of Edinburgh., 1992.
22. J. Palsberg and P. O’Keefe. A Type System Equivalent to Flow Analysis. In PO PL '95, pages 367-378. ACM, 1995.
23. w‘s Programs from Proofs in the Calculus of Constructions. In POPL’89. ACM, 1989.
24. C. Paulin-Mohring. Extraction des Programmes dans le Calcul des Constructions. PhD thesis, Université Paris, VII 1989.
25. A. M. Pitts. Operationally-based theories of program equivalence. In A. M. Pitts and P. Dybjer, editors, Semantics and Logics of Computation, pages 241-298. Cambridge University Press, 1997.
26. F. Prost. Marking techniques for extraction. Technical Report RR95-47, Ecole Normale Supérieure de Lyon, Lyon, December 1995.
27. K. L. Solberg. Annotated Type Systems for Program Analysis. PhD thesis, Aarhus University, Denmark, 1995. Revised version.
28. Y. Takayama. Extraction of Redundancy-free Programs from Constructive Natural Deduction Proofs. Journal of Symbolic Computation, 12:29-69, 1991.
29. S. van Bakel. Intersection Type Disciplines in Lambda Calculus and Applicative Term Rewriting Systems. PhD thesis, Katholieke Universiteit Nijmegen, 1993.
30. D. A. Wright. Reduction Types and Intensionality in the Lambda-Calculus. PhD thesis, University of Tasmania, 1992.