Programming Language Implementation and Logic Programming
Editat de Jan Maluszynski, Martin Wirsingen Limba Engleză Paperback – 14 aug 1991
Preț: 329.94 lei
Preț vechi: 412.42 lei
-20%
Puncte Express: 495
Carte tipărită la comandă
Livrare economică 25 iulie-08 august
Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 400.00 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
Specificații
ISBN-13: 9783540544449
ISBN-10: 3540544445
Pagini: 452
Ilustrații: XII, 435 p.
Dimensiuni: 155 x 235 x 25 mm
Greutate: 0.68 kg
Ediția:1991
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540544445
Pagini: 452
Ilustrații: XII, 435 p.
Dimensiuni: 155 x 235 x 25 mm
Greutate: 0.68 kg
Ediția:1991
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
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.