Cantitate/Preț
Produs

Functional and Logic Programming: 5th International Symposium, FLOPS 2001, Tokyo, Japan, March 7-9, 2001. Proceedings: Lecture Notes in Computer Science, cartea 2024

Editat de Herbert Kuchen, Kazunori Ueda
en Limba Engleză Paperback – 23 feb 2001

Din seria Lecture Notes in Computer Science

Preț: 32513 lei

Preț vechi: 40641 lei
-20% Nou

Puncte Express: 488

Preț estimativ în valută:
6223 6565$ 5186£

Carte tipărită la comandă

Livrare economică 02-16 ianuarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540417392
ISBN-10: 3540417397
Pagini: 408
Ilustrații: X, 398 p.
Dimensiuni: 155 x 233 x 21 mm
Greutate: 0.57 kg
Ediția:2001
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Invited Papers.- The Metalanguage ?prolog and Its Implementation.- A Scalable Architecture for Proof-Carrying Code.- Parameterized Logic Programs where Computing Meets Learning.- Functional Programming.- Proving Syntactic Properties of Exceptions in an Ordered Logical Framework.- A Higher-Order Colon Translation.- Compiling Lazy Functional Programs Based on the Spineless Tagless G-machine for the Java Virtual Machine.- Logic Programming.- A Higher-Order Logic Programming Language with Constraints.- Specifying and Debugging Security Protocols via Hereditary Harrop Formulas and ?Prolog ? A Case-study ?.- An Effective Bottom-Up Semantics for First-Order Linear Logic Programs.- Functional Logic Programming.- A Framework for Goal-Directed Bottom-Up Evaluation of Functional Logic Programs.- Theoretical Foundations for the Declarative Debugging of Lazy Functional Logic Programs.- Adding Linear Constraints over Real Numbers to Curry.- A Complete Selection Function for Lazy Conditional Narrowing.- An Abstract Machine Based System for a Lazy Narrowing Calculus.- Incremental Learning of Functional Logic Programs.- Types.- A General Type Inference Framework for Hindley/Milner Style Systems.- Monadic Encapsulation with Stack of Regions.- Well-Typed Logic Programs Are not Wrong.- Program Analysis and Transformation.- A Framework for Analysis of Typed Logic Programs.- Abstract Compilation for Sharing Analysis.- A Practical Partial Evaluator for a Multi-Paradigm Declarative Language.- A Simple Take on Typed Abstract Syntax in Haskell-like Languages.- Calculus.- A simply typed context calculus with first-class environments.- Refining the Barendregt Cube using Parameters.

Caracteristici

Includes supplementary material: sn.pub/extras