Skip to main content
SpringerLink
Log in
Book cover

Typed Lambda Calculi and Applications

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

  • Conference proceedings
  • © 2011

Overview

Editors:
  1. Luke Ong

    1. Computing Laboratory, Oxford University, Oxford, UK

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

Included in the following conference series:

Conference proceedings info: TLCA 2011.

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

Access this book

Log in via an institution
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

Table of contents (19 papers)

  1. Front Matter

    Download chapter PDF

  2. Abstracts of Invited Lectures

    1. A Survey of Classical Realizability

      • Alexandre Miquel
      Pages 1-2

    2. Tree Automata, (Dis-)Equality Constraints and Term Rewriting

      • Sophie Tison
      Pages 3-5

    3. Rewriting in Practice

      • Ashish Tiwari
      Pages 6-8

    4. Combining Proofs and Programs

      • Stephanie Weirich
      Pages 9-9

  3. Contributed Papers

    1. Higher-Order Dynamic Pattern Unification for Dependent Types and Records

      • Andreas Abel, Brigitte Pientka
      Pages 10-26

    2. Classical Call-by-Need and Duality

      • Zena M. Ariola, Hugo Herbelin, Alexis Saurin
      Pages 27-44

    3. Homotopy-Theoretic Models of Type Theory

      • Peter Arndt, Krzysztof Kapulkin
      Pages 45-60

    4. Game Semantics and Uniqueness of Type Inhabitance in the Simply-Typed λ-Calculus

      • Pierre Bourreau, Sylvain Salvati
      Pages 61-75

    5. Orthogonality and Boolean Algebras for Deduction Modulo

      • Aloïs Brunel, Olivier Hermant, Clément Houtmann
      Pages 76-90

    6. The Biequivalence of Locally Cartesian Closed Categories and Martin-Löf Type Theories

      • Pierre Clairambault, Peter Dybjer
      Pages 91-106

    7. Realizability Proof for Normalization of Full Differential Linear Logic

      • Stéphane Gimenez
      Pages 107-122

    8. Controlling Program Extraction in Light Logics

      • Marc Lasson
      Pages 123-137

    9. An Elementary Affine λ-Calculus with Multithreading and Side Effects

      • Antoine Madet, Roberto M. Amadio
      Pages 138-152

    10. Böhm’s Theorem for Resource Lambda Calculus through Taylor Expansion

      • Giulio Manzonetto, Michele Pagani
      Pages 153-168

    11. Finite Combinatory Logic with Intersection Types

      • Jakob Rehof, PaweÅ‚ Urzyczyn
      Pages 169-183

    12. Linear Lambda Calculus and Deep Inference

      • Luca Roversi
      Pages 184-197

    13. Partiality, State and Dependent Types

      • Kasper Svendsen, Lars Birkedal, Aleksandar Nanevski
      Pages 198-212

    14. A Filter Model for the λμ-Calculus

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

    15. Approximation Semantics and Expressive Predicate Assignment for Object-Oriented Programming

      • Reuben Rowe, Steffen Van Bakel
      Pages 229-244
Back to top

Other volumes

  1. Typed Lambda Calculi and Applications

Keywords

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.

Editors and Affiliations

  • Computing Laboratory, Oxford University, Oxford, UK

    Luke Ong

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation