Abstract
Light linear logic is a refinement of the propositions-as-types paradigm to polynomial-time computation. A semantic setting for the underlying logical system is introduced here in terms of fibred phase spaces. Strong completeness is established, with a purely semantic proof of cut elimination as a consequence. A number of mathematical examples of fibred phase spaces are presented that illustrate subtleties of light linear logic.
Original language | English |
---|---|
Pages (from-to) | 221-234 |
Number of pages | 14 |
Journal | Electronic Notes in Theoretical Computer Science |
Volume | 6 |
DOIs | |
Publication status | Published - 1997 |
Externally published | Yes |
Event | MFPS XIII, Mathematical Foundations of Progamming Semantics, Thirteenth Annual Conference - Pittsburgh, PA, United States Duration: 1997 Mar 23 → 1997 Mar 26 |
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science(all)