We define a denotational semantics for Light Affine Logic (LAL) which has the property that denotations of functions are polynomial time computable by construction of the model. This gives a new proof of polytime-soundness of LAL which is considerably simpler than the standard proof based on proof nets and also is entirely semantical in nature. The model construction uses a new instance of a resource monoid; a general method for interpreting variations of linear logic with complexity restrictions introduced earlier by the authors.
A Semantic Proof of Polytime Soundness of Light Affine Logic / U. Dal Lago; M. Hofmann. - STAMPA. - 5010:(2008), pp. 134-145. (Intervento presentato al convegno Computer Science - Theory and Applications, Third International Computer Science Symposium in Russia tenutosi a Moscow, Russia nel 7-12 Giugno 2008).
A Semantic Proof of Polytime Soundness of Light Affine Logic
DAL LAGO, UGO;
2008
Abstract
We define a denotational semantics for Light Affine Logic (LAL) which has the property that denotations of functions are polynomial time computable by construction of the model. This gives a new proof of polytime-soundness of LAL which is considerably simpler than the standard proof based on proof nets and also is entirely semantical in nature. The model construction uses a new instance of a resource monoid; a general method for interpreting variations of linear logic with complexity restrictions introduced earlier by the authors.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
