3693 search results - page 377 / 739 » Splitting a Logic Program |
158
click to vote
ICLP
2005
Springer
15 years 9 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...
120
click to vote
CD
2004
Springer
15 years 9 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...
130
click to vote
ESOP
2003
Springer
15 years 9 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...
145
click to vote
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)....
127
click to vote
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...