Typed Lambda Calculi and Applications: 4th International Conference, TLCA'99, L'Aquila, Italy, April 7-9, 1999, Proceedings (Lecture Notes in Computer Science, 1581)

Girard, Jean-Yves [Editor]

ISBN 10: 3540657630 / ISBN 13: 9783540657637

Editore: Springer, 1999

Riguardo questo articolo

In shrink wrap. Looks like an interesting title! Codice articolo Q-3540657630

Dati bibliografici

Titolo: Typed Lambda Calculi and Applications: 4th ...

Casa editrice: Springer

Data di pubblicazione: 1999

Legatura: 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.