Affiliation:
1. Queen Mary & Westfield College, London, UK
2. Carnegie Mellon Univ., Pittsburgh, PA
Abstract
In a linearly-typed functional language, one can define functions that consume their arguments in the process of computing their results. This is reminiscent of state transformations in imperative languages, where execition of an assignment statement alters the contents of the store. We explore this connection by translating two variations on Algol 60 into a purely functional language with polymorphic linear types. On the one hand, the translations lead to a semantic analysis of Algol-like programs, in terms of a model of the linear language. On the other hand, they demonstrate that a linearly-typed functional language can be at least as expressive as Algol.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference50 articles.
1. Computational interpretations of linear logic
2. ABRAMSKY S. JAGADEESAN R. AND MALACARIA P. 1999. Full abstraction for PCF. Inf. Comput. to appear. 10.1006/inco.2000.2930 ABRAMSKY S. JAGADEESAN R. AND MALACARIA P. 1999. Full abstraction for PCF. Inf. Comput. to appear. 10.1006/inco.2000.2930
3. BARBER A. AND PLOTKIN G. 1997. Dual intuitionistic linear logic. Submitted. BARBER A. AND PLOTKIN G. 1997. Dual intuitionistic linear logic. Submitted.
Cited by
41 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献