Properties of a type abstract interpreter

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

Volumn 2575, Issue , 2003, Pages 132-145

  Gori, Roberta ^a   Levi, Giorgio ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

INFERENCE ENGINES; RECURSIVE FUNCTIONS;

FIXPOINT COMPUTATIONS; FIXPOINTS; INFERENCE ALGORITHM; POLYMORPHIC RECURSION; POLYMORPHIC TYPES; TYPE INFERENCE ALGORITHM; TYPE SYSTEMS;

MODEL CHECKING;

EID: 24944524190     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36384-x_13     Document Type: Article

References (12)

1. G. Cousineau and M. Mauny. The Functional Approach to Programming. Cambridge University Press, 1998.
2. P. Cousot. Types as abstract interpretations. In Conference Record of the 24th ACM Symp. on Principles of Programming Languages, pages 316-331. ACM Press, 1997.
3. P. Cousot and R. Cousot. Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. In Proceedings of Fourth ACM Symp. Principles of Programming Languages, pages 238-252, 1977.
4. P. Cousot and R. Cousot. Systematic Design of Program Analysis Frameworks. In Proceedings of Sixth ACM Symp. Principles of Programming Languages, pages 269-282, 1979.
5. P. Cousot and R. Cousot. Comparing the Galois Connection and Widening/Narrowing Approaches to Abstract Interpretation. In M. Bruynooghe and M. Wirsing, editors, Proceedings of PLILP'92, volume 631 of Lecture Notes in Computer Science, pages 269-295. Springer-Verlag, 1992.
6. L. Damas and R. Milner. Principal type-schemes for functional programs. In Proceedings of the Ninth Annual ACM Symposium on Principles of Programming Languages, pages 207-212. ACM Press, 1982.
7. R. Gori and G. Levi. An experiment in type inference and verification by abstract interpretation. In A. Cortesi, editor, Proc. of the VMCAI'02 workshop on Abstract Interpretaion and Model Checking, volume 2294 of LNCS, pages 225-239, 2002.
8. J. R. Hindley. The principal type-scheme of an object in combinatory logic. Transactions American Mathematical Society, 146:29-60, 1969.
9. J. Mitchell. Type systems for programming languages, volume B of Handbook of Theoretical Computer Science, pages 365-458. Elsevier, 1990.
10. B. Monsuez. Polymorphic typing by abstract interpretation. In R. Shyamasundar, editor, Proceedings of Foundation of Software Technology and Theoretical Computer Science, volume 652 of Lecture Notes in Computer Science, pages 217-228. Springer-Verlag, 1992.
11. B. Monsuez. Polymorphic types and widening operators. In P. Cousot, M. Falaschi, G. Filè, and A. Rauzy, editors, Proceedings of Static Analysis, volume 724 of Lecture Notes in Computer Science, pages 224-281. Springer-Verlag, 1993.
12. A. Mycroft. Polymorphic type schemes and recursive definitions. In G. Goos and J. Hartmanis, editors, Proceedings of the International Symposium on Programming, volume 167 of Lecture Notes in Computer Science, pages 217-228. Springer-Verlag, 1984.