## C.-H. Luke Ong

*Proceedings of the 10th International Conference on Typed Lambda Calculi and Applications*

TLCA, 2011.

@proceedings{TLCA-2011, address = "Novi Sad, Serbia", doi = "10.1007/978-3-642-21691-6", editor = "C.-H. Luke Ong", isbn = "978-3-642-21690-9", publisher = "{Springer International Publishing}", series = "{Lecture Notes in Computer Science}", title = "{Proceedings of the 10th International Conference on Typed Lambda Calculi and Applications}", volume = 6690, year = 2011, }

### Contents (19 items)

- TLCA-2011-Miquel #overview
- A Survey of Classical Realizability (AM), pp. 1–2.
- TLCA-2011-Tison #automaton #constraints #question #similarity #term rewriting #what
- Tree Automata, (Dis-)Equality Constraints and Term Rewriting — What’s New? (ST), pp. 3–5.
- TLCA-2011-Tiwari
- Rewriting in Practice (AT), pp. 6–8.
- TLCA-2011-Weirich #proving #source code
- Combining Proofs and Programs (SW), p. 9.
- TLCA-2011-AbelP #dependent type #higher-order #unification
- Higher-Order Dynamic Pattern Unification for Dependent Types and Records (AA, BP), pp. 10–26.
- TLCA-2011-AriolaHS #call-by
- Classical Call-by-Need and Duality (ZMA, HH, AS), pp. 27–44.
- TLCA-2011-ArndtK #formal method #modelling #type system
- Homotopy-Theoretic Models of Type Theory (PA, KK), pp. 45–60.
- TLCA-2011-BourreauS #game studies #semantics #λ-calculus
- Game Semantics and Uniqueness of Type Inhabitance in the Simply-Typed λ-Calculus (PB, SS), pp. 61–75.
- TLCA-2011-BrunelHH #algebra #deduction #orthogonal
- Orthogonality and Boolean Algebras for Deduction Modulo (AB, OH, CH), pp. 76–90.
- TLCA-2011-ClairambaultD #category theory
- The Biequivalence of Locally Cartesian Closed Categories and Martin-Löf Type Theories (PC, PD), pp. 91–106.
- TLCA-2011-Gimenez #difference #linear #logic #normalisation #proving
- Realizability Proof for Normalization of Full Differential Linear Logic (SG), pp. 107–122.
- TLCA-2011-Lasson #logic
- Controlling Program Extraction in Light Logics (ML), pp. 123–137.
- TLCA-2011-MadetA #multi #thread #λ-calculus
- An Elementary Affine λ-Calculus with Multithreading and Side Effects (AM, RMA), pp. 138–152.
- TLCA-2011-ManzonettoP #theorem #λ-calculus
- Böhm’s Theorem for Resource λ Calculus through Taylor Expansion (GM, MP), pp. 153–168.
- TLCA-2011-RehofU #combinator #finite #logic
- Finite Combinatory Logic with Intersection Types (JR, PU), pp. 169–183.
- TLCA-2011-Roversi #linear #λ-calculus
- Linear λ Calculus and Deep Inference (LR), pp. 184–197.
- TLCA-2011-SvendsenBN #dependent type
- Partiality, State and Dependent Types (KS, LB, AN), pp. 198–212.
- TLCA-2011-BakelBd #λ-calculus #μ-calculus
- A Filter Model for the λμ-Calculus — (SvB, FB, Ud), pp. 213–228.
- TLCA-2011-RoweB #approximate #object-oriented #programming #semantics
- Approximation Semantics and Expressive Predicate Assignment for Object-Oriented Programming — (RNSR, SvB), pp. 229–244.