7 search results - page 2 / 2 » A Sequent Calculus with Implicit Term Representation |
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
2006
ACM
14 years 5 months ago
2006
ACM
We present language mechanisms for polymorphic, extensible records and their exact dual, polymorphic sums with extensible first-class cases. These features make it possible to eas...