Typed Lambda Calculi and Applications
Editat de Pawel Urzyczynen Limba Engleză Paperback – 7 apr 2005
Preț: 329.94 lei
Preț vechi: 412.42 lei
-20%
Puncte Express: 495
Carte tipărită la comandă
Livrare economică 08-22 iulie
Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 400.00 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
Specificații
ISBN-13: 9783540255932
ISBN-10: 3540255931
Pagini: 452
Ilustrații: XII, 436 p.
Dimensiuni: 155 x 235 x 25 mm
Greutate: 0.68 kg
Ediția:2005
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540255931
Pagini: 452
Ilustrații: XII, 436 p.
Dimensiuni: 155 x 235 x 25 mm
Greutate: 0.68 kg
Ediția:2005
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Completeness Theorems and ?-Calculus.- Completeness Theorems and ?-Calculus.- A Tutorial Example of the Semantic Approach to Foundational Proof-Carrying Code: Abstract.- Can Proofs Be Animated By Games?.- Contributed Papers.- Untyped Algorithmic Equality for Martin-Löf’s Logical Framework with Surjective Pairs.- The Monadic Second Order Theory of Trees Given by Arbitrary Level-Two Recursion Schemes Is Decidable.- A Feasible Algorithm for Typing in Elementary Affine Logic.- Practical Inference for Type-Based Termination in a Polymorphic Setting.- Relational Reasoning in a Nominal Semantics for Storage.- Filters on CoInductive Streams, an Application to Eratosthenes’ Sieve.- Recursive Functions with Higher Order Domains.- Elementary Affine Logic and the Call-by-Value Lambda Calculus.- Rank-2 Intersection and Polymorphic Recursion.- Arithmetical Proofs of Strong Normalization Results for the Symmetric ??-Calculus.- Subtyping Recursive Types Modulo Associative Commutative Products.- Galois Embedding from Polymorphic Types into Existential Types.- On the Degeneracy of ?-Types in Presence of Computational Classical Logic.- Semantic Cut Elimination in the Intuitionistic Sequent Calculus.- The Elimination of Nesting in SPCF.- Naming Proofs in Classical Propositional Logic.- Reducibility and ???-Lifting for Computation Types.- Privacy in Data Mining Using Formal Methods.- L3: A Linear Language with Locations.- Binding Signatures for Generic Contexts.- Proof Contexts with Late Binding.- The -Calculus. Functional Programming with Higher-Order Encodings.- A Lambda Calculus for Quantum Computation with Classical Control.- Continuity and Discontinuity in Lambda Calculus.- Call-by-Name and Call-by-Value as Token-Passing Interaction Nets.- Avoiding Equivariance inAlpha-Prolog.- Higher-Order Abstract Non-interference.