Skip to main content
SpringerLink
Log in

Typed Lambda Calculi and Applications

4th International Conference, TLCA'99, L'Aquila, Italy, April 7-9, 1999, Proceedings

  • Conference proceedings
  • © 1999

Overview

Editors:
  1. Jean-Yves Girard

    1. CNRS - UPR9016, Institut de Mathématiques de Luminy, Marseille cedex 9, France

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 1581)

Included in the following conference series:

Conference proceedings info: TLCA 1999.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (27 papers)

  1. Front Matter

    Pages I-VIII
    Download chapter PDF

  2. Invited Demonstration

    1. The Coordination Language Facility and Applications

      • Jean-Marc Andreoli
      Pages 1-5

    2. AnnoDomini in Practice: A Type-Theoretic Approach to the Year 2000 Problem

      • Peter Harry Eidorff, Fritz Henglein, Christian Mossin, Henning Niss, Morten Heine B. Sörensen, Mads Tofte
      Pages 6-13

  3. Contributions

    1. Modules in Non-commutative Logic

      • V. Michele Abrusci
      Pages 14-24

    2. Elementary Complexity and Geometry of Interaction

      • Patrick Baillot, Marco Pedicini
      Pages 25-33

    3. Quantitative Semantics Revisited

      • Nuno Barreiro, Thomas Ehrhard
      Pages 40-53

    4. Total Functionals and Well-Founded Strategies

      • Stefano Berardi, Ugo de’Liguoro
      Pages 54-68

    5. Counting a Type’s Principal Inhabitants

      • Sabine Broda, Luís Damas
      Pages 69-82

    6. Useless-Code Detection and Elimination for PCF with Algebraic Data Types

      • Ferruccio Damiani
      Pages 83-97

    7. Every Unsolvable λ Term has a Decoration

      • René David
      Pages 98-113

    8. Game Semantics for Untyped λβη-Calculus

      • Pietro Di Gianantonio, Gianluca Franco, Furio Honsell
      Pages 114-128

    9. A Finite Axiomatization of Inductive-Recursive Definitions

      • Peter Dybjer, Anton Setzer
      Pages 129-146

    10. Lambda Definability with Sums via Grothendieck Logical Relations

      • Marcelo Fiore, Alex Simpson
      Pages 147-161

    11. Explicitly Typed λμ-Calculus for Polymorphism and Call-by-Value

      • Ken-etsu Fujita
      Pages 162-177

    12. Soundness of the Logical Framework for Its Typed Operational Semantic

      • Healfdene Goguen
      Pages 177-197

    13. Logical Predicates for Intuitionistic Linear Type Theories

      • Masahito Hasegawa
      Pages 198-213

    14. Polarized Proof-Nets: Proof-Nets for LC

      • Olivier Laurent
      Pages 213-227

    15. Call-by-Push-Value: A Subsuming Paradigm

      • Paul Blain Levy
      Pages 228-243

    16. A Study of Abramsky’s Linear Chemical Abstract Machine

      • Seikoh Mikami, Yohji Akama
      Pages 243-257

    17. Resource Interpretations, Bunched Implications and the αλ-Calculus (Preliminary Version)

      • Peter W. O’Hearn
      Pages 258-279
Back to top

Other volumes

  1. Typed Lambda Calculi and Applications

Keywords

Editors and Affiliations

  • CNRS - UPR9016, Institut de Mathématiques de Luminy, Marseille cedex 9, France

    Jean-Yves Girard

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation