Skip to main content
SpringerLink
Log in

Typed Lambda Calculi and Applications

6th International Conference, TLCA 2003, Valencia, Spain, June 10-12, 2003, Proceedings

  • Conference proceedings
  • © 2003

Overview

Editors:
  1. Martin Hofmann

    1. Institut für Informatik, Universität München, München, Germany

    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 2701)

Included in the following conference series:

Conference proceedings info: TLCA 2003.

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

Access this book

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Licence this eBook for your library

Institutional subscriptions

Keywords

Table of contents (21 papers)

  1. Front Matter

    Pages I-VIII
    Download chapter PDF

  2. Termination and Productivity Checking with Continuous Types

    • Andreas Abel
    Pages 1-15

  3. Derivatives of Containers

    • Michael Abbott, Thorsten Altenkirch, Neil Ghani, Conor McBride
    Pages 16-30

  4. Max-Plus Quasi-interpretations

    • Roberto M. Amadio
    Pages 31-45

  5. Inductive Types in the Calculus of Algebraic Constructions

    • Frédéric Blanqui
    Pages 46-59

  6. On Strong Normalization in the Intersection Type Discipline

    • Gérard Boudol
    Pages 60-74

  7. Relative Definability and Models of Unary PCF

    • Antonio Bucciarelli, Benjamin Leperchey, Vincent Padovani
    Pages 75-89

  8. Principal Typing in Elementary Affine Logic

    • Paolo Coppola, Simona Ronchi della Rocca
    Pages 90-104

  9. A Logical Framework with Dependently Typed Records

    • Thierry Coquand, Randy Pollack, Makoto Takeyama
    Pages 105-119

  10. A Sound and Complete CPS-Translation for λμ-Calculus

    • Ken-etsu Fujita
    Pages 120-134

  11. Abstraction Barrier-Observing Relational Parametricity

    • Jo Hannay
    Pages 135-152

  12. Encoding of the Halting Problem into the Monster Type and Applications

    • Thierry Joly
    Pages 153-166

  13. Well-Going Programs Can Be Typed

    • Stefan Kahrs
    Pages 167-179

  14. Parameterizations and Fixed-Point Operators on Control Categories

    • Yoshihiko Kakutani, Masahito Hasegawa
    Pages 180-194

  15. Functional In-Place Update with Layered Datatype Sharing

    • Michal Konečný
    Pages 195-210

  16. A Fully Abstract Bidomain Model of Unary FPC

    • Jim Laird
    Pages 211-225

  17. On a Semantic Definition of Data Independence

    • Ranko Lazić, David Nowak
    Pages 226-240

  18. Nondeterministic Light Logics and NP-Time

    • François Maurel
    Pages 241-255

  19. Polarized Proof Nets with Cycles and Fixpoints Semantics

    • Raphaël Montelatici
    Pages 256-270

  20. Observational Equivalence and Program Extraction in the Coq Proof Assistant

    • Nicolas Oury
    Pages 271-285
Back to top

Other volumes

  1. Typed Lambda Calculi and Applications

Editors and Affiliations

  • Institut für Informatik, Universität München, München, Germany

    Martin Hofmann

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation