Typed Lambda Calculi and Applications: 8th International Conference, TLCA 2007, Paris, France, June 26-28, 2007, Proceedings | SpringerLink
Skip to main content
Springer Nature Link
Log in

Typed Lambda Calculi and Applications

8th International Conference, TLCA 2007, Paris, France, June 26-28, 2007, Proceedings

  • Conference proceedings
  • © 2007

Overview

Editors:
  1. Simona Ronchi Rocca
    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 4583)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: TLCA 2007.

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
¥17,985 /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 JPY 5719
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book JPY 7149
Price includes VAT (Japan)
  • 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 (27 papers)

  1. Front Matter

    Download chapter PDF

  2. On a Logical Foundation for Explicit Substitutions

    • Frank Pfenning
    Pages 1-1

  3. From Proof-Nets to Linear Logic Type Systems for Polynomial Time Computing

    • Patrick Baillot
    Pages 2-7

  4. Strong Normalization and Equi-(Co)Inductive Types

    • Andreas Abel
    Pages 8-22

  5. Semantics for Intuitionistic Arithmetic Based on Tarski Games with Retractable Moves

    • Stefano Berardi
    Pages 23-38

  6. The Safe Lambda Calculus

    • William Blum, C. -H. Luke Ong
    Pages 39-53

  7. Intuitionistic Refinement Calculus

    • Sylvain Boulmé
    Pages 54-69

  8. Computation by Prophecy

    • Ana Bove, Venanzio Capretta
    Pages 70-83

  9. An Arithmetical Proof of the Strong Normalization for the λ-Calculus with Recursive Equations on Types

    • René David, Karim Nour
    Pages 84-101

  10. Embedding Pure Type Systems in the Lambda-Pi-Calculus Modulo

    • Denis Cousineau, Gilles Dowek
    Pages 102-117

  11. Completing Herbelin’s Programme

    • José Espírito Santo
    Pages 118-132

  12. Continuation-Passing Style and Strong Normalisation for Intuitionistic Sequent Calculi

    • José Espírito Santo, Ralph Matthes, Luís Pinto
    Pages 133-147

  13. Ludics is a Model for the Finitary Linear Pi-Calculus

    • Claudia Faggian, Mauro Piccolo
    Pages 148-162

  14. Differential Structure in Models of Multiplicative Biadditive Intuitionistic Linear Logic

    • Marcelo P. Fiore
    Pages 163-177

  15. The Omega Rule is \(\mathbf{\Pi_{1}^{1}}\)-Complete in the λβ-Calculus

    • Benedetto Intrigila, Richard Statman
    Pages 178-193

  16. Weakly Distributive Domains

    • Ying Jiang, Guo-Qiang Zhang
    Pages 194-206

  17. Initial Algebra Semantics Is Enough!

    • Patricia Johann, Neil Ghani
    Pages 207-222

  18. A Substructural Type System for Delimited Continuations

    • Oleg Kiselyov, Chung-chieh Shan
    Pages 223-239

  19. The Inhabitation Problem for Rank Two Intersection Types

    • Dariusz Kuśmierek
    Pages 240-254

  20. Extensional Rewriting with Sums

    • Sam Lindley
    Pages 255-271
Back to top

Other volumes

  1. Typed Lambda Calculi and Applications

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation