+612 9045 4394
 
CHECKOUT
Typed Lambda Calculi and Applications : 5th International Conference, TLCA 2001, Krakow, Poland, May 2-5, 2001: Proceedings :  5th International Conference, TLCA 2001, Krakow, Poland, May 2-5, 2001: Proceedings - Samson Abramsky

Typed Lambda Calculi and Applications : 5th International Conference, TLCA 2001, Krakow, Poland, May 2-5, 2001: Proceedings

5th International Conference, TLCA 2001, Krakow, Poland, May 2-5, 2001: Proceedings

By: Samson Abramsky (Editor)

Paperback Published: May 2001
ISBN: 9783540419600
Number Of Pages: 436

Share This Book:

Paperback

$135.51
or 4 easy payments of $33.88 with Learn more
Ships in 5 to 9 business days

This book contains the keynote, invited and full contributed papers presented at COMPSTAT 2000, held in Utrecht. The papers range over all aspects of the link between statistical theory and applied statistics, with special attention for developments in the area of official statistics. The papers have been thoroughly refereed.

Invited Lecturesp. 1
Many Happy Returnsp. 1
From Bounded Arithmetic to Memory Management: Use of Type Theory to Capture Complexity Classes and Space Behaviourp. 2
Definability of Total Objects in PCF and Related Calculip. 4
Categorical Semantics of Controlp. 6
Contributed Papers Representations of First Order Function Types as Terminal Coalgebrasp. 8
A Finitary Subsystem of the Polymorphic?-Calculusp. 22
Sequentiality and the p-Calculusp. 29
Logical Properties of Name Restrictionp. 46
Subtyping Recursive Gamesp. 61
Typing Lambda Terms in Elementary Logic with Linear Constraintsp. 76
Ramified Recurrence with Dependent Typesp. 91
Game Semantics for the Pure Lazy -Calculusp. 106
Reductions, Intersection Types, and Explicit Substitutionsp. 121
The Stratified Foundations as a Theory Modulop. 136
Normalization by Evaluation for the Computational Lambda-Calculusp. 151
Induction Is Not Derivable in Second Order Dependent Type Theoryp. 166
Strong Normalization of Classical Natural Deduction with Disjunctionp. 182
Partially Additive Categories and Fully Complete Models of Linear Logicp. 197
Distinguishing Data Structures and Functions: The Constructor Calculus and Functorial Typesp. 217
The Finitely Generated Types of the -Calculusp. 240
Deciding Monadic Theories of Hyperalgebraic Treesp. 253
A Deconstruction of Non-deterministic Classical Cut Eliminationp. 268
A Token Machine for Full Geometry of Interactionp. 283
Second-Order Pre-logical Relations and Representation Independencep. 298
Characterizing Convergent Terms in Object Calculi via Intersection Typesp. 315
ParigotÆs Second Order?µ-Calculus and Inductive Typesp. 329
The Implicit Calculus of Constructions: Extending Pure Type Systems with an Intersection Type Binder and Subtypingp. 344
Evolving Games and Essential Nets for Affine Polymorphismp. 360
Retracts in Simple Typesp. 376
Parallel Implementation Models for the -Calculus Using the Geometry of Interactionp. 385
The Complexity of ß-Reduction in Low Ordersp. 400
Strong Normalisation for a Gentzen-like Cut-Elimination Procedurep. 415
Author Indexp. 431
Table of Contents provided by Publisher. All Rights Reserved.

ISBN: 9783540419600
ISBN-10: 3540419608
Series: Lecture Notes in Computer Science
Audience: General
Format: Paperback
Language: English
Number Of Pages: 436
Published: May 2001
Publisher: Springer-Verlag Berlin and Heidelberg Gmbh & Co. Kg
Country of Publication: DE
Dimensions (cm): 23.39 x 15.6  x 2.31
Weight (kg): 0.62