Skip to main content
  • Conference proceedings
  • © 1999

Typed Lambda Calculi and Applications

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

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

Conference series link(s): TLCA: International Conference on Typed Lambda Calculi and Applications

Conference proceedings info: TLCA 1999.

Buy it now

Buying options

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

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

Table of contents (27 papers)

  1. Front Matter

    Pages I-VIII
  2. Invited Demonstration

    1. 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. Every Unsolvable λ Term has a Decoration

      • René David
      Pages 98-113
    7. Game Semantics for Untyped λβη-Calculus

      • Pietro Di Gianantonio, Gianluca Franco, Furio Honsell
      Pages 114-128
    8. A Finite Axiomatization of Inductive-Recursive Definitions

      • Peter Dybjer, Anton Setzer
      Pages 129-146
    9. Lambda Definability with Sums via Grothendieck Logical Relations

      • Marcelo Fiore, Alex Simpson
      Pages 147-161
    10. Polarized Proof-Nets: Proof-Nets for LC

      • Olivier Laurent
      Pages 213-227
    11. Call-by-Push-Value: A Subsuming Paradigm

      • Paul Blain Levy
      Pages 228-243
    12. A Study of Abramsky’s Linear Chemical Abstract Machine

      • Seikoh Mikami, Yohji Akama
      Pages 243-257

Other Volumes

  1. Typed Lambda Calculi and Applications

Editors and Affiliations

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

    Jean-Yves Girard

Bibliographic Information

Buy it now

Buying options

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