Programming Languages: Implementations, Logics and Programs
Springer Berlin (Verlag)
978-3-540-60359-7 (ISBN)
The book presents 26 refereed full papers selected from 84 submissions; they report research on declarative programming languages and provide insights in the relation between the logic of those languages, implementation techniques, and the use of these languages in constructing real programs. In addition there are abstracts or full presentations of three invited talks as well as eight posters and demonstrations.
A generic program for sequential decision processes.- Parsing visual languages with constraint multiset grammars.- Programming with constructor classes.- Towards a taxonomy of functional language implementations.- A ?-calculus à la de Bruijn with explicit substitutions.- A verified implementation of narrowing.- A new calculus for semantic matching.- A complete narrowing calculus for higher-order functional logic programming.- Exploiting parallelism in tabled evaluations.- Design and implementation of jump tables for fast indexing of logic programs.- An abstract machine for Oz.- Uniform PERs and comportment analysis.- Uniqueness type inference.- Modes of comprehension: Mode analysis of arrays and array comprehensions.- Better consumers for deforestation.- Efficient compile-time garbage collection for arbitrary data structures.- Efficient multi-level generating extensions for program specialization.- Mechanically verifying the correctness of an offline partial evaluator.- A semantic model of binding times for safe partial evaluation.- Gadgets: Lazy functional components for graphical user interfaces.- Lightweight GUIs for functional programming.- Local linear logic for locality consciousness in multiset transformation.- The notion of floundering for SLDNF-resolution revisited.- Minimal set unification.- Goal-directed query processing in disjunctive logic databases.- A dataflow semantics for constraint logic programs.- A functional framework for deterministically interleaved interactive programs.- A debugging model for lazy narrowing.- Evaluation of expressions in a multiparadigm framework.- An expression-or-parallel implementation for a functional logic language.- Attributed models of executable specifications.- Approximating constraint logic programs using polymorphictypes and regular descriptions.- Performance of a data-parallel concurrent constraint programming system.- A portable implementation of memoing evaluation.
| Erscheint lt. Verlag | 11.9.1995 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science |
| Zusatzinfo | XII, 476 p. |
| Verlagsort | Berlin |
| Sprache | englisch |
| Maße | 155 x 233 mm |
| Gewicht | 640 g |
| Themenwelt | Mathematik / Informatik ► Informatik ► Programmiersprachen / -werkzeuge |
| Schlagworte | Abstract Interpretation • Abstrakte Interpretation • Constraint • Constraint Programming • Database • data structure • Debugging • Declarative Programming • Deklaratives Programmieren • Functional Programming • Funktionales Programmieren • Hardcover, Softcover / Informatik, EDV/Informatik • HC/Informatik, EDV/Informatik • Logic • Logische Programmierung • Partial Evaluation • Partielle Evaluierung • Programmiersprache • Programmierung • programming • Programmsemantik • Program Semantics • Resolution • Semantics |
| ISBN-10 | 3-540-60359-X / 354060359X |
| ISBN-13 | 978-3-540-60359-7 / 9783540603597 |
| Zustand | Neuware |
| Informationen gemäß Produktsicherheitsverordnung (GPSR) | |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
