Cantitate/Preț
Produs

Programming Language Implementation and Logic Programming: 3rd International Symposium, PLILP '91, Passau, Germany, August 26-28, 1991. Proceedings: Lecture Notes in Computer Science, cartea 528

Editat de Jan Maluszynski, Martin Wirsing
en Limba Engleză Paperback – 14 aug 1991
This volume contains the papers which have been accepted forpresentation atthe Third International Symposium onProgramming Language Implementation andLogic Programming(PLILP '91) held in Passau, Germany, August 26-28, 1991. Theaim of the symposium was to explore new declarativeconcepts, methods and techniques relevant for theimplementation of all kinds of programming languages,whether algorithmic or declarative ones. The intention wasto gather researchers from the fields of algorithmicprogramming languages as well as logic, functional andobject-oriented programming. This volume contains the twoinvited talks given at the symposium by H. Ait-Kaci andD.B. MacQueen, 32 selected papers, and abstracts of severalsystem demonstrations. The proceedings of PLILP '88 andPLILP '90 are available as Lecture Notes in Computer ScienceVolumes 348 and 456.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 34818 lei

Preț vechi: 43523 lei
-20% Nou

Puncte Express: 522

Preț estimativ în valută:
6663 6922$ 5535£

Carte tipărită la comandă

Livrare economică 03-17 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540544449
ISBN-10: 3540544445
Pagini: 452
Ilustrații: XII, 435 p.
Dimensiuni: 155 x 233 x 24 mm
Greutate: 1.05 kg
Ediția:1991
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Standard ML of New Jersey.- Adding equations to NU-Prolog.- Extraction of functional from logic program.- The MAS specification component.- Domesticating imperative constructs so that they can live in a functional world.- Logic-based specification of visibility rules.- Optimal instruction scheduling using constraint logic programming.- An architectural model for OR-parallellism on distributed memory systems.- FRATS: A parallel reduction strategy for shared memory.- Narrowing as an incremental constraint satisfaction algorithm.- The implementation of lazy narrowing.- Semantics-directed generation of a Prolog compiler.- A framework to specify database update views for Prolog.- Concepts for a modular and distributed Prolog language.- From parlog to polka in two easy steps.- Precedences in specifications and implementations of programming languages.- A randomized heuristic approach to register allocation.- Generating efficient code from data-flow programs.- On the borderline between grammars and programs.- Efficient incremental evaluation of higher order attribute grammars.- Profit: A system integrating logic programming and attribute grammars.- Towards a meaning of LIFE.- U-log, an ordered sorted logic with typed attributes.- Compilation of predicate abstractions in higher-order logic programming.- Abstract interpretation: A kind of magic.- Abstract interpretation for type checking.- A technique for recursive invariance detection and selective program specialization.- Dynamic detection of determinism in functional logic languages.- Unfolding — definition — folding, in this order, for avoiding unnecessary variables in logic programs.- Efficient integration of simplification into Prolog.- Lazy evaluation in logic.- S-SLD-resolution — An operational semantics for logicprograms with external procedures.- Operational semantics of constraint logic programming over finite domains.- Constraints for synchronizing coarse-grained sequential logic processes.- Extending execution trees for debugging and animation in logic programming.- A narrowing-based theorem prover.- The ALF system.- Experiences with gentle: Efficient compiler construction based on logic programming.- The system FLR ( Fast laboratory for recomposition ).- Multilanguage interoperability.- Short overview of the CLPS system.