This book constitutes the refereed proceedings of the Eighth International Symposium on Programming Languages, Implementations, Logics, and Programs, PLILP '96, held in conjunction with ALP and SAS in Aachen, Germany, in September 1996.
The 30 revised full papers presented in the volume were selected from a total of 97 submissions; also included are one invited contribution by Lambert Meerlens and five posters and demonstrations. The papers are organized in topical sections on typing and structuring systems, program analysis, program transformation, implementation issues, concurrent and parallel programming, tools and programming environments, lambda-calculus and rewriting, constraints, and deductive database languages.
Author(s): Lambert Meertens (auth.), Herbert Kuchen, S. Doaitse Swierstra (eds.)
Series: Lecture Notes in Computer Science 1140
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1996
Language: English
Pages: 478
Tags: Programming Techniques; Programming Languages, Compilers, Interpreters; Logics and Meanings of Programs; Mathematical Logic and Formal Languages; Artificial Intelligence (incl. Robotics)
Calculate polytypically!....Pages 1-16
Limits of ML-definability....Pages 17-31
Functorial ML....Pages 32-46
Parametric polymorphism for typed Prolog and λProlog....Pages 47-61
GOTA algebras: A specification formalism for inheritance and object hierarchies....Pages 62-76
Towards independent and-parallelism in CLP....Pages 77-91
Annotated structure shape graphs for abstract analysis of Prolog....Pages 92-106
A reactive implementation of Pos using ROBDDs....Pages 107-121
Dynamic Attribute Grammars....Pages 122-136
Logic program specialisation: How to be more specific....Pages 137-151
Controlling conjunctive partial deduction....Pages 152-166
Unfold/Fold transformations of concurrent processes....Pages 167-181
Semantics-based compiling: A case study in type-directed partial evaluation....Pages 182-197
Implementing memoization for partial evaluation....Pages 198-212
Higher order deforestation....Pages 213-227
Scheduling expression DAGs for minimal register need....Pages 228-242
Beyond depth-first: Improving tabled logic programs through alternative scheduling strategies....Pages 243-258
Program Sharing: A new implementation approach for Prolog....Pages 259-273
Systematic extraction and implementation of divide-and-conquer parallelism....Pages 274-288
Functional skeletons generate process topologies in Eden....Pages 289-303
ProFun — A Language for executable specifications....Pages 304-318
From term rewriting to generalised interaction nets....Pages 319-333
Type isomorphisms for module signatures....Pages 334-346
Decidability of logic program semantics and applications to testing....Pages 347-362
PIDGETS unifying pictures and widgets in a constraint-based framework for concurrent functional GUI programming....Pages 363-377
Generalized β-reduction and explicit substitutions....Pages 378-392
Modeling sharing and recursion for weak reduction strategies using explicit substitution....Pages 393-407
Context-sensitive computations in confluent programs....Pages 408-422
Models for using stochastic constraint solvers in constraint logic programming....Pages 423-437
Integrating efficient records into concurrent constraint programming....Pages 438-453
The LOL deductive database programming language (extended abstract)....Pages 454-468
An efficient and precise sharing domain for logic programs....Pages 469-470
Cheap tupling in calculational form....Pages 471-472
Needed narrowing in Prolog....Pages 473-474
Automatic optimization of dynamic scheduling in logic programs....Pages 475-476
Oz Explorer: A visual constraint programming tool....Pages 477-478
