Typed Lambda Calculi and Applications
Editat de Samson Abramskyen Limba Engleză Paperback – 20 apr 2001
Preț: 385.06 lei
Puncte Express: 578
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: 9783540419600
ISBN-10: 3540419608
Pagini: 448
Ilustrații: XII, 436 p.
Dimensiuni: 155 x 235 x 25 mm
Greutate: 0.67 kg
Ediția:2001
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540419608
Pagini: 448
Ilustrații: XII, 436 p.
Dimensiuni: 155 x 235 x 25 mm
Greutate: 0.67 kg
Ediția:2001
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Invited Lectures.- Many Happy Re urns.- From Bounded Arithmetic to Memory Management: Use of Type Theory to Capture Complexity Classes and Space Behaviour.- Definability of Total Objects in PCF and Related Calculi.- Categorical Semantics of Control.- Contributed Papers.- Representations of First Order Function Types as Terminal Coalgebras.- A Finitary Subsystem of the Polymorphic ?-Calculus.- Sequentiality and the ?-Calculus.- Logical Properites of Name Restriction.- Subtyping Recursive Games.- Typing Lambda Terms in Elementary Logic with Linear Constraints.- Ramied Recurrence with Dependent Types.- Game Semantics for the Pure Lazy ?-Calculus.- Reductions, intersection types, and explicit substitutions.- The Stratified Foundations as a Theory Modulo.- Normalization by Evaluation for the Computational Lambda-Calculus.- Induction Is Not Derivable in Second Order Dependent Type Theory.- Strong Normalization of Classical Natural Deduction with Disjunction.- Partially Additive Categories and Fully Complete Models of Linear Logic.- Distinguishing Data Structures and Functions: The Constructor Calculus and Functorial Types.- The Finitely Generated Types of the ?-Calculus.- Deciding Monadic Theories of Hyperalgebraic Trees.- A Deconstruction of Non-deterministic Classical Cut Elimination.- A Token Machine for Full Geometry of Interaction (Extended Abstract).- Second-Order Pre-logical Relations and Representation Independence.- Characterizing Convergent Terms in Object Calculi via Intersection Types.- Parigot’s Second Order ??-Calculus and Inductive Types.- The Implicit Calculus of Constructions Extending Pure Type Systems with an Intersection Type Binder and Subtyping.- Evolving Games and Essential Nets for Affine Polymorphism.- Retracts in Simple Types.- ParallelImplementation Models for the ?-Calculus Using the Geometry of Interaction (Extended Abstract).- The complexity of ?-reduction in low orders.- Strong Normalisation for a Gentzen-like Cut-Elimination Procedure.