8. TLCA 2007:
Paris,
France
Simona Ronchi Della Rocca (Ed.):
Typed Lambda Calculi and Applications, 8th International Conference, TLCA 2007, Paris, France, June 26-28, 2007, Proceedings.
Lecture Notes in Computer Science 4583 Springer 2007, ISBN 978-3-540-73227-3 
- Frank Pfenning:
On a Logical Foundation for Explicit Substitutions.
1
- Patrick Baillot:
From Proof-Nets to Linear Logic Type Systems for Polynomial Time Computing.
2-7
- Andreas Abel:
Strong Normalization and Equi-(Co)Inductive Types.
8-22
- Stefano Berardi:
Semantics for Intuitionistic Arithmetic Based on Tarski Games with Retractable Moves.
23-38
- William Blum, C.-H. Luke Ong:
The Safe Lambda Calculus.
39-53
- Sylvain Boulmé:
Intuitionistic Refinement Calculus.
54-69
- Ana Bove, Venanzio Capretta:
Computation by Prophecy.
70-83
- René David, Karim Nour:
An Arithmetical Proof of the Strong Normalization for the lambda -Calculus with Recursive Equations on Types.
84-101
- Denis Cousineau, Gilles Dowek:
Embedding Pure Type Systems in the Lambda-Pi-Calculus Modulo.
102-117
- José Espírito Santo:
Completing Herbelin's Programme.
118-132
- José Espírito Santo, Ralph Matthes, Luis Pinto:
Continuation-Passing Style and Strong Normalisation for Intuitionistic Sequent Calculi.
133-147
- Claudia Faggian, Mauro Piccolo:
Ludics is a Model for the Finitary Linear Pi-Calculus.
148-162
- Marcelo P. Fiore:
Differential Structure in Models of Multiplicative Biadditive Intuitionistic Linear Logic.
163-177
- Benedetto Intrigila, Richard Statman:
The Omega Rule is P11-Complete in the lambdabeta -Calculus.
178-193
- Ying Jiang, Guo-Qiang Zhang:
Weakly Distributive Domains.
194-206
- Patricia Johann, Neil Ghani:
Initial Algebra Semantics Is Enough!
207-222
- Oleg Kiselyov, Chung-chieh Shan:
A Substructural Type System for Delimited Continuations.
223-239
- Dariusz Kusmierek:
The Inhabitation Problem for Rank Two Intersection Types.
240-254
- Sam Lindley:
Extensional Rewriting with Sums.
255-271
- James Lipton, Susana Nieva:
Higher-Order Logic Programming Languages with Constraints: A Semantics.
272-289
- Jean-Yves Marion:
Predicative Analysis of Feasibility and Diagonalization.
290-304
- Damiano Mazza:
Edifices and Full Abstraction for the Symmetric Interaction Combinators.
305-320
- Dimitris Mostrous, Nobuko Yoshida:
Two Session Typing Systems for Higher-Order Mobile Processes.
321-335
- Koji Nakazawa:
An Isomorphism Between Cut-Elimination Procedure and Proof Reduction.
336-350
- Olha Shkaravska, Ron van Kesteren, Marko C. J. D. van Eekelen:
Polynomial Size Analysis of First-Order Functions.
351-365
- Makoto Tatsuta:
Simple Saturated Sets for Disjunction and Second-Order Existential Quantification.
366-380
- Lionel Vaux:
Convolution [`(l)]m-Calculus.
381-395
Last update Tue Feb 14 04:11:57 2012
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
