1989 search results - page 66 / 398 » Set functions for functional logic programming |
APLAS
2004
ACM
14 years 4 months ago
2004
ACM
Most aspect-oriented languages provide only a fixed, built-in set of pointcut designators whose denotation is only described informally. As a consequence, these languages do not p...
AAMAS
2011
Springer
13 years 2 months ago
2011
Springer
This paper introduces the execution model of a declarative programming language intended for agent applications. Features supported by the language include functional and logic pro...
SIAMCOMP
2008
13 years 10 months ago
2008
The Graph Theorem of classical recursion theory states that a total function on the natural numbers is computable, if and only if its graph is recursive. It is known that this res...
CASCON
1996
13 years 12 months ago
1996
This paper describes the use of WatIF, a simple compiler intermediate form based on the -calculus, for writing compiler front-ends for a wide range of programming languages. Somew...
SCCC
2005
IEEE
14 years 4 months ago
2005
IEEE
Databases may not satisfy integrity constraints (ICs) for several reasons. Nevertheless, in most of the cases an important part of the data is still consistent wrt certain desired...