Skip to main content
  • Conference proceedings
  • © 1997

Typed Lambda Calculi and Applications

Third International Conference on Typed Lambda Calculi and Applications, TLCA '97, Nancy, France, April 2-4, 1997, Proceedings

Editors:

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

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

Conference proceedings info: TLCA 1997.

Buying options

eBook
USD 89.00
Price excludes VAT (USA)
  • ISBN: 978-3-540-68438-1
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD 119.00
Price excludes VAT (USA)

This is a preview of subscription content, access via your institution.

Table of contents (24 papers)

  1. Front Matter

  2. Typed intermediate languages for shape analysis

    • Gianna Bellè, Eugenio Moggi
    Pages 11-29
  3. Matching constraints for the Lambda Calculus of Objects

    • Viviana Bono, Michele Bugliesi
    Pages 46-62
  4. Coinductive axiomatization of recursive type equality and subtyping

    • Michael Brandt, Fritz Henglein
    Pages 63-81
  5. A simple adequate categorical model for PCF

    • Torben Braüner
    Pages 82-98
  6. Logical reconstruction of bi-domains

    • Antonio Bucciarelli
    Pages 99-111
  7. A module calculus for pure type systems

    • Judicaël Courant
    Pages 112-128
  8. An inference algorithm for strictness

    • Ferruccio Damiani, Paola Giannini
    Pages 129-146
  9. Primitive recursion for higher-order abstract syntax

    • Joëlle Despeyroux, Frank Pfenning, Carsten Schürmann
    Pages 147-163
  10. Proof nets, garbage, and computations

    • S. Guerrini, S. Martini, A. Masini
    Pages 181-195
  11. A type theoretical view of Böhm-trees

    • Toshihiko Kurata
    Pages 231-247
  12. Schwichtenberg-style lambda definability is undecidable

    • Jan Małolepszy, Małgorzata Moczurad, Marek Zaionc
    Pages 267-283
  13. Outermost-fair rewriting

    • Femke van Raamsdonk
    Pages 284-299

Other Volumes

  1. Typed Lambda Calculi and Applications

    Third International Conference on Typed Lambda Calculi and Applications TLCA '97 Nancy, France, April 2–4, 1997 Proceedings

About this book

This book constitutes the refereed proceedings of the Third International Conference on Typed Lambda Calculi and Applications, TLCA '97, held in Nancy, France, in April 1997.
The 24 revised full papers presented in the book were carefully selected from a total of 54 submissions. The book reports the main research advances achieved in the area of typed lambda calculi since the predecessor conference, held in 1995, and competently reflects the state of the art in the area.

Keywords

  • Lambda calculi
  • Lambda-Kalküle
  • Monoid
  • Programmiersprachen
  • Typensysteme
  • algorithm
  • algorithms
  • commutative property
  • logic
  • programming logics
  • proof
  • semantic techniques
  • theorem proving
  • type systems
  • type theory

Bibliographic Information

Buying options

eBook
USD 89.00
Price excludes VAT (USA)
  • ISBN: 978-3-540-68438-1
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD 119.00
Price excludes VAT (USA)