135 search results - page 4 / 27 » Constructive Logic with Strong Negation as a Substructural L... |
JOLLI
2008
14 years 9 months ago
2008
In this paper, consistency is understood as the absence of the negation of a theorem, and not, in general, as the absence of any contradiction. We define the basic constructive log...
91
Voted
JUCS
2006
14 years 9 months ago
2006
: Functional-logic programming amalgamates some of the main features of both functional and logic styles into a single paradigm. Nevertheless, negation is a widely investigated fea...
76
Voted
RTA
1999
Springer
15 years 1 months ago
1999
Springer
We present a modular proof of the strong normalisation of intuitionistic logic with permutation-conversions. This proof is based on the notions of negative translation and CPS-simu...
76
Voted
LPAR
2010
Springer
14 years 8 months ago
2010
Springer
Termination of recursive functions is an important property in proof assistants based on dependent type theories; it implies consistency and decidability of type checking. Type-bas...
ICLP
1994
Springer
15 years 1 months ago
1994
Springer
Constructive negation has been proved to be a valid alternative to negation as failure, especially when negation is required to have, in a sense, an `active' role. In this pa...