3535 search results - page 216 / 707 » Logic Program Specialisation |
132
click to vote
CADE
1999
Springer
15 years 8 months ago
1999
Springer
We reduce the provability problem of any formula of the Lambek calculus to some context-free parsing problem. This reduction, which is based on non-commutative proof-net theory, al...
137
click to vote
PPDP
2004
Springer
15 years 9 months ago
2004
Springer
We introduce just enough tabling (JET), a mechanism to suspend and resume the tabled execution of logic programs at an arbitrary point. In particular, JET allows pruning of tabled...
147
click to vote
AGP
1997
IEEE
15 years 8 months ago
1997
IEEE
Abstract. Functional logic languages with a complete operational semantics are based on narrowing, a generalization of term rewriting where unification replaces matching. In this ...
161
click to vote
AISC
1998
Springer
15 years 8 months ago
1998
Springer
The use of computer algebra is usually considered beneficial for mechanised reasoning in mathematical domains. We present a case study, in the application domain of coding theory, ...
143
click to vote
ICFP
2008
ACM
16 years 4 months ago
2008
ACM
This paper presents AURA, a programming language for access control that treats ordinary programming constructs (e.g., integers and recursive functions) and authorization logic co...