Skip to main content
SpringerLink
Log in

Typed Lambda Calculi and Applications

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

  • Conference proceedings
  • © 1995

Overview

Editors:
  1. Mariangiola Dezani-Ciancaglini
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Gordon Plotkin
    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 902)

Included in the following conference series:

Conference proceedings info: TLCA 1995.

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

Access this book

Log in via an institution
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 (29 papers)

  1. Front Matter

    Download chapter PDF

  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. What is a categorical model of Intuitionistic Linear Logic?

    • G. M. Bierman
    Pages 78-93

  8. An explicit Eta rewrite rule

    • Daniel Briaud
    Pages 94-108

  9. Extracting text from proofs

    • Yann Coscoy, Gilles Kahn, Laurent Théry
    Pages 109-123

  10. Higher-order abstract syntax in Coq

    • Joëlle Despeyroux, Amy Felty, André Hirschowitz
    Pages 124-138

  11. Expanding extensional polymorphism

    • Roberto Di Cosmo, Adolfo Pipemo
    Pages 139-153

  12. Lambda-calculus, combinators and the comprehension scheme

    • Gilles Dowek
    Pages 154-170

  13. βη-Equality for coproducts

    • Neil Ghani
    Pages 171-185

  14. Typed operational semantics

    • Healfdene Goguen
    Pages 186-200

  15. A simple calculus of exception handling

    • Philippe de Groote
    Pages 201-215

  16. A simple model for quotient types

    • Martin Hofmann
    Pages 216-234

  17. Untyped λ-calculus with relative typing

    • M. Randall Holmes
    Pages 235-248

  18. Final semantics for untyped λ-calculus

    • Furio Honsell, Marina Lenisa
    Pages 249-265

  19. A simplification of Girard's paradox

    • Antonius J. C. Hurkens
    Pages 266-278

  20. Basic properties of data types with inequational refinements

    • Hidetaka Kondoh
    Pages 279-296
Back to top

Other volumes

  1. Typed Lambda Calculi and Applications

Keywords

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

Publish with us

Policies and ethics

Back to top

Search

Navigation