1321 search results - page 6 / 265 » Subtyping in Logical Form |
CORR
2008
Springer
14 years 11 months ago
2008
Springer
123
click to vote
TLCA
1997
Springer
15 years 3 months ago
1997
Springer
We present new sound and complete axiomatizations of type equality and subtype inequality for a first-order type language with regular recursive types. The rules are motivated by ...
AML
2007
14 years 11 months ago
2007
A method is described for obtaining conjunctive normal forms for logics using Gentzen-style rules possessing a special kind of strong invertibility. This method is then applied to ...
112
click to vote
JELIA
2010
Springer
14 years 10 months ago
2010
Springer
In previous work, the so-called Temporal Equilibrium Logic (TEL) was introduced. This formalism provides an extension of the Answer Set semantics for logic programs to arbirary the...
179
click to vote
POPL
2006
ACM
15 years 12 months ago
2006
ACM
We propose a type system based on regular tree grammars, where algebraic datatypes are interpreted in a structural way. Thus, the same constructors can be reused for different typ...