Kung-Kiu Lau, Tim Clement
Proceedings of the Second International Workshop on Logic Program Synthesis and Transformation
LOPSTR, 1992.

@proceedings{LOPSTR-1992,
	editor        = "Kung-Kiu Lau and Tim Clement",
	isbn          = "['3-540-19806-7', '0-387-19806-7']",
	publisher     = "{Springer-Verlag}",
	series        = "{Workshops in Computing}",
	title         = "{Proceedings of the Second International Workshop on Logic Program Synthesis and Transformation}",
	year          = 1992,
}

Contents (18 items)

7 ×#source code
6 ×#prolog
5 ×#logic programming
3 ×#synthesis
2 ×#abstract interpretation
2 ×#partial evaluation
2 ×#performance
2 ×#proving
2 ×#query

LOPSTR-1992-KraanBB #logic programming #proving #synthesis #theorem proving

Logic Program Synthesis via Proof Planning (IK, DAB, AB), pp. 1–14.

LOPSTR-1992-NardiR #deduction #query #source code #synthesis

Deductive Synthesis of Programs for Query Answering (DN, RR), pp. 15–29.

LOPSTR-1992-Loria-Saenz #source code #synthesis

Synthesis of Narrowing Programs (CLS), pp. 30–45.

LOPSTR-1992-FribourgO #induction #logic programming #source code

A Unifying View of Structural Induction and Computation Induction for Logic Programs (LF, HO), pp. 46–60.

LOPSTR-1992-Ornaghi #proving

Proof Nets (MO), pp. 61–79.

LOPSTR-1992-Neugebauer #approach #perspective

The LOPS Approach: A Transformational Point of View (GN), pp. 80–81.

LOPSTR-1992-ProiettiP #incremental #logic programming #source code

Best-first Strategies for Incremental Transformations of Logic Programs (MP, AP), pp. 82–98.

LOPSTR-1992-BoulangerB #abstract interpretation #logic programming #source code #using

Deriving Transformations for Logic Programs Using Abstract Interpretation (DB, MB), pp. 99–117.

LOPSTR-1992-LammaM #partial evaluation

A Rationalisation of the ATMS in Terms of Partial Evaluation (EL, PM), pp. 118–131.

LOPSTR-1992-Giacomo #partial evaluation #query

Intensional Query Answering: An Application of Partial Evaluation (GDG), pp. 132–150.

LOPSTR-1992-GallagherW #logic programming #source code

Deletion of Redundant Unary Type Predicates from Logic Programs (JPG, DAdW), pp. 151–167.

LOPSTR-1992-VerschaetseDS #analysis #automation #termination

Automatic Termination Analysis (KV, SD, DDS), pp. 168–183.

LOPSTR-1992-Jones #programming #prolog

Applications of Unfolding in Prolog Programming (JJ), pp. 184–198.

LOPSTR-1992-Prestwich #prolog

An Unfold Rule for Full Prolog (SDP), pp. 199–213.

LOPSTR-1992-MogensenB #named #prolog #self

Logimix: A Self-Applicable Partial Evaluator for Prolog (TÆM, AB), pp. 214–227.

LOPSTR-1992-ParrainDL #abstract interpretation #optimisation #prolog #source code #towards

Towards Optimization of Full Prolog Programs Guided by Abstract Interpretation (AP, PD, PL), pp. 228–241.

LOPSTR-1992-Demoen #on the #performance #prolog

On the Transformation of a Prolog Program to a More Efficient Binary Program (BD), pp. 242–252.

LOPSTR-1992-Jimenez-MartinMM #compilation #lazy evaluation #performance #prolog

Efficient Compilation of Lazy Narrowing into Prolog (JAJM, JMC, JJMN), pp. 253–270.