Phase Semantics for Light Linear Logic (Extended Abstract)
Max Kanovich, Mitsuhiro Okada, Andre Scedrov · Electronic Notes in Theoretical Computer Science · 1997
Light linear logic [1] 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.