135 search results - page 15 / 27 » Constructive Logic with Strong Negation as a Substructural L... |
182
click to vote
TYPES
2004
Springer
15 years 11 months ago
2004
Springer
We present a formalization of a constructive proof of weak normalization for the simply-typed λ-calculus in the theorem prover Isabelle/HOL, and show how a program can be extracte...
173
click to vote
MSCS
2007
15 years 5 months ago
2007
It is well-known that weakening and contraction cause na¨ıve categorical models of the classical sequent calculus to collapse to Boolean lattices. In previous work, summarized b...
158
click to vote
LPNMR
2005
Springer
15 years 11 months ago
2005
Springer
The paper presents DLV+ a Disjunctive Logic Programming system with object-oriented constructs, including classes, objects, (multiple) inheritance, and types. DLV+ is built on top ...
155
click to vote
ISMVL
2002
IEEE
15 years 11 months ago
2002
IEEE
Decision diagrams are the state-of-the-art representation for logic functions, both binary and multiple-valued. Here we consider ways to improve the construction of multiple-value...
214
click to vote
TOCL
2012
13 years 8 months ago
2012
racting these leads us to introduce the notion of a path object category. This is a relatively simple axiomatic framework, which is nonetheless sufficiently strong to allow the con...