A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
Fast and Accurate Strong Termination Analysis with an Application to Partial Evaluation
[chapter]

2010
*
Lecture Notes in Computer Science
*

Together with the selective use of hints [5], we have obtained both

doi:10.1007/978-3-642-11999-6_8
fatcat:5yguk3smlzhgfevquf2o3hrn5i
*a*scalable and an effective*partial**evaluation**procedure*. References 1. M. Bezem. Strong Termination of*Logic**Programs*. ... One major application of this algorithm is*for*offline*partial**evaluation*of large*programs*. ... One major application of this algorithm is*for*offline*partial**evaluation*of large*programs*. ...##
###
Tutorial on specialisation of logic programs

1993
*
Proceedings of the 1993 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation - PEPM '93
*

The main correctness results are given, and the outline of

doi:10.1145/154630.154640
dblp:conf/pepm/Gallagher93
fatcat:q2ayh5axorbcjguiearh2croii
*a*basic algorithm*for**partial**evaluation*of*a**logic**program*with respect to*a*goal. ... This is shown*for*the specialisation of*a*proof*procedure**for*first order*logic*. ... It can be seen that the*procedure*demo1 1 looks similar to*a**partial**evaluation*of*a*solve interpreter*for*member. ...##
###
An improved reductant calculus using fuzzy partial evaluation techniques

2009
*
Fuzzy sets and systems (Print)
*

*Partial*

*evaluation*(PE) is an automatic

*program*transformation technique aiming to obtain, among other advantages, the optimization of

*a*

*program*with respect to parts of its input: hence, it is also known ... As observed in the specialized literature,

*a*multi-adjoint

*logic*

*program*, when interpreted on

*a*

*partially*ordered lattice, has to include all its reductants in order to preserve the (approximate) completeness ... Also it is necessary to introduce an effective

*procedure*

*for*the

*partial*

*evaluation*of

*a*multiadjoint

*logic*

*program*with regard to

*a*set of (goal) atoms. ...

##
###
Logic Programming: Proceedings of the 1990 North American Conference

1992
*
Science of Computer Programming
*

This book also shows that inheritance is

doi:10.1016/0167-6423(92)90013-2
fatcat:mvxm7m4vkrgcpnhxtayalb6nci
*a*central area, and that*a*systematic book about the subject would be very valuable linking quite separate areas of AI together. ... Sahlin's description of Mixtus,*a*practical system*for**partial**evaluation*handling the full Prolog language, was especially interesting*for*me. ... Constraint*logic**programming*is the most diverse group, covering issues of complexity, language,*partial**evaluation*, meta-*programming*,*program*analysis and application. ...##
###
The applicability of logic program analysis and transformation to theorem proving
[chapter]

1994
*
Lecture Notes in Computer Science
*

Analysis and transformation techniques developed

doi:10.1007/3-540-58156-1_15
fatcat:hxxcgtriynbjboqlxl3oq3vt34
*for**logic**programming*can be successfully applied to automatic theorem proving. ... The specialisation techniques developed in this paper are independent of the proof system and can therefore be applied to theorem provers*for*any*logic*written as*logic**programs*. 2 ... Acknowledgements We would like to thank Gerd Neugebauer, Technische Hochschule Darmstadt,*for*reading*a*draft version of this paper and*for*his constructive remarks and many valuable suggestions that contributed ...##
###
Towards Scalable Partial Evaluation of Declarative Programs
[chapter]

2010
*
Lecture Notes in Computer Science
*

I would like to thank the participants of LOPSTR 2009

doi:10.1007/978-3-642-12592-8_1
fatcat:r6x7dgqclba7tm5i3vf22zqlki
*for*their useful feedback. ... I would also like to thank Michael Codish*for*suggesting the use of SAT-based techniques to improve the accuracy of the BTA. ... Introduction*Partial**evaluation*is*a*well-known technique*for**program*specialization [4] . ...##
###
Narrowing-driven partial evaluation of functional logic programs
[chapter]

1996
*
Lecture Notes in Computer Science
*

In this paper, we present

doi:10.1007/3-540-61055-3_28
fatcat:kc32ey7d55dj7ajdl2y5rwah44
*a**partial**evaluation*scheme*for*functional*logic*languages based on an automatic unfolding algorithm which builds narrowing trees. ... To the best of our knowledge, this is the first formal approach to*partial**evaluation*of functional*logic**programs*. ... Our PE*procedure*follows*a*structure similar to the framework developed*for**Logic**Programming*in [25] . ...##
###
An introduction to partial deduction
[chapter]

1992
*
Lecture Notes in Computer Science
*

