835 search results - page 128 / 167 » Geometric Logic in Computer Science |
131
click to vote
ERSHOV
2009
Springer
15 years 3 months ago
2009
Springer
A term t is called a template of terms t1 and t2 iff t1 = t1 and t2 = t2, for some substitutions 1 and 2. A template t of t1 and t2 is called the most specific iff for any template...
127
click to vote
TALG
2008
14 years 11 months ago
2008
We present simple, fully dynamic and kinetic data structures, which are variants of a dynamic two-dimensional range tree, for maintaining the closest pair and all nearest neighbors...
158
click to vote
SOFSEM
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. Constraint Handling Rules (CHR) is a general purpose, committedchoice declarative language which, differently from other similar languages, uses multi-headed (guarded) ru...
107
click to vote
LICS
2009
IEEE
15 years 6 months ago
2009
IEEE
mantics Is Fully Abstract∗ Sumit Nain and Moshe Y. Vardi Rice University, Department of Computer Science Houston, TX 77005-1892, USA The discussion in the computer-science liter...
107
click to vote
TLCA
2009
Springer
15 years 6 months ago
2009
Springer
Finiteness spaces constitute a categorical model of Linear Logic whose objects can be seen as linearly topologised spaces, (a class of topological vector spaces introduced by Lefsc...