632 search results - page 51 / 127 » Combining programming with theorem proving |
CSL
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
CRYPTO
2007
Springer
13 years 11 months ago
2007
Springer
system is the abstraction of the input-output behavior of any kind of discrete system, in particular cryptographic systems. Many aspects of cryptographic security analyses and pro...
TYPES
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Proof erasure plays an essential role in the paradigm of programming with theorem proving. In this paper, we introduce a form of attributive types that carry an attribute...
ENTCS
2007
13 years 7 months ago
2007
We pursue the program of exposing the intrinsic mathematical structure of the “space of proofs” of a logical system [AJ94b]. We study the case of Multiplicative-Additive Linea...
JCSS
2010
13 years 6 months ago
2010
Nominal techniques were introduced to represent in a simple and natural way that involve binders. The syntax includes an abstraction operator and a primitive notion of name swappin...