Sciweavers

3658 search results - page 136 / 732
» The logic of proofs, semantically
Sort
View
CORR
2006
Springer
123views Education» more  CORR 2006»
13 years 10 months ago
Continuations, proofs and tests
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...
Stefano Guerrini, Andrea Masini
ENTCS
2002
129views more  ENTCS 2002»
13 years 10 months ago
Eliminating Proofs from Programs
This paper presents a step in the development of an operational approach to program extraction in type theory. In order to get a program from a lambda term, the logical parts need...
Femke van Raamsdonk, Paula Severi
SIAMCOMP
2000
86views more  SIAMCOMP 2000»
13 years 10 months ago
On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems
An exponential lower bound for the size of tree-like cutting planes refutations of a certain family of conjunctive normal form (CNF) formulas with polynomial size resolution refuta...
Maria Luisa Bonet, Juan Luis Esteban, Nicola Gales...
PPSWR
2005
Springer
14 years 4 months ago
Descriptive Typing Rules for Xcerpt
We present typing rules for the Web query language Xcerpt. The rules provide a descriptive type system: the typing of a program is an ation of its semantics. The rules can also be ...
Sacha Berger, Emmanuel Coquery, Wlodzimierz Draben...