4370 search results - page 490 / 874 » Algebra of Logic Programming |
121
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...
145
Voted
POS
1998
Springer
15 years 8 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...
114
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...
146
Voted
CORR
2008
Springer
15 years 3 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...
248
click to vote
ENTCS
2002
15 years 3 months ago
2002
Elf is a general meta-language for the specification and implementation of logical systems in the style of the logical framework LF. Proof search in this framework is based on the...