Kuchen

Programming Languages: Implementations, Logics, and Programs

8th International Symposium, PLILP '96, Aachen, Germany, September 24 - 27, 1996. Proceedings
Mitarbeit:Kuchen, Herbert; Swierstra, S. D.

• Broschiertes Buch

Produktbeschreibung

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.

Produktdetails

• Lecture Notes in Computer Science 1140
• Verlag: Springer / Springer Berlin Heidelberg / Springer, Berlin
• Artikelnr. des Verlages: 978-3-540-61756-3
• 1996.
• Seitenzahl: 500
• Erscheinungstermin: 11. September 1996
• Englisch
• Abmessung: 235mm x 155mm x 27mm
• Gewicht: 640g
• ISBN-13: 9783540617563
• ISBN-10: 3540617566
• Artikelnr.: 09239631

Inhaltsangabe

Calculate polytypically!.- Limits of ML-definability.- Functorial ML.- Parametric polymorphism for typed Prolog and ?Prolog.- GOTA algebras: A specification formalism for inheritance and object hierarchies.- Towards independent and-parallelism in CLP.- Annotated structure shape graphs for abstract analysis of Prolog.- A reactive implementation of Pos using ROBDDs.- Dynamic Attribute Grammars.- Logic program specialisation: How to be more specific.- Controlling conjunctive partial deduction.- Unfold/Fold transformations of concurrent processes.- Semantics-based compiling: A case study in type-directed partial evaluation.- Implementing memoization for partial evaluation.- Higher order deforestation.- Scheduling expression DAGs for minimal register need.- Beyond depth-first: Improving tabled logic programs through alternative scheduling strategies.- Program Sharing: A new implementation approach for Prolog.- Systematic extraction and implementation of divide-and-conquer parallelism.- Functional skeletons generate process topologies in Eden.- ProFun - A Language for executable specifications.- From term rewriting to generalised interaction nets.- Type isomorphisms for module signatures.- Decidability of logic program semantics and applications to testing.- PIDGETS unifying pictures and widgets in a constraint-based framework for concurrent functional GUI programming.- Generalized ?-reduction and explicit substitutions.- Modeling sharing and recursion for weak reduction strategies using explicit substitution.- Context-sensitive computations in confluent programs.- Models for using stochastic constraint solvers in constraint logic programming.- Integrating efficient records into concurrent constraint programming.- The LOL deductive database programming language (extendedabstract).- An efficient and precise sharing domain for logic programs.- Cheap tupling in calculational form.- Needed narrowing in Prolog.- Automatic optimization of dynamic scheduling in logic programs.- Oz Explorer: A visual constraint programming tool.