Skip to main content Accessibility help
×
Hostname: page-component-586b7cd67f-t8hqh Total loading time: 0 Render date: 2024-11-25T14:15:28.651Z Has data issue: false hasContentIssue false

13 - Towards linear logic

Published online by Cambridge University Press:  05 November 2011

Roberto M. Amadio
Affiliation:
Université de Provence
Pierre-Louis Curien
Affiliation:
Ecole Normale Supérieure, Paris
Get access

Summary

Girard's linear logic [Gir87] is an extension of propositional logic with new connectives providing a logical treatment of resource control. As a first hint, consider the linear λ-terms, which are the λ-terms defined with the following restriction: when an abstraction λx.M is formed, then x occurs exactly once in M. Linear λ-terms are normalized in linear time, that is, the number of reduction steps to their normal form is proportional to their size: a linear β-redex (λx.M)N involves no duplication of the argument N. Thus all the complexity of normalization comes from non-linearity.

Linear logic pushes the limits of constructivity much beyond intuitionistic logic. A proper proof theoretical introduction to linear logic is beyond the scope of this book. In this chapter, we content ourselves with a semantic introduction. By doing so, we actually follow the historical thread: the connectives of linear logic arose from the consideration of (a particularly simple version of) the stable model.

In section 13.1, we examine stable functions between coherence spaces, and discover two decompositions. First the function space EE′ is isomorphic to a space (!E)⊸E′, where ⊸ constructs the space of linear functions, and where! is a constructor which allows reuse of data. Intuitively, linear functions, like linear terms, can use their input only once. On the other hand, the explicit declaration of reusability,!, allows us to recover all functions and terms.

Type
Chapter
Information
Publisher: Cambridge University Press
Print publication year: 1998

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Save book to Kindle

To save this book to your Kindle, first ensure [email protected] is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×