Functional and Logic Programming
Editat de Yukiyoshi Kameyama, Peter J. Stuckeyen Limba Engleză Paperback – 24 mar 2004
Preț: 322.40 lei
Preț vechi: 403.00 lei
-20% Nou
Puncte Express: 484
Preț estimativ în valută:
57.05€ • 66.99$ • 50.07£
57.05€ • 66.99$ • 50.07£
Carte tipărită la comandă
Livrare economică 27 ianuarie-10 februarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540214021
ISBN-10: 354021402X
Pagini: 324
Ilustrații: X, 307 p.
Dimensiuni: 155 x 235 x 18 mm
Greutate: 0.49 kg
Ediția:2004
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 354021402X
Pagini: 324
Ilustrații: X, 307 p.
Dimensiuni: 155 x 235 x 18 mm
Greutate: 0.49 kg
Ediția:2004
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Invited Papers.- A Brief Survey of Quantum Programming Languages.- Analysis of Synchronous and Asynchronous Cellular Automata Using Abstraction by Temporal Logic.- Twelf and Delphin: Logic and Functional Programming in a Meta-logical Framework.- Refereed Papers Logic and Functional-Logic Programming.- Online Justification for Tabled Logic Programs.- Constructive Intensional Negation.- Analysing Definitional Trees: Looking for Determinism.- Applications.- : a Declarative Debugging Tool for Functional-Logic Languages.- LIX: an Effective Self-applicable Partial Evaluator for Prolog.- Program Analysis.- Multivariant Non-failure Analysis via Standard Abstract Interpretation.- Set-Sharing Is Not Always Redundant for Pair-Sharing.- Backward Pair Sharing Analysis.- Rewriting.- Implementing Natural Rewriting and Narrowing Efficiently.- Complete Axiomatization of an Algebraic Construction of Graphs.- Sub-Birkhoff.- Types and Modules.- Relaxing the Value Restriction.- Rigid Mixin Modules.- Logic and Semantics.- Semantics of Linear Continuation-Passing in Call-by-Name.- A Direct Proof of Strong Normalization for an Extended Herbelin’s Calculus.- Functional Programming.- Normalization by Evaluation for ? ?2.- Basic Pattern Matching Calculi: a Fresh View on Matching Failure.- Derivation of Deterministic Inverse Programs Based on LR Parsing.