Existential types: Logical relations and operational equivalence

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

Volumn 1443 LNCS, Issue , 1998, Pages 309-326

  Pitts, Andrew M ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; SEMANTICS; SYNTACTICS;

EXISTENTIAL TYPES; INFORMATION HIDING; LOGICAL RELATIONS; NEW FORMS; NON TERMINATIONS; RECURSIVE DEFINITIONS; SEMANTIC EQUIVALENCES; SYNTACTIC APPROACH;

CLASSIFICATION (OF INFORMATION);

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

References (20)

1. Birkedal, L. and R. Harper (1997). Relational interpretation of recursive types in an operational setting (Summary). In M. Abadi and T. Ito (Eds.), Theoretical Aspects of Computer Software, Third International Symposium, TACS'97, Sendai, Japan, September 23 - 26, 1997, Proceedings, Volume 1281 of Lecture Notes in Computer Science. Springer-Verlag, Berlin.
2. Bruce, K. B., L. Cardelli, and B. C. Pierce (1997). Comparing object encodings. In M. Abadi and T. Ito (Eds.), Theoretical Aspects of Computer Software, Third International Symposium, TACS'97, Sendai, Japan, September 23 - 26, 1997, Proceedings, Volume 1281 of Lecture Notes in Computer Science. Springer-Verlag, Berlin.
3. Cardelli, L. (1997). Type systems. In CRC Handbook of Computer Science and Engineering, Chapter 103, pp. 2208-2236. CRC Press.
4. Girard, J.-Y. (1972). Interprétation fonctionelle et élimination des coupures dans l'arithmétique d'ordre supérieur. Ph. D. thesis, Université Paris VII. Thèse de doctorat d'état.
5. Lassen, S. B. (1998a). Relational reasoning about contexts. In A. D. Gordon and A. M. Pitts (Eds.), Higher Order Operational Techniques in Semantics, Publications of the Newton Institute, pp. 91-135. Cambridge University Press.
6. Lassen, S. B. (1998b). Relational Reasoning about Functions and Nondeterminism. Ph. D. thesis, Department of Computer Science, University of Aarhus.
7. Milner, R., M. Tofte, R. Harper, and D. MacQueen (1997). The Definition of Standard ML (Revised). MIT Press.
8. Mitchell, J. C. (1991). On the equivalence of data representations. In V. Lifschitz (Ed.), Artificial Intelligence and Mathematical Theory of Computation: Papers in Honor of John McCarthy, pp. 305-330. Academic Press.
9. Mitchell, J. C. (1996). Foundations for Programming Languages. Foundations of Computing series. MIT Press.
10. Mitchell, J. C. and G. D. Plotkin (1988). Abtract types have existential types. ACM Transactions on Programming Languages and Systems 10, 470-502.
11. Pitts, A. M. (1998). Parametric polymorphism and operational equivalence (preliminary version). Electronic Notes in Theoretical Computer Science 10. Proceedings, 2nd Workshop on Higher Order Operational Techniques in Semantics, Stanford CA, December 1997. To appear.
12. Pitts, A. M. and I. D. B. Stark (1993). Observable properties of higher order functions that dynamically create local names, or: What's new? In Mathematical Foundations of Computer Science, Proc. 18th Int. Symp., Gdansk, 1993, Volume 711 of Lecture Notes in Computer Science, pp. 122-141. Springer-Verlag, Berlin.
13. Pitts, A. M. and I. D. B. Stark (1998). Operational reasoning for functions with local state. In A. D. Gordon and A. M. Pitts (Eds.), Higher Order Operational Techniques in Semantics, Publications of the Newton Institute, pp. 227-273. Cambridge University Press.
14. Plotkin, G. D. (1973, October). Lambda-definability and logical relations. Memorandum SAI-RM-4, School of Artificial Intelligence, University of Edinburgh.
15. Plotkin, G. D. (1977). LCF considered as a programming language. Theoretical Computer Science 5, 223-255.
16. Plotkin, G. D. and M. Abadi (1993). A logic for parametric polymorphism. In M. Bezem and J. F. Groote (Eds.), Typed Lambda Calculus and Applications, Volume 664 of Lecture Notes in Computer Science, pp. 361-375. Springer-Verlag, Berlin.
17. Reynolds, J. C. (1974). Towards a theory of type structure. In Paris Colloquium on Programming, Volume 19 of Lecture Notes in Computer Science, pp. 408-425. Springer-Verlag, Berlin.
18. Reynolds, J. C. (1983). Types, abstraction and parametric polymorphism. In R. E. A. Mason (Ed.), Information Processing 83, pp. 513-523. North-Holland, Amsterdam.
19. Statman, R. (1985). Logical relations and the typed lambda calculus. Information and Control 65, 85-97.
20. Wright, A. K. (1995). Simple imperative polymorphism. LISP and Symbolic Computation 8, 343-355.