15-816 Linear Logic
Handouts

The handout Linear Logic contains a complete set of notes as of the indicated date. This includes all incremental handouts with possible corrections and updates. Note that I do not correct incremental handouts on-line.

Files are available in PDF format (default) and also in PostScript (additional link). Some external papers are not available electronically.

Date Handout (PDF) PostScript Note

Jan 26 '02 Linear Logic linear.ps Lectures 1-7, 9, 11, 13-17, 19-22

Sep 18 Introduction intro.ps Lecture 1
Sep 20 Linear Natural Deduction lnd.ps Lecture 2, Lecture 3
Sep 25 Normal Deductions normal.ps Lecture 4
Sep 27 Sequent Calculus seq.ps Lecture 5, Lecture 6
Oct 4 Pi Calculus in Linear Logic picalc.ps Lecture 7
Oct 9 Decision Problems for Propositional Linear Logic [LMSS92] Lecture 8
Oct 11 Focusing focus.ps Lecture 9
Oct 16 Linear Objects [AP91] Lecture 10
Oct 23 Unification unif.ps Lecture 11
Oct 25 Resource Managment [HP01] Lecture 12
Oct 30 Linear Logic Programming lp.ps Lecture 13
Nov 1 Logical Compilation (see also [CHP00]) logcomp.ps Lecture 14
Nov 6 Linear Lambda-Calculus linlam.ps Lecture 15
Nov 8 Linear Functional Programming linfp.ps Lecture 16
Nov 13 Termination term.ps Lecture 17
Nov 15 Polynomial Time Computation [Hof] Lecture 18
Nov 29 Linear Type Theory lintt.ps Lecture 19, Lecture 20
Dec 4 Linear Logical Frameworks llf.ps Lecture 21, Lecture 22
Dec 6 Ordered Logic [PP99] Lecture 23

Papers and Reports

[LMSS92] Patrick Lincoln, John Mitchell, Andre Scedrov, and Natarajan Shankar.
Decision Problems for Propositional Linear Logic.
Annals of Pure and Applied Logic, 56:239-311, 1992.
[AP91] Jean-Marc Andreoli and Remo Pareschi.
Linear Objects: Logical Processes with Built-In Inheritance.
New Generation Computing, 9:445-473, 1991.
Not available electronically.
[HP01] James Harland and David Pym.
Resource-Distribution via Boolean Constraints.
Draft paper, August 2001.
An earlier version appeared in: Proceedings of the 14th International Conference on Automated Deduction (CADE-14), W. McCune, editor, pp. 222-236,
Springer-Verlag LNAI 1249, Townsville, Australia, July 1997.
[CHP00] Iliano Cervesato, Joshua S. Hodas and Frank Pfenning.
Efficient Resource Management for Linear Logic Proof Search
Theoretical Computer Science, 232:133-163, 2000.
[Hof] Martin Hofmann.
Safe Recursion with Higher Types and BCK-Algebra
Annals of Pure and Applied Logic, to appear.
Revised and abridged version of the habilitation thesis
Type Systems For Polynomial-Time Computation, Technical University Darmstadt.
Available as Technical Report ECS-LFCS-99-406, University of Edinburgh, 1999.
[PP99] Jeff Polakow and Frank Pfenning.
Relating Natural Deduction and Sequent Calculus for Intuitionistic Non-Commutative Linear Logic.
Proceedings of the 15th Conference on Mathematical Foundations of Programming Semantics, A. Scedrov and A. Jung, editors, New Orleans, Louisiana, April 1999.
Available in Electronic Notes in Theoretical Computer Science, Vol. 20.

[ Home | Schedule | Assignments | Handouts | Software | Resources ]

fp@cs
Frank Pfenning