Research Catalog

Typed lambda calculi and applications : 5th international conference, TLCA 2001, Kraków, Poland, May 2-5, 2001 : proceedings

Title
Typed lambda calculi and applications : 5th international conference, TLCA 2001, Kraków, Poland, May 2-5, 2001 : proceedings / Samson Abramsky (ed.).
Author
International Conference on Typed Lambda Calculi and Applications (5th : 2001 : Kraków, Poland)
Publication
New York : Springer, 2001.

Items in the Library & Off-site

Filter by

1 Item

StatusFormatAccessCall NumberItem Location
TextRequest in advance QA9.5 .I58 2001Off-site

Holdings

Details

Additional Authors
Abramsky, Samson, 1953-
Description
xi, 429 pages : illustrations; 24 cm.
Series Statement
Lecture notes in computer science ; 2044
Uniform Title
Lecture notes in computer science ; 2044.
Subject
Bibliography (note)
  • Includes bibliographical references and index.
Contents
  • Many Happy Returns / Olivier Danvy -- From Bounded Arithmetic to Memory Management: Use of Type Theory to Capture Complexity Classes and Space Behaviour / Martin Hofmann -- Definability of Total Objects in PCF and Related Calculi / Dag Normann -- Categorical Semantics of Control / Peter Selinger -- Representations of First Order Function Types as Terminal Coalgebras / Thorsten Altenkirch -- A Finitary Subsystem for the Polymorphic [lambda]-Calculus / Thorsten Altenkirch and Thierry Coquand -- Sequentiality and the [pi]-Calculus / Martin Berger, Kohei Honda and Nobuko Yoshida -- Logical Properties of Name Restriction / Luca Cardelli and Andrew D. Gordon -- Subtyping Recursive Games / Juliusz Chroboczek -- Typing Lambda Terms in Elementary Logic with Linear Constraints / Paolo Coppola and Simone Martini -- Ramified Recurrence with Dependent Types / Norman Danner -- Game Semantics for the Pure Lazy [lambda]-Calculus / Pietro Di Gianantonio --
  • Reductions, Intersection Types, and Explicit Substitutions / Dan Dougherty and Pierre Lescanne -- The Stratified Foundations as a Theory Modulo / Gilles Dowek -- Normalization by Evaluation for the Computational Lambda-Calculus / Andrzej Filinski -- Induction Is Not Derivable in Second Order Dependent Type Theory / Herman Geuvers -- Strong Normalization of Classical Natural Deduction with Disjunction / Philippe de Groote -- Partially Additive Categories and Fully Complete Models of Linear Logic / Esfandiar Haghverdi -- Distinguishing Data Structures and Functions: The Constructor Calculus and Functorial Types / C. Barry Jay -- The Finitely Generated Types of the [lambda]-Calculus / Thierry Joly -- Deciding Monadic Theories of Hyperalgebraic Trees / Teodor Knapik, Demian Niwinski and Pawel Urzyczyn -- A Deconstruction of Non-deterministic Classical Cut Elimination / James Laird -- A Token Machine for Full Geometry of Interaction / Olivier Laurent --
  • Second-Order Pre-logical Relations and Representation Independence / Hans Leiss -- Characterizing Convergent Terma in Object Calculi via Intersection Types / Ugo de'Liguoro -- Parigot's Second Order [lambda][mu]-Calculus and Inductive Types / Ralph Matthes -- The Implicit Calculus of Constructions: Extending Pure Type Systems with an Intersection Type Binder and Subtyping / Alexandre Miquel -- Evolving Games and Essential Nets for Affine Polymorphism / Andrzej S. Murawski and C.-H. Luke Ong -- Retracts in Simple Types / Vincent Padovani -- Parallel Implementation Models for the [lambda]-Calculus Using the Geometry of Interaction / Jorge Sousa Pinto -- The Complexity of [beta]-Reduction in Low Orders / Aleksy Schubert -- Strong Normalisation for a Gentzen-like Cut-Elimination Procedure / Christian Urban.
ISBN
3540419608 (acid-free paper)
LCCN
2001031431
OCLC
  • ocm46785300
  • SCSB-4128421
Owning Institutions
Columbia University Libraries