143 search results - page 23 / 29 » On Some Differences Between Semantics of Logic Program Updat... |
165
click to vote
POPL
2006
ACM
15 years 10 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...
ICLP
1990
Springer
15 years 1 months ago
1990
Springer
Definite Clause Grammars (DCGs) have proved valuable to computational linguists since they can be used to specify phrase structured grammars. It is well known how to encode DCGs i...
168
click to vote
POPL
2007
ACM
15 years 10 months ago
2007
ACM
This paper is concerned with a programming language construct for typed name binding that enforces -equivalence. It proves a new result about what operations on names can co-exist...
CORR
2011
Springer
14 years 4 months ago
2011
Springer
Contemporary use of the term ’intension’ derives from the traditional logical doctrine that an idea has both an extension and an intension. In this paper we introduce an intens...
160
click to vote
ICDE
2005
IEEE
15 years 11 months ago
2005
IEEE
In mobile and ambient environments, devices need to become autonomous, managing and resolving problems without interference from a user. The database of a (mobile) device can be s...