×

zbMATH — the first resource for mathematics

Typed lambda calculi and applications. 8th international conference, TLCA 2007, Paris, France, June 26–28, 2007. Proceedings. (English) Zbl 1120.03002
Lecture Notes in Computer Science 4583. Berlin: Springer (ISBN 978-3-540-73227-3/pbk). x, 397 p. (2007).

Show indexed articles as search result.

The articles of this volume will be reviewed individually. The preceding conference has been reviewed (see Zbl 1070.03001).
Indexed articles:
Baillot, Patrick, From proof-nets to linear logic type systems for polynomial time computing, 2-7 [Zbl 1215.03070]
Abel, Andreas, Strong normalization and equi-(co)inductive types, 8-22 [Zbl 1215.03019]
Berardi, Stefano, Semantics for intuitionistic arithmetic based on Tarski games with retractable moves, 23-38 [Zbl 1215.03069]
Blum, William; Ong, C.-H. Luke, The safe lambda calculus, 39-53 [Zbl 1215.03020]
Boulmé, Sylvain, Intuitionistic refinement calculus, 54-69 [Zbl 1215.03046]
Bove, Ana; Capretta, Venanzio, Computation by prophecy, 70-83 [Zbl 1215.03047]
David, René; Nour, Karim, An arithmetical proof of the strong normalization for the \(\lambda \)-calculus with recursive equations on types, 84-101 [Zbl 1215.03022]
Cousineau, Denis; Dowek, Gilles, Embedding pure type systems in the lambda-pi-calculus modulo, 102-117 [Zbl 1215.03021]
Espírito Santo, José, Completing Herbelin’s programme, 118-132 [Zbl 1215.03023]
Espírito Santo, José; Matthes, Ralph; Pinto, Luís, Continuation-passing style and strong normalisation for intuitionistic sequent calculi, 133-147 [Zbl 1167.03012]
Faggian, Claudia; Piccolo, Mauro, Ludics is a model for the finitary linear pi-calculus, 148-162 [Zbl 1215.03071]
Fiore, Marcelo P., Differential structure in models of multiplicative biadditive intuitionistic linear logic, 163-177 [Zbl 1215.03072]
Intrigila, Benedetto; Statman, Richard, The omega rule is \(\boldsymbol\Pi_{1}^{1}\)-complete in the \(\lambda \beta \)-calculus, 178-193 [Zbl 1215.03024]
Jiang, Ying; Zhang, Guo-Qiang, Weakly distributive domains, 194-206 [Zbl 1215.06003]
Johann, Patricia; Ghani, Neil, Initial algebra semantics is enough!, 207-222 [Zbl 1215.68138]
Kiselyov, Oleg; Shan, Chung-chieh, A substructural type system for delimited continuations, 223-239 [Zbl 1215.68124]
Kuśmierek, Dariusz, The inhabitation problem for rank two intersection types, 240-254 [Zbl 1215.03025]
Lindley, Sam, Extensional rewriting with sums, 255-271 [Zbl 1215.03026]
Lipton, James; Nieva, Susana, Higher-order logic programming languages with constraints: a semantics, 272-289 [Zbl 1215.68058]
Marion, Jean-Yves, Predicative analysis of feasibility and diagonalization, 290-304 [Zbl 1215.03055]
Mazza, Damiano, Edifices and full abstraction for the symmetric interaction combinators, 305-320 [Zbl 1215.03027]
Mostrous, Dimitris; Yoshida, Nobuko, Two session typing systems for higher-order mobile processes, 321-335 [Zbl 1215.03028]
Nakazawa, Koji, An isomorphism between cut-elimination procedure and proof reduction, 336-350 [Zbl 1215.03067]
Shkaravska, Olha; van Kesteren, Ron; van Eekelen, Marko, Polynomial size analysis of first-order functions, 351-365 [Zbl 1163.68316]
Tatsuta, Makoto, Simple saturated sets for disjunction and second-order existential quantification, 366-380 [Zbl 1215.03068]
Vaux, Lionel, Convolution \(\bar\lambda\mu\)-calculus, 381-395 [Zbl 1215.03029]

MSC:
03-06 Proceedings, conferences, collections, etc. pertaining to mathematical logic and foundations
68-06 Proceedings, conferences, collections, etc. pertaining to computer science
03B40 Combinatory logic and lambda calculus
68N18 Functional programming and lambda calculus
00B25 Proceedings of conferences of miscellaneous specific interest
PDF BibTeX XML Cite
Full Text: DOI