A relational framework for abstract interpretation

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

Volumn 217 LNCS, Issue , 1986, Pages 156-171

  Mycroft, Alan ^a   Jones, Neil D ^b  

^a New Museums Site   (United Kingdom)

^b DIKU   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; MODEL CHECKING;

ABSTRACT INTERPRETATIONS; HIGHER-ORDER; HINDLEY/MILNER; LOGICAL RELATIONS; POWER DOMAIN; STANDARD INTERPRETATION; TYPE SYSTEMS;

PROGRAM TRANSLATORS;

EID: 85030633680     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-16446-4_9     Document Type: Conference Paper

References (19)

1. Abramsky, S. Strictness analysis based on logical relations. Unpublished manuscript, 1985.
2. Burn, G., Hankin, C. and Abramsky, S. The theory and practice of strictness analysis for higher order functions. Imperial college report DoC 85/6, 1985. To appear in Science of Computer Programming.
3. Cousot, P. and Cousot, R. Abstract interpretation: a unified lattice model for static analysis of programs by construction and approximation of fixpoints. Proc. ACM symp. on Principles of Programming Languages, 1977.
4. Damas, L. and Milner, R. Principal type schemes for functional programs. Proc. ACM symp. on Principles of Programming Languages, 1980.
5. Donzeau-Gouge, V. Utilisation de la sémantique dénotationelle pour l'étude d'interprétations non-standard. INRIA rapport 273, 1978.
6. Dybjer, P. Domain Algebras. Lecture Notes in Computer Science: Proc. 11th ICALP, vol. 172, Springer-Verlag, 1984.
7. Jones, N.D. and Mycroft, A. Dataflow of applicative programs using minimal function graphs. Proc. ACM symp. on Principles of Programming Languages, 1986.
8. Gordon, M. Models of pure LISP. Ph.D. thesis, Dept. of Artificial Intelligence, Edinburgh University, 1973.
9. Hindley, J.R. The principal type scheme of an object in combinatory logic. Transactions of the Amer. Math. Soc., vol 146, pp 29–60, 1969.
10. Milner, R. A theory of type polymorphism in programming. JCSS 1978.
11. Mulmuley, K. A mechanisible theory for existence proofs of inclusive predicates. CMU computer science report CMU-CS-85-149, 1985.
12. Mycroft, A. The theory and practice of transforming call-by-need into call-by-value. Lecture Notes in Computer Science: Proc. 4th intl. symp. on programming, vol. 83, Springer-Verlag, 1980.
13. Mycroft, A. Abstract Interpretation and Optimising Transformations of Applicative Programs. Ph.D. thesis, Edinburgh University, 1981. Available as computer science report CST-15-81.
14. Mycroft, A. and Nielson, F. Strong abstract interpretation using power domains. Lecture Notes in Computer Science: Proc. 10th ICALP, vol. 154, Springer-Verlag, 1983.
15. Nielson, F. Abstract interpretation using domain theory. Ph.D. thesis, Edinburgh University, 1984. Available as computer science report CST-31-84.
16. Plotkin, G. Lambda definability in the full type hierarchy. In [18].
17. Reynolds, J.C. Types, abstraction and parametric polymorphism. IFIP 83, (ed) R.E.A. Mason, North-Holland, 1983.
18. Seldin, J.P., and Hindley, J.R. To H.B. Curry: Essays on combinatory logic, lambda calculus and formalism. Academic Press, 1980.
19. Stoy, J. Denotational semantics: the Scott-Strachey approach to programming language theory. MIT press, 1977.