Sciweavers

47 search results - page 6 / 10
» Proof nets for display logic
Sort
View
CSL
2009
Springer
15 years 2 months ago
Confluence of Pure Differential Nets with Promotion
We study the confluence of Ehrhard and Regnier's differential nets with exponential promotion, in a pure setting. Confluence fails with promotion and codereliction in absence ...
Paolo Tranquilli
CORR
2010
Springer
140views Education» more  CORR 2010»
14 years 10 months ago
Classical BI: Its Semantics and Proof Theory
We present Classical BI (CBI), a new addition to the family of bunched logics which originates in O'Hearn and Pym's logic of bunched implications BI. CBI differs from exi...
James Brotherston, Cristiano Calcagno
CORR
2008
Springer
91views Education» more  CORR 2008»
14 years 10 months ago
Taming Modal Impredicativity: Superlazy Reduction
Pure, or type-free, Linear Logic proof nets are Turing complete once cut-elimination is5 considered as computation. We introduce modal impredicativity as a new form of impredicati...
Ugo Dal Lago, Luca Roversi, Luca Vercelli
LPNMR
2001
Springer
15 years 2 months ago
Bounded LTL Model Checking with Stable Models
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. As the model of asynchronous syst...
Keijo Heljanko, Ilkka Niemelä
PPDP
1999
Springer
15 years 2 months ago
A Calculus for Interaction Nets
hemical abstract machine Shinya Sato Himeji Dokkyo University, Faculty of Econoinformatics, 7-2-1 Kamiohno, Himeji-shi, Hyogo 670-8524, Japan Ian Mackie LIX, CNRS UMR 7161, ´Ecole...
Maribel Fernández, Ian Mackie