Cantitate/Preț
Produs

Typed Lambda Calculi and Applications: 8th International Conference, TLCA 2007, Paris, France, June 26-28, 2007, Proceedings: Lecture Notes in Computer Science, cartea 4583

Editat de Simona Ronchi Della Rocca
en Limba Engleză Paperback – 15 iun 2007

Din seria Lecture Notes in Computer Science

Preț: 32132 lei

Preț vechi: 40165 lei
-20% Nou

Puncte Express: 482

Preț estimativ în valută:
6150 6530$ 5094£

Carte tipărită la comandă

Livrare economică 25 decembrie 24 - 08 ianuarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540732273
ISBN-10: 3540732276
Pagini: 414
Ilustrații: X, 400 p.
Dimensiuni: 155 x 235 x 24 mm
Greutate: 0.58 kg
Ediția:2007
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

On a Logical Foundation for Explicit Substitutions.- From Proof-Nets to Linear Logic Type Systems for Polynomial Time Computing.- Strong Normalization and Equi-(Co)Inductive Types.- Semantics for Intuitionistic Arithmetic Based on Tarski Games with Retractable Moves.- The Safe Lambda Calculus.- Intuitionistic Refinement Calculus.- Computation by Prophecy.- An Arithmetical Proof of the Strong Normalization for the ?-Calculus with Recursive Equations on Types.- Embedding Pure Type Systems in the Lambda-Pi-Calculus Modulo.- Completing Herbelin’s Programme.- Continuation-Passing Style and Strong Normalisation for Intuitionistic Sequent Calculi.- Ludics is a Model for the Finitary Linear Pi-Calculus.- Differential Structure in Models of Multiplicative Biadditive Intuitionistic Linear Logic.- The Omega Rule is -Complete in the ??-Calculus.- Weakly Distributive Domains.- Initial Algebra Semantics Is Enough!.- A Substructural Type System for Delimited Continuations.- The Inhabitation Problem for Rank Two Intersection Types.- Extensional Rewriting with Sums.- Higher-Order Logic Programming Languages with Constraints: A Semantics.- Predicative Analysis of Feasibility and Diagonalization.- Edifices and Full Abstraction for the Symmetric Interaction Combinators.- Two Session Typing Systems for Higher-Order Mobile Processes.- An Isomorphism Between Cut-Elimination Procedure and Proof Reduction.- Polynomial Size Analysis of First-Order Functions.- Simple Saturated Sets for Disjunction and Second-Order Existential Quantification.- Convolution -Calculus.