3513 search results - page 358 / 703 » Super Logic Programs |
177
click to vote
ICALP
2001
Springer
15 years 11 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)....
154
click to vote
POPL
2000
ACM
15 years 11 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...
183
click to vote
POS
1998
Springer
15 years 11 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...
155
click to vote
ICLP
1994
Springer
15 years 10 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...
187
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
This paper presents a toolkit for spreadsheet visualization based on logical areas, semantic classes and data Logical areas, semantic classes and data modules are abstract represe...