Typed Lambda Calculi and Applications : 5th International Conference, TLCA 2001 Krakow, Poland, May 2-5, 2001 Proceedings / edited by Samson Abramsky.

Format:

Book

Contributor:

Abramsky, Samson, 1953- editor.

SpringerLink (Online service)

Series:

Computer Science (Springer-11645)

Lecture notes in computer science 0302-9743 ; 2044.

Lecture Notes in Computer Science, 0302-9743 ; 2044

Language:

English

Subjects (All):

Mathematical analysis.

Analysis (Mathematics).

Logic, Symbolic and mathematical.

Computer logic.

Computer programming.

Programming languages (Electronic computers).

Analysis.

Mathematical Logic and Foundations.

Mathematical Logic and Formal Languages.

Logics and Meanings of Programs.

Programming Techniques.

Programming Languages, Compilers, Interpreters.

Local Subjects:

Analysis.

Mathematical Logic and Foundations.

Mathematical Logic and Formal Languages.

Logics and Meanings of Programs.

Programming Techniques.

Programming Languages, Compilers, Interpreters.

Physical Description:

1 online resource (XII, 436 pages).

Edition:

First edition 2001.

Contained In:

Springer eBooks

Place of Publication:

Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2001.

System Details:

text file PDF

Summary:

This book constitutes the refereed proceedings of the 5th International Conference on Typed Lambda Calculi and Applications, TLCA 2001, held in Krakow, Poland in May 2001. The 28 revised full papers presented were carefully reviewed and selected from 55 submissions. The volume reports research results on all current aspects of typed lambda calculi. Among the topics addressed are type systems, subtypes, coalgebraic methods, pi-calculus, recursive games, various types of lambda calculi, reductions, substitutions, normalization, linear logic, cut-elimination, prelogical relations, and mu calculus.

Contents:

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

Parallel Implementation 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.

Other Format:

Printed edition:

ISBN:

978-3-540-45413-7

9783540454137

Access Restriction:

Restricted for use by site license.