[go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

Typed Lambda Calculi and Applications

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

  • Conference proceedings
  • © 1997

Overview

Editors:
  1. Philippe Groote
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. J. Roger Hindley
    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 1210)

Included in the following conference series:

Conference proceedings info: TLCA 1997.

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

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.

Similar content being viewed by others

Keywords

Table of contents (24 papers)

  1. Front Matter

    Download chapter PDF

  2. A λ-to-CL translation for strong normalization

    • Yohji Akama
    Pages 1-10

  3. Typed intermediate languages for shape analysis

    • Gianna Bellè, Eugenio Moggi
    Pages 11-29

  4. Minimum information code in a pure functional language with data types

    • S. Berardi, L. Boerio
    Pages 30-45

  5. Matching constraints for the Lambda Calculus of Objects

    • Viviana Bono, Michele Bugliesi
    Pages 46-62

  6. Coinductive axiomatization of recursive type equality and subtyping

    • Michael Brandt, Fritz Henglein
    Pages 63-81

  7. A simple adequate categorical model for PCF

    • Torben Braüner
    Pages 82-98

  8. Logical reconstruction of bi-domains

    • Antonio Bucciarelli
    Pages 99-111

  9. A module calculus for pure type systems

    • Judicaël Courant
    Pages 112-128

  10. An inference algorithm for strictness

    • Ferruccio Damiani, Paola Giannini
    Pages 129-146

  11. Primitive recursion for higher-order abstract syntax

    • Joëlle Despeyroux, Frank Pfenning, Carsten Schürmann
    Pages 147-163

  12. Eta-expansions in dependent type theory — The calculus of constructions

    • Neil Ghani
    Pages 164-180

  13. Proof nets, garbage, and computations

    • S. Guerrini, S. Martini, A. Masini
    Pages 181-195

  14. Recursion from cyclic sharing: Traced monoidal categories and models of cyclic lambda calculi

    • Masahito Hasegawa
    Pages 196-213

  15. Games and weak-head reduction for classical PCF

    • Hugo Herbelin
    Pages 214-230

  16. A type theoretical view of Böhm-trees

    • Toshihiko Kurata
    Pages 231-247

  17. Semantic techniques for deriving coinductive characterizations of observational equivalences for λ-calculi

    • Marina Lenisa
    Pages 248-266

  18. Schwichtenberg-style lambda definability is undecidable

    • Jan Małolepszy, Małgorzata Moczurad, Marek Zaionc
    Pages 267-283

  19. Outermost-fair rewriting

    • Femke van Raamsdonk
    Pages 284-299

  20. Pomset logic: A non-commutative extension of classical linear logic

    • Christian Retoré
    Pages 300-318
Back to top

Other volumes

  1. Typed Lambda Calculi and Applications

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation