3738 search results - page 394 / 748 » Parametrized Logic Programming |
125
click to vote
ESOP
2003
Springer
15 years 8 months ago
2003
Springer
In complex systems, like robot plants, applications are built on top of a set of components, or devices. Each of them has particular individual constraints, and there are also log...
140
Voted
ICALP
2001
Springer
15 years 8 months ago
2001
Springer
We present a logical framework Υ for reasoning on a very general class of languages featuring binding operators, called nominal , presented in higher-order abstract syntax (HOAS)....
120
Voted
POPL
2000
ACM
15 years 8 months ago
2000
ACM
In 1998 Asperti and Mairson proved that the cost of reducing a lambda-term using an optimal lambda-reducer (a la L´evy) cannot be bound by any elementary function in the number o...
143
Voted
POS
1998
Springer
15 years 7 months ago
1998
Springer
The 3 tier architecture logically separates the functions of an application into a user interface component, a server business logic component, and a database component. Many appl...
113
Voted
ICLP
1994
Springer
15 years 7 months ago
1994
Springer
Constructive negation has been proved to be a valid alternative to negation as failure, especially when negation is required to have, in a sense, an `active' role. In this pa...