Cantitate/Preț
Produs

Principles and Practice of Declarative Programming: International Conference, PPDP'99, Paris, France, September, 29 - October 1, 1999, Proceedings: Lecture Notes in Computer Science, cartea 1702

Editat de Gopalan Nadathur
en Limba Engleză Paperback – 15 sep 1999

Din seria Lecture Notes in Computer Science

Preț: 33999 lei

Preț vechi: 42499 lei
-20% Nou

Puncte Express: 510

Preț estimativ în valută:
6507 6713$ 5507£

Carte tipărită la comandă

Livrare economică 04-18 martie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540665403
ISBN-10: 3540665404
Pagini: 452
Ilustrații: X, 442 p.
Dimensiuni: 155 x 235 x 27 mm
Greutate: 0.63 kg
Ediția:1999
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

C-—: A Portable Assembly Language that Supports Garbage Collection.- On Formalised Proofs of Termination of Recursive Functions.- Argument Filtering Transformation.- A Primitive Calculus for Module Systems.- Non-dependent Types for Standard ML Modules.- Constraint Programming in OPL.- Compiling Constraint Handling Rules into Prolog with Attributed Variables.- Parallel Execution Models for Constraint Programming over Finite Domains.- Functional Plus Logic Programming with Built-In and Symbolic Constraints.- A Calculus for Interaction Nets.- Distributed Programming in a Multi-Paradigm Declarative Language.- Logical and Meta-Logical Frameworks.- A Simple and General Method for Integrating Abstract Interpretation in SICStus.- Run Time Type Information in Mercury.- A Virtual Machine for a Process Calculus.- Optimising Bytecode Emulation for Prolog.- OPENLOG: A Logic Programming Language Based on Abduction.- An Operational Semantics of Starlog.- On the Verification of Finite Failure.- Localizing and Explaining Reasons for Non-terminating Logic Programs with Failure-Slices.- Modular Termination Proofs for Prolog with Tabling.- Declarative Program Transformation: A Deforestation Case-Study.- A Semantic Account of Type-Directed Partial Evaluation.- A Parameterized Unfold/Fold Transformation Framework for Definite Logic Programs.- Widening Sharing.

Caracteristici

Includes supplementary material: sn.pub/extras