3481 search results - page 396 / 697 » Higher-Order Logic Programming as Constraint Logic Programmi... |
147
Voted
IJCAI
1993
15 years 6 months ago
1993
objects, like elements of (abstract) data types in ordinary programming languages In the theory of abstract data types most often one only considers algebraic structures where all ...
168
click to vote
ICLP
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We instrument a higher-order logic programming search procedure to generate and check small proof witnesses for the Twelf system, an implementation of the logical framewo...
128
click to vote
CD
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. The secure deployment of components is widely recognized as a crucial problem in component-based software engineering. While major effort is concentrated on preventing ma...
148
click to vote
ICALP
2001
Springer
15 years 9 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)....
131
Voted
POPL
2000
ACM
15 years 9 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...