1131 search results - page 115 / 227 » Logic Programming, Functional Programming, and Inductive Def... |
108
click to vote
CORR
2000
Springer
15 years 2 months ago
2000
Springer
For logic programs with arithmetic predicates, showing termination is not easy, since the usual order for the integers is not well-founded. A new method, easily incorporated in th...
133
Voted
ICFP
2008
ACM
16 years 2 months ago
2008
ACM
We describe an axiomatic extension to the Coq proof assistant, that supports writing, reasoning about, and extracting higher-order, dependently-typed programs with side-effects. C...
124
Voted
KR
1998
Springer
15 years 6 months ago
1998
Springer
In this paper, we propose a definition of goal achievability: given a basic action theory describing an initial state of the world and some primitive actions available to a robot,...
146
click to vote
LICS
1992
IEEE
15 years 6 months ago
1992
IEEE
We sketch a methodology for the verification of compiler correctness based on the LF Logical Framework as realized within the Elf programming language. We have applied this techni...
141
click to vote
ICFP
2010
ACM
15 years 3 months ago
2010
ACM
Partial evaluation aims to improve the efficiency of a program by specialising it with respect to some known inputs. In this paper, we show that partial evaluation can be an effec...