Skip to main content
  • Conference proceedings
  • © 1995

Typed Lambda Calculi and Applications

Second International Conference on Typed Lambda Calculi and Applications, TLCA '95, Edinburgh, United Kingdom, April 10 - 12, 1995. Proceedings

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

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

Conference proceedings info: TLCA 1995.

Buy it now

Buying options

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 (29 papers)

  1. Front Matter

  2. Comparing λ-calculus translations in sharing graphs

    • Andrea Asperti, Cosimo Laneve
    Pages 1-15
  3. Extensions of pure type systems

    • Gilles Barthe
    Pages 16-31
  4. A model for formal parametric polymorphism: A per interpretation for system R

    • Roberto Bellucci, Martin Abadi, Pierre-Louis Curien
    Pages 32-46
  5. A realization of the negative interpretation of the Axiom of Choice

    • Stefano Berardi, Marc Bezem, Thierry Coquand
    Pages 47-62
  6. Using subtyping in program optimization

    • S. Berardi, L. Boerio
    Pages 63-77
  7. An explicit Eta rewrite rule

    • Daniel Briaud
    Pages 94-108
  8. Extracting text from proofs

    • Yann Coscoy, Gilles Kahn, Laurent Théry
    Pages 109-123
  9. Higher-order abstract syntax in Coq

    • Joëlle Despeyroux, Amy Felty, André Hirschowitz
    Pages 124-138
  10. Expanding extensional polymorphism

    • Roberto Di Cosmo, Adolfo Pipemo
    Pages 139-153
  11. βη-Equality for coproducts

    • Neil Ghani
    Pages 171-185
  12. Typed operational semantics

    • Healfdene Goguen
    Pages 186-200
  13. A simple calculus of exception handling

    • Philippe de Groote
    Pages 201-215
  14. A simple model for quotient types

    • Martin Hofmann
    Pages 216-234
  15. Untyped λ-calculus with relative typing

    • M. Randall Holmes
    Pages 235-248
  16. Final semantics for untyped λ-calculus

    • Furio Honsell, Marina Lenisa
    Pages 249-265
  17. A simplification of Girard's paradox

    • Antonius J. C. Hurkens
    Pages 266-278

Other Volumes

  1. Typed Lambda Calculi and Applications

About this book

This volume presents the proceedings of the Second International Conference on Typed Lambda Calculi and Applications, held in Edinburgh, UK in April 1995.
The book contains 29 full revised papers selected from 58 submissions and comprehensively reports the state of the art in the field. The following topics are addressed: proof theory of type systems, logic and type systems, typed lambda calculi as models of (higher-order) computation, semantics of type systems, proof verification via type systems, type systems of programming languages, and typed term rewriting systems.

Bibliographic Information

Buy it now

Buying options

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