After several years of neglect, the importance of

doi:10.1007/3-540-56282-6_4
fatcat:ixjsvdrazrbhpfk4zlzulboc2m
*partial*deduction (previously,*partial**evaluation*in*logic**programming*) as an omnipresent principle in*Logic**Programming*, and to*a*certain degree in computing ...*A*selection of applications is presented to illustrate*partial*deduction in different contexts. ... Acknowledgments Thanks are due to the organizers of the META'92 Workshop on Meta-*programming**for*inviting me to present this material. ...##
###
Page 6675 of Mathematical Reviews Vol. , Issue 94k
[page]

1994
*
Mathematical Reviews
*

Summary: “This paper presents some supporting transformations

*for*the*partial**evaluation*of*logic**programs*.*A**logic*language is often used to specify*a**program*. ... M. (4-LEED-SC; Leeds) Supporting transformations*for*the*partial**evaluation*of*logic**programs*. (English summary) J.*Logic*Comput. 3 (1993), no. 5, 469-486. ...##
###
Partial evaluation as a means for inferencing data structures in an applicative language

1982
*
Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '82
*

However,
the

doi:10.1145/582153.582181
dblp:conf/popl/Komorowski82
fatcat:nzaj4kdn5rgenpduftst2useu4
*logic*-related semantics of*logic**programming*provide several useful paradigms which can help in*a*better understanding of the foundations and laws of*partial**evaluation*. ... According to the expectations, the first*partial**evaluation*has produced*a**program*of 53*procedures*where in total 11 clauses have been removed. ...##
###
Towards creating specialised integrity checks through partial evaluation of meta-interpreters

1995
*
Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation - PEPM '95
*

In [23] we presented

doi:10.1145/215465.215598
dblp:conf/pepm/LeuschelS95
fatcat:5uqkyyxxezc7xay7qcgtuv4txq
*a**partial**evaluation*scheme*for**a*"real life" subset of Prolog, cent aining first-order built-in's, simple side-effects and the operational predicate if-then-else. ... Logimix:*A*self- applicable*partial**evaluator**for*Prolog. In K.-K, Lau and T. Clement, editors,*Logic**Program*Synthesis and Transformation. ...*Partial**evaluation*in*logic**programming*. The Journal of*Logic**Program*- ming, 11:217-242, 1991. B. Martens and D. De Schre,ye. ...##
###
Combining fuzzy logic and behavioral similarity for non-strict program validation

2006
*
Proceedings of the 8th ACM SIGPLAN symposium on Principles and practice of declarative programming - PPDP '06
*

*a*program's source code-, fuzzy

*logic*and static

*program*analysis in

*a*way that is completely transparent to the end-user. ... In order to detect various concrete pattern implementations using

*a*single pattern description, we have combined

*logic*meta

*programming*-wherein patterns can be expressed as constraints over facts representing ... Acknowledgments This research was

*partially*funded by the EU-funded network of excellence AOSD-Europe. ...

##
###
Partial correctness: The term-wise approach

1984
*
Science of Computer Programming
*

Whenever

doi:10.1016/0167-6423(84)90017-0
fatcat:q2wn4mfdavhqzdn76knp4ythm4
*a*statement of*partial*correctness of the form The hypothesis of (T2) states that*program*term pt is*evaluated*'almost like term t', the conclusion states that*program*term*a*is*evaluated*'almost ... The following cases apply to*program*terms. Remember that There is no need*for**a*separate proof rule*for**a*simple*program*term x. ... correct wrt*logical*terms t{ and t; iff ...##
###
Intensional learning of logic programs
[chapter]

1994
*
Lecture Notes in Computer Science
*

In this paper we investigate the possibility of learning

doi:10.1007/3-540-57868-4_73
fatcat:ox2zhkitizclhp3ajpu6jc3oue
*logic**programs*by using an intensional*evaluation*of clauses. ... Since searching*a*space of possible*programs*(instead of*a*space of independent clauses) is unfeasible, only*partial**programs*containing clauses successfully used to derive at least one positive example ... Acknowledgement: This work was in part supported by BRA ESPRIT project 6020 on Inductive*Logic**Programming*. ...##
###
Page 2045 of Mathematical Reviews Vol. , Issue 99c
[page]

1991
*
Mathematical Reviews
*

By

*partially**evaluating*this meta-interpreter*for*certain transaction patterns, using*a**partial**evaluation*technique presented in earlier Software 99¢:68044 work, we are able to automatically obtain very ... through*partial**evaluation*of meta-interpreters. ...
« Previous

*Showing results 1 — 15 out of 236,087 results*