33 search results - page 1 / 7 » A Proof Calculus Which Reduces Syntactic Bureaucracy |
RTA
2010
Springer
13 years 9 months ago
2010
Springer
In usual proof systems, like the sequent calculus, only a very limited way of combining proofs is available through the tree structure. We present in this paper a logicindependent ...
LICS
2010
IEEE
13 years 3 months ago
2010
IEEE
This work belongs to a wider effort aimed at eliminating syntactic bureaucracy from proof systems. In this paper, we present a novel cut elimination procedure for classical propos...
ENTCS
2000
13 years 5 months ago
2000
The region calculus of Tofte and Talpin is an annotated polymorphically typed lambda calculus which makes memory allocation and deallocation explicit. It is intended as an interme...
APAL
2010
13 years 5 months ago
2010
Classical proof forests are a proof formalism for first-order classical logic based on Herbrand's Theorem and backtracking games in the style of Coquand. First described by M...
ICFP
1999
ACM
13 years 9 months ago
1999
ACM
Programs are often structured around the idea that different pieces of code comprise distinct principals, each with a view of its environment. Typical examples include the module...