Programming Language Implementation and Logic Programming
Editat de Maurice Bruynooghe, Jaan Penjamen Limba Engleză Paperback – 13 aug 1993
Preț: 329.35 lei
Preț vechi: 411.69 lei
-20%
Puncte Express: 494
Preț estimativ în valută:
58.24€ • 66.78$ • 50.33£
58.24€ • 66.78$ • 50.33£
Carte tipărită la comandă
Livrare economică 27 aprilie-11 mai
Specificații
ISBN-13: 9783540571865
ISBN-10: 3540571868
Pagini: 440
Ilustrații: XIII, 427 p.
Dimensiuni: 155 x 235 x 24 mm
Greutate: 0.66 kg
Ediția:1993
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540571868
Pagini: 440
Ilustrații: XIII, 427 p.
Dimensiuni: 155 x 235 x 24 mm
Greutate: 0.66 kg
Ediția:1993
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Executable specifications for language implementation.- Avoiding dynamic delays in functional logic programs.- A debugging model for functional logic programs.- A conservative approach to meta-programming in constraint logic programming.- The versatility of handling disjunctions as constraints.- Efficient bottom-up abstract interpretation of prolog by means of constraint solving over symbolic finite domains (extended abstract).- Improvements in compile-time analysis for Ground Prolog.- A new top-down parsing algorithm for left-recursive DCGs.- Specification and implementation of grammar couplings using attribute grammars.- Programming language specification and prototyping using the MAX system.- Flang and its implementation.- Efficient lazy narrowing using demandedness analysis.- A demand driven computation strategy for lazy narrowing.- Functional programming languages with logical variables: A linear logic view.- Objects with state in contextual logic programming.- A novel method for parallel implementation of findall.- A parallel implementation for AKL.- Inlining to reduce stack space.- A WAM-based implementation of a logic language with sets.- An OR parallel Prolog model for distributed memory systems.- Executing bounded quantifications on shared memory multiprocessors.- A lattice of abstract graphs.- Higher-order chaotic iteration sequences.- Proving the correctness of compiler optimisations based on strictness analysis.- Abstract complexity of prolog based on WAM.- Development of rewriting strategies.- Narrowing approximations as an optimization for equational logic programs.- Pagode: A back end generator.- SelfLog: Language and implementation.- Embedding declarative subprograms into imperative constructs.- Stack management of runtime structures in distributed implementations.- Efficient register allocation for large basic blocks.- Generation of synchronization code for parallel compilers.