Published online by Cambridge University Press: 01 December 2025
This chapter explores how logic programs can exploit linear logic. It provides several examples of specifying computations using linear logic, such as computing on collections of natural numbers and organizing simple theorem provers. It also illustrates how conventional program tasks, such as reversing a list or generating all permutations of a list, can be achieved in novel ways using linear logic programs. The chapter also demonstrates an alternative approach to specifying sequent calculus proof systems as logic programs. Bibliographic notes offer further references to the specification of logic programs.
To save this book to your Kindle, first ensure no-reply@cambridge.org 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.
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.
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.