97 search results - page 17 / 20 » Semi-Contraction: Axioms and Construction |
TLCA
2007
Springer
15 years 5 months ago
2007
Springer
The lambda-Pi-calculus allows to express proofs of minimal predicate logic. It can be extended, in a very simple way, by adding computation rules. This leads to the lambda-Pi-calcu...
101
click to vote
WADT
2004
Springer
15 years 5 months ago
2004
Springer
Higher-order logic with shallow type class polymorphism is widely used as a specification formalism. Its polymorphic entities (types, operators, axioms) can easily be equipped wit...
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 ...
104
click to vote
JSYML
2008
14 years 11 months ago
2008
free but not Whitehead Abelian groups to construct Abstract Elementary Classes (AEC) which satisfy the amalgamation property but fail various conditions on the locality of Galois-...
SEMWEB
2009
Springer
15 years 6 months ago
2009
Springer
Traditional object-oriented programming languages can be difficult to use when working with ontologies, leading to the creation of domain-specific languages designed specifically...