3481 search results - page 341 / 697 » Higher-Order Logic Programming as Constraint Logic Programmi... |
167
click to vote
CC
2001
Springer
15 years 9 months ago
2001
Springer
Abstract. We present a method of specifying standard imperative program optimisations as a rewrite system. To achieve this we have extended the idea of matching sub-terms in expres...
159
click to vote
FASE
2000
Springer
15 years 8 months ago
2000
Springer
We present a family of tools for program development and verification, comprising the transformation system TAS and the theorem proving interface IsaWin. Both are based on the theo...
126
click to vote
IWFM
2003
15 years 6 months ago
2003
This paper describes the derivation of a program for the propagation of information over a network, with acknowledgement (feedback) when the computation is complete. The derivatio...
157
click to vote
ENTCS
2002
15 years 4 months ago
2002
This paper presents a step in the development of an operational approach to program extraction in type theory. In order to get a program from a lambda term, the logical parts need...
142
click to vote
ESOP
1998
Springer
15 years 9 months ago
1998
Springer
Abstract. We study the notion of binding-time analysis for logic programs. We formalise the unfolding aspect of an on-line partial deduction s a Prolog program. Using abstract inte...