Skip to main content
  • Conference proceedings
  • © 2007

Typed Lambda Calculi and Applications

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

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)

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

Conference proceedings info: TLCA 2007.

Buying options

eBook USD 39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

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

Table of contents (27 papers)

  1. Front Matter

  2. The Safe Lambda Calculus

    • William Blum, C. -H. Luke Ong
    Pages 39-53
  3. Intuitionistic Refinement Calculus

    • Sylvain Boulmé
    Pages 54-69
  4. Computation by Prophecy

    • Ana Bove, Venanzio Capretta
    Pages 70-83
  5. Embedding Pure Type Systems in the Lambda-Pi-Calculus Modulo

    • Denis Cousineau, Gilles Dowek
    Pages 102-117
  6. Completing Herbelin’s Programme

    • José Espírito Santo
    Pages 118-132
  7. Continuation-Passing Style and Strong Normalisation for Intuitionistic Sequent Calculi

    • José Espírito Santo, Ralph Matthes, Luís Pinto
    Pages 133-147
  8. Ludics is a Model for the Finitary Linear Pi-Calculus

    • Claudia Faggian, Mauro Piccolo
    Pages 148-162
  9. The Omega Rule is \(\mathbf{\Pi_{1}^{1}}\)-Complete in the λβ-Calculus

    • Benedetto Intrigila, Richard Statman
    Pages 178-193
  10. Weakly Distributive Domains

    • Ying Jiang, Guo-Qiang Zhang
    Pages 194-206
  11. Initial Algebra Semantics Is Enough!

    • Patricia Johann, Neil Ghani
    Pages 207-222
  12. A Substructural Type System for Delimited Continuations

    • Oleg Kiselyov, Chung-chieh Shan
    Pages 223-239
  13. The Inhabitation Problem for Rank Two Intersection Types

    • Dariusz KuÅ›mierek
    Pages 240-254
  14. Extensional Rewriting with Sums

    • Sam Lindley
    Pages 255-271

Other Volumes

  1. Typed Lambda Calculi and Applications

Keywords

  • categorical methods
  • deduction
  • higher-order logic
  • lambda calculus
  • logic
  • logical relations
  • programming
  • programming language
  • programming theory
  • proof
  • proof theory
  • reduction
  • rewriting
  • semantics
  • sequent calculus

Bibliographic Information

Buying options

eBook USD 39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions