4370 search results - page 47 / 874 » Algebra of Logic Programming |
CSL
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. We prove "untyping" theorems: in some typed theories (semirings, Kleene algebras, residuated lattices, involutive residuated lattices), typed equations can be d...
ISCI
2010
2010
Generalized continuous and left-continuous t-norms arising from algebraic semantics for fuzzy logics
13 years 7 months ago
This paper focuses on the issue of how generalizations of continuous and leftcontinuous t-norms over linearly ordered sets should be from a logical point of view. Taking into acco...
TIME
2008
IEEE
14 years 3 months ago
2008
IEEE
Boolean contact algebras constitute a convenient approach to a region based theory of space. In this paper we want to extend this approach to regions moving in time - called timed...
AML
2008
13 years 9 months ago
2008
We compare realizability models over partial combinatory algebras by embedding them into sheaf toposes. We then use the machinery of Grothendieck toposes and geometric morphisms t...
POPL
2004
ACM
14 years 9 months ago
2004
ACM
Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., v...