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 Wirsingen Limba Engleză Paperback – 14 aug 1991
Din seria Lecture Notes in Computer Science
- 20% Preț: 1040.03 lei
- 20% Preț: 333.46 lei
- 20% Preț: 335.08 lei
- 20% Preț: 444.17 lei
- 20% Preț: 238.01 lei
- 20% Preț: 333.46 lei
- 20% Preț: 438.69 lei
- Preț: 440.52 lei
- 20% Preț: 336.71 lei
- 20% Preț: 148.66 lei
- 20% Preț: 310.26 lei
- 20% Preț: 256.27 lei
- 20% Preț: 632.22 lei
- 17% Preț: 427.22 lei
- 20% Preț: 641.78 lei
- 20% Preț: 307.71 lei
- 20% Preț: 1053.45 lei
- 20% Preț: 579.56 lei
- Preț: 373.56 lei
- 20% Preț: 330.23 lei
- 15% Preț: 429.74 lei
- 20% Preț: 607.39 lei
- 20% Preț: 538.29 lei
- Preț: 389.48 lei
- 20% Preț: 326.98 lei
- 20% Preț: 1386.07 lei
- 20% Preț: 1003.66 lei
- 20% Preț: 567.60 lei
- 20% Preț: 575.48 lei
- 20% Preț: 571.63 lei
- 20% Preț: 747.79 lei
- 15% Preț: 568.74 lei
- 17% Preț: 360.19 lei
- 20% Preț: 504.57 lei
- 20% Preț: 172.69 lei
- 20% Preț: 369.12 lei
- 20% Preț: 346.40 lei
- 20% Preț: 574.05 lei
- Preț: 402.62 lei
- 20% Preț: 584.40 lei
- 20% Preț: 747.79 lei
- 20% Preț: 809.19 lei
- 20% Preț: 649.49 lei
- 20% Preț: 343.16 lei
- 20% Preț: 309.90 lei
- 20% Preț: 122.89 lei
Preț: 348.18 lei
Preț vechi: 435.23 lei
-20% Nou
Puncte Express: 522
Preț estimativ în valută:
66.63€ • 69.22$ • 55.35£
66.63€ • 69.22$ • 55.35£
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
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ă
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.