Skip to main content
SpringerLink
Log in
Book cover

Typed Lambda Calculi and Applications

11th International Conference, TLCA 2013, Eindhoven, The Netherlands, June 26-28, 2013, Proceedings

  • Conference proceedings
  • © 2013

Overview

Editors:
  1. Masahito Hasegawa

    1. Research Institute for Mathematical Sciences, Kyoto University, Kyoto, Japan

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  • Fast track conference proceedings
  • Unique visibility
  • State of the art research

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

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

Included in the following conference series:

Conference proceedings info: TLCA 2013.

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 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 72.00
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 (18 papers)

  1. Front Matter

    Download chapter PDF

  2. Type-Directed Compilation in the Wild: Haskell and Core

    1. Type-Directed Compilation in the Wild: Haskell and Core

      • Simon Peyton-Jones
      Pages 1-1

    2. Proving with Side Effects

      • Hugo Herbelin
      Pages 2-2

    3. Non-linearity as the Metric Completion of Linearity

      • Damiano Mazza
      Pages 3-14

  3. Contributed Papers

    1. System F i

      • Ki Yung Ahn, Tim Sheard, Marcelo Fiore, Andrew M. Pitts
      Pages 15-30

    2. Non-determinism, Non-termination and the Strong Normalization of System T

      • Federico Aschieri, Margherita Zorzi
      Pages 31-47

    3. Proof-Relevant Logical Relations for Name Generation

      • Nick Benton, Martin Hofmann, Vivek Nigam
      Pages 48-60

    4. Games with Sequential Backtracking and Complete Game Semantics for Subclassical Logics

      • Stefano Berardi, Makoto Tatsuta
      Pages 61-76

    5. Realizability for Peano Arithmetic with Winning Conditions in HON Games

      • Valentin Blot
      Pages 77-92

    6. The Resource Lambda Calculus Is Short-Sighted in Its Relational Model

      • Flavien Breuvart
      Pages 93-108

    7. Bounding Skeletons, Locally Scoped Terms and Exact Bounds for Linear Head Reduction

      • Pierre Clairambault
      Pages 109-124

    8. Intersection Type Matching with Subtyping

      • Boris Düdder, Moritz Martens, Jakob Rehof
      Pages 125-139

    9. A Type-Checking Algorithm for Martin-Löf Type Theory with Subtyping Based on Normalisation by Evaluation

      • Daniel Fridlender, Miguel Pagano
      Pages 140-155

    10. Small Induction Recursion

      • Peter Hancock, Conor McBride, Neil Ghani, Lorenzo Malatesta, Thorsten Altenkirch
      Pages 156-172

    11. Generalizations of Hedberg’s Theorem

      • Nicolai Kraus, Martín Escardó, Thierry Coquand, Thorsten Altenkirch
      Pages 173-188

    12. Using Models to Model-Check Recursive Schemes

      • Sylvain Salvati, Igor Walukiewicz
      Pages 189-204

    13. On Interaction, Continuations and Defunctionalization

      • Ulrich Schöpp
      Pages 205-220

    14. Completeness of Conversion between Reactive Programs for Ultrametric Models

      • Paula Severi, Fer-Jan de Vries
      Pages 221-235

    15. A Constructive Model of Uniform Continuity

      • Chuangjie Xu, Martín Escardó
      Pages 236-249

  4. Back Matter

    Download chapter PDF
Back to top

Other volumes

  1. Typed Lambda Calculi and Applications

Keywords

About this book

This book constitutes the refereed proceedings of the 11th International Conference on Typed Lambda Calculi and Applications, TLCA 2013, held in Eindhoven, The Netherlands, in June 2013 as part of RDP 2013, the 7th Federated Conference on Rewriting, Deduction, and Programming, together with the 24th International Conference on Rewriting Techniques and Applications, RTA 2013, and several related events.
The 15 revised full papers presented were carefully reviewed and selected from 41 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

  • Research Institute for Mathematical Sciences, Kyoto University, Kyoto, Japan

    Masahito Hasegawa

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation