Skip to main content
  • Conference proceedings
  • © 2011

Typed Lambda Calculi and Applications

10th International Conference, TLCA 2011, Novi Sad, Serbia, June 1-3, 2011. Proceedings

Editors:

  • Fast-track conference proceedings

  • State-of-the-art research

  • Up-to-date results

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

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 2011.

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 (19 papers)

  1. Front Matter

  2. Abstracts of Invited Lectures

    1. A Survey of Classical Realizability

      • Alexandre Miquel
      Pages 1-2
    2. Rewriting in Practice

      • Ashish Tiwari
      Pages 6-8
    3. Combining Proofs and Programs

      • Stephanie Weirich
      Pages 9-9
  3. Contributed Papers

    1. Classical Call-by-Need and Duality

      • Zena M. Ariola, Hugo Herbelin, Alexis Saurin
      Pages 27-44
    2. Homotopy-Theoretic Models of Type Theory

      • Peter Arndt, Krzysztof Kapulkin
      Pages 45-60
    3. Orthogonality and Boolean Algebras for Deduction Modulo

      • Aloïs Brunel, Olivier Hermant, Clément Houtmann
      Pages 76-90
    4. An Elementary Affine λ-Calculus with Multithreading and Side Effects

      • Antoine Madet, Roberto M. Amadio
      Pages 138-152
    5. Finite Combinatory Logic with Intersection Types

      • Jakob Rehof, PaweÅ‚ Urzyczyn
      Pages 169-183
    6. Linear Lambda Calculus and Deep Inference

      • Luca Roversi
      Pages 184-197
    7. Partiality, State and Dependent Types

      • Kasper Svendsen, Lars Birkedal, Aleksandar Nanevski
      Pages 198-212
    8. A Filter Model for the λμ-Calculus

      • Steffen van Bakel, Franco Barbanera, Ugo de’Liguoro
      Pages 213-228

Other Volumes

  1. Typed Lambda Calculi and Applications

About this book

This book constitutes the refereed proceedings of the 10th International Conference on Typed Lambda Calculi and Applications, TLCA 2011, held in Novi Sad, Serbia, in June 2011 as part of RDP 2011, the 6th Federated Conference on Rewriting, Deduction, and Programming. The 15 revised full papers presented were carefully reviewed and selected from 44 submissions. The papers provide prevailing research results on all current aspects of typed lambda calculi, ranging from theoretical and methodological issues to applications in various contexts addressing a wide variety of topics such as proof-theory, semantics, implementation, types, and programming.

Keywords

  • classical logic
  • deduction systems
  • dependent types
  • duality of computation
  • proof nets

Editors and Affiliations

  • Computing Laboratory, Oxford University, Oxford, UK

    Luke Ong

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