3572 search results - page 219 / 715 » Nominal Logic Programming |
125
Voted
PEPM
2010
ACM
16 years 8 days ago
2010
ACM
We present two tools which together allow reasoning about (a substantial subset of) Haskell programs. One is the code generator of the proof assistant Isabelle, which turns speciï...
132
click to vote
ATAL
2000
Springer
15 years 7 months ago
2000
Springer
This paper presents a programmable logic-based agent control system that interleaves planning, plan execution and perception. In this system, a program is a collection of logical f...
140
click to vote
ICSM
2002
IEEE
15 years 8 months ago
2002
IEEE
Component recovery and remodularization is a means to get back control on large and complex legacy systems suffering from ad-hoc changes by recovering logical components and restr...
115
click to vote
CADE
1999
Springer
15 years 7 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...
129
click to vote
PPDP
2004
Springer
15 years 8 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...