Refinement types for program analysis

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

Volumn 1145, Issue , 1996, Pages 143-158

  Coppo, Mario ^a   Damiani, Ferruccio ^a   Giannini, Paola ^a  

^a UNIVERSITY OF TURIN   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATION PROGRAMS; CALCULATIONS; CODES (SYMBOLS); DIFFERENTIATION (CALCULUS); INFERENCE ENGINES;

FUNCTIONAL PROGRAMS; LOGICAL FRAMEWORKS; PROGRAM ANALYSIS; PROGRAM PROPERTIES; PROGRAM SPECIALIZATION; SIMPLY TYPED LAMBDA CALCULUS; TYPE INFERENCES; TYPE STRUCTURES;

STATIC ANALYSIS;

EID: 84957647461     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61739-6_39     Document Type: Conference Paper

References (18)

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. S. Berardi. Pruning Simply Typed Lambda Terms. Journal of Symbolic Computation, to appear.
3. S. Berardi and L. Boerio. Using Subtyping in Program Optimization. In Typed Lambda Calculus and Applications, 1995.
4. 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.
5. M. Coppo and A. Ferrari. Type inference, abstract interpretation and strictness analysis. In M. Dezani-Ciancaglini et al, editors, A collection of contributions in honour of Corrado Böhm, pages 113-145. Elsevier, 1993.
6. M. Coppo and P. Giannini. Pricipal Types and Unification for Simple Intersection Types Systems. Information and Computation, 122(1):70-96, 1995.
7. F. Damiani and P. Giannini. A Decidable Intersection Type System based on Relevance. In Theoretical Aspects of Computer Software, LNCS 789. Springer, 1994.
8. C. Hankin and D. Le Metayer. A Type-Based Framework for Program Analysis. In Static Analisys, LNCS 864, pages 380-394. Springer, 1994.
9. R. Hindley. The principal types schemes for an object in combinatory logic. Transactions of American Mathematical Society, 1.46:29-60, 1969.
10. L.S. Hunt and D. Sands. Binding Time Analysis: A New PERspective. In Proceedings of the ACM Symposium on Partial Evaluation and Semantics-based Program Manipulation, 1991.
11. P. O'Keefe J. Palsberg. A Type System Equivalent to Flow Analysis. In Principles of Programming Languages, 1995.
12. T. P. Jensen. Strictness Analysis in Logical Form. In J. Hughes, editor, Proceedings of the 5th ACM Conference on Functional Programming Languages and Computer Architecture, pages 98-105, 1991.
13. H. R. Nielson K. L. Solberg and F. Nielson. Strictness and Totality Analysis. In Static Analisys, LNCS 864, pages 408-422. Springer, 1994.
14. D. Leivant. Polymorphic Type Inference. In Principles of Programming Languages. ACM, 1983.
15. R. Milner. A Theory of Type Polymorphism in Programming. Journal of Computer and System Science, 17:348-375, 1978.
16. F. Prost. Marking techniques for extraction. Technical report, Ecole Normale Supérieure de Lyon, Lyon, December 1995.
17. T.M.Kuo and P.Mishra. Strictness analysis: a new perspective based on type inference. In Functional Programming Languages and Computer Architecture. ACM, 1989.
18. D. A. Wright. A New Technique for Strictness Analysis. In Proceedings of TAP- SOFT'91, LNCS 494, pages 260-272. Springer, 1991.