From algol to polymorphic linear lambda-calculus

Journal of the ACM

Volumn 47, Issue 1, 2000, Pages 167-223

  O'Hearn, Peter W ^a,b   Reynolds, John C ^a,b  

^a QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

^b Carnegie Mellon University   (United States)

Author keywords

Linear logic; Local state; Logical relations; Parametric polymorphism

Indexed keywords

LINEAR LANGUAGES; LINEAR LOGIC; LOCAL STATE; LOGICAL RELATIONS; PARAMETRIC POLYMORPHISM;

COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; LINEAR PROGRAMMING; LOGIC PROGRAMMING; MATHEMATICAL TRANSFORMATIONS; PARAMETER ESTIMATION; SEMANTICS;

ALGOL (PROGRAMMING LANGUAGE);

EID: 0000169374     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/331605.331611     Document Type: Article

References (52)

1. ABRAMSKY, S. 1993. Computational interpretations of linear logic. Theoret. Comput. Sci. 111, 1-2 (Apr.), 3-57.
2. ABRAMSKY, S., JAGADEESAN, R., AND MALACARIA, P. 1999. Full abstraction for PCF. Inf. Comput., to appear.
3. ABRAMSKY, S., AND JUNG, A. 1994. Domain theory. In Handbook of Logic in Computer Science, Vol. 3. S. Abramsky, D. M. Gabbay, and T. S. E. Maibaum, eds., pp. 1-168. Clarendon Press.
4. ABRAMSKY, S., AND MCCUSKER, G. 1997 Linearity, sharing and state. In Algol-like Languages, Vol. 2. P. W. O'Hearn and R. D. Tennent, Eds., pp. 297-330. Birkhauser, Boston, Mass.
5. BARBER, A., AND PLOTKIN, G. 1997. Dual intuitionistic linear logic. Submitted.
6. BENTON, N., BIERMAN, G., DE PAIVA, V., AND HYLAND, M. 1993. A term calculus for intuitionistic linear logic. In Typed Lambda Calculi and Applications (Utrecht, The Netherlands, Mar.). M. Bezen and J. F. Groote, eds. Lecture Notes in Computer Science, vol. 664. Springer-Verlag, Berlin, pp. 75-90.
7. BERRY, G. 1978. Stable models of typed lambda-calculi. Automata, Languages and Programming, Fifth Colloquium, Udine. Lecture Notes in Computer Science, vol. 62. Springer-Verlag, New York, pp. 72-89.
8. BERRY, G., AND CURIEN, P.-L. 1982. Sequential algorithms on concrete data structures. Theoret. Comput. Sci. 20, 265-321.
9. BEZEN, M., AND GROOTE, J. F., EDS. 1993. Typed Lambda Calculi and Applications. Lecture Notes in Computer Science, vol. 664. Springer-Verlag, Berlin.
10. BROOKES, S., MAIN, M., MELTON, A., AND MISLOVE, M. EDS. 1995. Mathematical Foundations of Programming Semantics, Eleventh Annual Conference (Tulane University, New Orleans, March 29-Apr. 1). Elsevier Science, Amsterdam, The Netherlands.
11. CHIRIMAR, J., GUNTER, C. A., AND RIECKE, J. 1994. Reference counting as a computational interpretation of linear logic. J. Funct. Prog. 2, 6, 194-244.
12. DAY, B. J. 1970. On closed categories of functors. In Reports of the Midwest Category Seminar, S. Mac Lane, ed., Lecture Notes in Mathematics, vol. 137. Springer-Verlag, Berlin-New York, pp. 1-38.
13. GIRARD, J.-Y. 1972. Interprétation Fonctionnelle et Elimination des Coupures de l'Arithmétique d'Ordre Supérieur. Ph.D. dissertation. Université Paris VII, Paris, France.
14. GIRARD, J.-Y. 1987. Linear logic. Theoret. Comput. Sci. 46, 1-102.
15. HOLMSTRÖM, S. 1988. Linear functional programming. In Proceedings of the Workshop on Implementation of Lazy Functional Languages. Chalmers Univ., Gotenburg, Sweden.
16. HYLAND, J. M. E., AND ONG, C.-H. L. 1994. On full abstraction for PCF: I, II and III. Submitted for publication.
17. LAFONT, Y. 1988. The linear abstract machine. Theoret. Comput. Sci. 59, 157-180.
18. LAMBEK, J. 1989. Multicategories revisited. In Contemporary Mathematics, vol. 92. J. W. Gray and A. Scedrov, eds. American Mathematical Society, Providence, R.I., pp. 217-240.
19. LENT, A. F. 1993. The category of functors from state shapes to bottomless CPOs is adequate for block structure. In Proceedings of the ACM SPGPLAN Workshop on State in Programming Languages (Copenhagen, Denmark, June 12, 1993). ACM, New York, pp. 101-119.
20. MACKIE, I. 1994. Lilac: A functional programming language based on linear logic. J. Funct. Prog. 4, 4 (Oct.), 395-433.
21. MILNER, R. 1977. Fully abstract models of typed λ-calculi. Theoret. Comput. Sci. 4, 1-22.
22. MILNER, R. 1989. Communication and Concurrency. Prentice Hall, New York.
23. O'HEARN, P. W., POWER, A. J., TAKEYAMA, M., AND TENNENT, R. D. 1999. Syntactic control of interference revisited. Theoret. Comput. Sci. 228, 1-2 (Oct.), 211-252.
24. O'HEARN, P. W., AND REDDY, U. S. 1999. Objects, interference and the Yoneda embedding. Theoret. Comput. Sci. 228, 1-2 (Oct.), 253-282.
25. O'HEARN, P. W., AND RIECKE, J. G. 1995. Kripke logical relations and PCF. Inf. Comput. 120 (1), 107-116.
26. O'HEARN, P. W., AND TENNENT, R. D. 1995. Parametricity and local variables. J. ACM 42 (3), 658-709.
27. O'HEARN, P. W., AND TENNENT, R. D., EDS. 1997a. Algol-like Languages, Vol. 1. Birkhauser, Boston, Mass.
28. O'HEARN, P. W., AND TENNENT, R. D., EDS. 1997b. Algol-like Languages, Vol. 2. Birkhauser, Boston, Mass.
29. OLES, F. J. 1982. A category-theoretic approach to the semantics of programming languages. Ph.D. dissertation. Syracuse Univ., Syracuse, N.Y.
30. OLES, F. J. 1987. Lambda calculi with implicit type conversions. Tech.Rep. RC 13245. IBM Research, T. J. Watson Research Center, Yorktown Heights, N.Y.
31. OLES, F. J. 1997. Functor categories and store shapes. In Algol-like Languages, Vol. 2. P. W. O'Hearn and R. D. Tennent, eds. Birkhauser, Boston, Mass., pp. 3-12.
32. PITTS, A. 1997. Reasoning about local variables with operationally-based logical relations. In Algol-like Languages, vol. 2. P. W. O'Hearn and R. D. Tennent, eds. Birkhauser, Boston, Mass., pp. 165-186.
33. PLOTKIN, G. D. 1977. LCF considered as a programming language. Theoret. Comput. Sci. 5, 223-255.
34. PLOTKIN, G. D. 1980. Lambda-definability in the full type hierarchy. In To H. B. Curry: Essays in Combinatory Logic, Lambda Calculus and Formalism, J. P. Seldin and J. R. Hindley, eds. Academic Press, Orlando, Fla., pp. 353-373.
35. PLOTKIN, G. 1983. Domains. 1992 TeXed edition of course notes prepared by Yugo Kashiwagi and Hidetaka Kondoh from notes by Tatsuya Hagino.
36. PLOTKIN, G. D. 1993. Type theory and recursion (extended abstract). In Proceedings of the 8th Annual IEEE Symposium on Logic in Computer Science (Montreal, Ont., Canada, June 19-23). IEEE Computer Society Press, Los Alamitos, Calif., page 374.
37. PLOTKIN, G., AND ABADI, M. 1983. A logic for parametric polymorphism. In Typed Lambda Calculi and Applications, M. Bezen and J. F. Groote, eds., Lecture Notes in Computer Science, vol. 664. Springer-Verlag, Berlin, Germany, pp. 361-375.
38. REDDY, U. S. 1996. Global states considered unnecessary: introduction to object-based semantics. Lisp and Symbolic Computation. Special issue on State in Programming Languages. Also in [O'Hearn and Tennent 1997b], pages 227-296.
39. REYNOLDS, J. C. 1974. Towards a theory of type structure. In Proceedings of Colloque sur la Programmation. Lecture Notes in Computer Science, vol. 19. Springer-Verlag, New York, pp. 408-425.
40. REYNOLDS, J. C. 1978. Syntactic control of interference. In Conference Record of the Fifth Annual ACM Symposium on Principles of Programming Languages (Tuscon, Arizona, January 1978), pp. 39-46. ACM, New York. Also in [O'Hearn and Tennent 1997a], pages 273-286.
41. REYNOLDS, J. C. 1981a. The Craft of Programming. Prentice-Hall International, London, England.
42. REYNOLDS, J. C. 1981b. The essence of Algol. In J. W. de Bakker and J. C. van Vliet, Eds., Algorithmic Languages (Amsterdam, October 1981), pp. 345-372. North-Holland, Amsterdam. Also in [O'Hearn and Tennent 1997a], pages 67-88.
43. REYNOLDS, J. C. 1983. Types, abstraction and parametric polymorphism. In Information Processing, vol. 83, R. E. A. Mason, ed. North-Holland, Amsterdam, pp. 513-523.
44. RIECKE, J. G., AND SANDHOLM, A. 1997. A relational account of call-by-call-value sequentiality. In Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science (Warsaw, Poland, June 29-July 2). IEEE Computer Society Press, Los Alamitos, Calif., pp.258-267.
45. SCHMIDT, D. A. 1985. Detecting global variables in denotational specifications. ACM Trans. Prog. Lang. Systems 7, 3 (Apr.), 299-310.
46. SCOTT, D. S. 1972. Mathematical concepts in programming language semantics. In Proceedings of the 1972 Spring Joint Computer Conference, AFIPS Press, Montvale, N.J., pp. 225-234.
47. SCOTT, D. S., AND STRACHEY, C. 1971. Toward a mathematical semantics for computer languages. In Proceedings of the Symposium on Computers and Automata, Volume 21 of Microwave Research Institute Symposia Series, Polytechnic Institute of Brooklyn Press, Brooklyn, N.Y., pp. 19-46.
48. SIEBER, K. 1996. Full abstraction for the second order subset of ALGOL-like language. Theoret. Comput. Sci. 168, 1 (Nov.), 155-212.
49. STRACHEY, C. 1972. The varieties of programming language. In Proceedings of the International Computing Symposium (Venice, April 1972), pp. 222-233. Cini Foundation, Venice. Also in [O'Hearn and Tennent 1997a], pages 51-64.
50. TENNENT, R. D. 1991. Semantics of Programming Languages. International Series in Computer Science. Prentice-Hall International, London, England.
51. WADLER, P. 1990. Linear types can change the world! In IFIP TC-2 Working Conference on Programming Concepts and Methods, M. Broy and C. Jones, eds. (Sea of Galilee, Israel, Apr.). North-Holland, Amsterdam, The Netherlands, pp. 347-359.
52. WADLER, P. 1991. Is there a use for linear logic? In Proceedings of the ACM/IFIP Symposium on Partial Evaluation and Semantics-Based Program Manipulation (New Haven, Conn., June 17-19). ACM, New York, pp. 255-273.