3481 search results - page 245 / 697 » Higher-Order Logic Programming as Constraint Logic Programmi... |
140
click to vote
PEPM
2010
ACM
16 years 27 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ļ...
137
click to vote
ATAL
2000
Springer
15 years 8 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...
152
click to vote
ICSM
2002
IEEE
15 years 9 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...
128
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...
146
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 uniļ¬cation replaces matching. In this ...