Cantitate/Preț
Produs
Total produse
Vezi coșul
Typed Lambda Calculi and Applications: 9th International Conference, TLCA 2009, Brasilia, Brazil, July 1-3, 2009, Proceedings de Pierre-Louis Curien

Typed Lambda Calculi and Applications: 9th International Conference, TLCA 2009, Brasilia, Brazil, July 1-3, 2009, Proceedings: Lecture Notes in Computer Science, cartea 5608

Editat de Pierre-Louis Curien
en Limba Engleză Paperback – 8 iun 2009
This book constitutes the refereed proceedings of the 9th International Conference on Typed Lambda Calculi and Applications, TLCA 2009, held in Brasilia, Brazil in July 2008 in conjunction with RTA 2007, the 19th International Conference on Rewriting Techniques and Applications as part of RDP 2009, the 5th International Conference on Rewriting, Deduction, and Programming. The 27 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 53 submissions. The papers present original research results that are broadly relevant to the theory and applications of typed calculi and address a wide variety of topics such as proof-theory, semantics, implementation, types, and programming.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 32934 lei

Preț vechi: 41168 lei
-20% Nou

Puncte Express: 494
Preț estimativ în valută:
6303€ • 6556$ • 5203£

Carte tipărită la comandă

Livrare economică 10-16 aprilie

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783642022722
ISBN-10: 3642022723
Pagini: 442
Ilustrații: XIII, 417 p.
Dimensiuni: 155 x 235 x 25 mm
Greutate: 0.66 kg
Ediția:2009
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

Mathematical Synthesis of Equational Deduction Systems.- A Pronominal Approach to Binding and Computation.- A Modular Type-Checking Algorithm for Type Theory with Singleton Types and Proof Irrelevance.- Interactive Learning-Based Realizability Interpretation for Heyting Arithmetic with EM 1.- Syntax for Free: Representing Syntax with Binding Using Parametricity.- On the Meaning of Logical Completeness.- Thick Subtrees, Games and Experiments.- Bounded Linear Logic, Revisited.- Partial Orders, Event Structures and Linear Strategies.- Existential Type Systems with No Types in Terms.- Initial Algebra Semantics for Cyclic Sharing Structures.- An Operational Account of Call-by-Value Minimal and Classical ?-Calculus in “Natural Deduction” Form.- Refinement Types as Proof Irrelevance.- Weak ?-Categories from Intensional Type Theory.- Relating Classical Realizability and Negative Translation for Existential Witness Extraction.- Session-Based Communication Optimisation for Higher-Order Mobile Processes.- The Cut-Elimination Theorem for Differential Nets with Promotion.- A Polymorphic Type System for the Lambda-Calculus with Constructors.- Kripke Semantics for Martin-Löf’s Extensional Type Theory.- On the Values of Reducibility Candidates.- Lexicographic Path Induction.- Parametricity for Haskell with Imprecise Error Semantics.- Some Observations on the Proof Theory of Second Order Propositional Multiplicative Linear Logic.- Algebraic Totality, towards Completeness.- A Logical Foundation for Environment Classifiers.- Inhabitation of Low-Rank Intersection Types.- Differential Linear Logic and Polarization.- Complexity of Gödel’s T in ?-Formulation.- The Computational SLR: A Logic for Reasoning about Computational Indistinguishability.

Textul de pe ultima copertă

This book constitutes the refereed proceedings of the 9th International Conference on Typed Lambda Calculi and Applications, TLCA 2009, held in Brasilia, Brazil in July 2008 in conjunction with RTA 2007, the 19th International Conference on Rewriting Techniques and Applications as part of RDP 2009, the 5th International Conference on Rewriting, Deduction, and Programming.
The 27 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 53 submissions. The papers present original research results that are broadly relevant to the theory and applications of typed calculi and address a wide variety of topics such as proof-theory, semantics, implementation, types, and programming.