Typed Lambda Calculi and Applications (Paperback)

Jean-Yves Girard

ISBN 10: 3540657630 / ISBN 13: 9783540657637

Editore: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, Berlin, 1999

Riguardo questo articolo

Paperback. 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. This text present the proceedings of the 4th International Conference on Typed Lambda Calculi and Applications. The volume reports research results on aspects of typed Lambda calculi and explores noncommutative logics, type theory, algebraic data types, logical calculi and abstract data types. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.

Codice articolo 9783540657637

Dati bibliografici

• Titolo: Typed Lambda Calculi and Applications (Paperback)
• Editore: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, Berlin
• Data di pubblicazione: 1999
• Lingua: Inglese
• ISBN 10: 3540657630
• ISBN 13: 9783540657637
• Rilegatura: Paperback
• Condizione: new

Descrizione articolo

Riassunto

DeGroote U. DeLiguoro M. Dezani R. Dickho? H. Geuvers N. Ghani P. Giannini S. Guerrini B. Harper R. Hasegawa H. Herbelin M. Hofmann K. Honda R. Jagadeesan T. Jim Y. Kameyama M. Kanovich R. Kashima Y. Kinoshita T. Kurata Y. Lafont J. Laird F. Lamarche P. B. Levy C. McBride M. Marz R. Matthes P. -A. Mellies G. Mitschke H. Nickau S. Nishizaki M. Parigot C. Paulin F. Pfenning B.

Contenuti

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.