133 search results - page 9 / 27 » The basic intuitionistic logic of proofs |
ENTCS
2011
14 years 6 months ago
2011
In the past years, linear logic has been successfully used as a general logical framework for encoding proof systems. Due to linear logic’s finer control on structural rules, i...
107
click to vote
LFCS
2009
Springer
15 years 6 months ago
2009
Springer
We explore an intuitionistic fragment of Art¨emov’s Logic of Proofs as a type system for a programming language for mobile units. Such units consist of both a code and certific...
87
Voted
ESOP
2001
Springer
15 years 4 months ago
2001
Springer
Abstract. We present a proof theoretical method for de-compiling lowlevel code to the typed lambda calculus. We first define a proof system for a low-level code language based on...
90
Voted
CORR
2006
Springer
14 years 11 months ago
2006
Springer
Continuation Passing Style (CPS) is one of the most important issues in the field of functional programming languages, and the quest for a primitive notion of types for continuati...
CORR
2010
Springer
14 years 11 months ago
2010
Springer
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...