Programming Language Implementation and Logic Programming
Editat de Manuel Hermenegildo, Jaan Penjamen Limba Engleză Paperback – 24 aug 1994
Preț: 331.80 lei
Preț vechi: 414.75 lei
-20%
Puncte Express: 498
Preț estimativ în valută:
58.63€ • 67.96$ • 51.13£
58.63€ • 67.96$ • 51.13£
Carte tipărită la comandă
Livrare economică 15-29 mai
Specificații
ISBN-13: 9783540584025
ISBN-10: 3540584021
Pagini: 488
Ilustrații: XIV, 474 p.
Dimensiuni: 155 x 235 x 27 mm
Greutate: 0.73 kg
Ediția:1994
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540584021
Pagini: 488
Ilustrații: XIV, 474 p.
Dimensiuni: 155 x 235 x 27 mm
Greutate: 0.73 kg
Ediția:1994
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Concurrent constraint programming.- Specifications using multiple-conclusion logic programs.- Viewing a program transformation system at work.- A portable and efficient implementation of KL1.- Why Multi-SLD beats SLD (even on a uniprocessor).- Abstracting synchronization in concurrent constraint programming.- A novel term compression scheme and data representation in the BinWAM.- A simple and efficient copying garbage collector for prolog.- Deriving residual reference count garbage collectors.- RML — A new language and implementation for Natural Semantics.- Towards a provably correct compiler for OBJ3.- An implementation technique for a class of bottom-up procedures.- Partial deduction and driving are equivalent.- Partial continuations as the difference of continuations a duumvirate of control operators.- Hand-writing program generator generators.- A logic for encapsulation in object oriented languages.- Annotated constraint logic programming applied to temporal reasoning.- Clp(B): Combining simplicity and efficiency in boolean Constraint solving.- Handling preferences in constraint logic programming with relational optimization.- Improving search for job-shop scheduling with CLP(FD).- Implementations of program composition operations.- Sleepers: a versatile high-level control mechanism.- Improving arithmetic performance using fine-grain unfolding.- Unfold/fold transformations for definite clause programs.- A graph reduction technique with sharing across narrowings for functional-logic languages.- Combining lazy narrowing and simplification.- Combining lazy narrowing with disequality constraints.- Abstracting numerical values in CLP(H,N).- Dynamic dependence in term rewriting systems and its application to program slicing.- Abstracting s-semantics using amodel-theoretic approach.- Using higher-order control flow analysis when compiling functional languages.- Readable, runnable requirements specifications in SPILL-2.- A system to visualize and interact with prolog programs.- Semantic-based static program transformations for memory space and run time optimization in hybrid languages.- Towards a constraint functional logic compiler for symbolic computation systems.- PROMAL — Programming in modal action logic.- Implementing the synthesis of properties in unfold/fold transformations.- Shared memory system for Babel: a VHDL specification.- Towards integrating functional and logic styles using relation.- Tabulation of functions in definite clause programs.- Flang system: A new version.