Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Computational Interpretations of Linear Logic Samson Abramsky
 

Summary: Computational Interpretations of Linear Logic
Samson Abramsky
Department of Computing
Imperial College of Science, Technology and Medicine
180 Queen's Gate, London SW7 2BZ, England
sa@doc.ic.ac.uk
To appear in Theoretical Computer Science
February 27, 1992
Abstract
We study Girard's Linear Logic from the point of view of giving a concrete compu­
tational interpretation of the logic, based on the Curry­Howard isomorphism. In the
case of Intuitionistic Linear Logic, this leads to a refinement of the lambda calculus,
giving finer control over order of evaluation and storage allocation, while maintain­
ing the logical content of programs as proofs, and computation as cut­elimination.
In the classical case, it leads to a concurrent process paradigm with an operational
semantics in the style of Berry and Boudol's Chemical Abstract Machine. This opens
up a promising new approach to the parallel implementation of functional program­
ming languages; and offers the prospect of typed concurrent programming in which
correctness is guaranteed by the typing.
1 Introduction

  

Source: Abramsky, Samson - Computing Laboratory, University of Oxford

 

Collections: Computer Technologies and Information Sciences