Typed Lambda Calculi And Applications: 4th International Conference, TLCA'99, L'Aquila, Italy, April 7-9, 1999, Proceedings by Jean-Yves GirardTyped Lambda Calculi And Applications: 4th International Conference, TLCA'99, L'Aquila, Italy, April 7-9, 1999, Proceedings by Jean-Yves Girard

Typed Lambda Calculi And Applications: 4th International Conference, TLCA'99, L'Aquila, Italy…

EditorJean-Yves Girard

Paperback

Pricing and Purchase Info

$142.95

Earn 715 plum® points

Prices and offers may vary in store

Quantity:

In stock online

Ships free on orders over $25

Not available in stores

about

This book constitutes the refereed proceedings of the 4th International Conference on Typed Lambda Calculi and Applications, TLCA'99, held in L'Aquila, Italy in April 1999. The 25 revised full papers presented were carefully reviewed and selected from a total of 50 submissions. Also included are two invited demonstrations. The volume reports research results on various aspects of typed lambda calculi. Among the topics addressed are noncommutative logics, type theory, algebraic data types, logical calculi, abstract data types, and subtyping.
Title:Typed Lambda Calculi And Applications: 4th International Conference, TLCA'99, L'Aquila, Italy…Format:PaperbackDimensions:405 pages

The following ISBNs are associated with this title:

ISBN - 10:3540657630

ISBN - 13:9783540657637

Look for similar items by category:

Reviews

Table of Contents

Invited Demonstration.- The Coordination Language Facility and Applications.- AnnoDomini in Practice: A Type-Theoretic Approach to the Year 2000 Problem.- Contributions.- Modules in Non-commutative Logic.- Elementary Complexity and Geometry of Interaction.- Quantitative Semantics Revisited.- Total Functionals and Well-Founded Strategies.- Counting a Type's Principal Inhabitants.- Useless-Code Detection and Elimination for PCF with Algebraic Data Types.- Every Unsolvable ? Term has a Decoration.- Game Semantics for Untyped ???-Calculus.- A Finite Axiomatization of Inductive-Recursive Definitions.- Lambda Definability with Sums via Grothendieck Logical Relations.- Explicitly Typed ??-Calculus for Polymorphism and Call-by-Value.- Soundness of the Logical Framework for Its Typed Operational Semantic.- Logical Predicates for Intuitionistic Linear Type Theories.- Polarized Proof-Nets: Proof-Nets for LC.- Call-by-Push-Value: A Subsuming Paradigm.- A Study of Abramsky's Linear Chemical Abstract Machine.- Resource Interpretations, Bunched Implications and the ??-Calculus (Preliminary Version).- A Curry-Howard Isomorphism for Compilation and Program Execution.- Natural Deduction for Intuitionistic Non-commutative Linear Logic.- A Logic for Abstract Data Types as Existential Types.- Characterising Explicit Substitutions which Preserve Termination.- Explicit Environments.- Consequences of Jacopini's Theorem: Consistent Equalities and Equations.- Strong Normalisation of Cut-Elimination in Classical Logic.- Pure Type Systems with Subtyping.