7. TLCA 2005:
Nara,
Japan
Pawel Urzyczyn (Ed.):
Typed Lambda Calculi and Applications, 7th International Conference, TLCA 2005, Nara, Japan, April 21-23, 2005, Proceedings.
Lecture Notes in Computer Science 3461 Springer 2005, ISBN 3-540-25593-1 BibTeX
Contributed Papers
- Andreas Abel, Thierry Coquand:
Untyped Algorithmic Equality for Martin-Löf's Logical Framework with Surjective Pairs.
23-38
Electronic Edition (link) BibTeX
- Klaus Aehlig, Jolie G. de Miranda, C.-H. Luke Ong:
The Monadic Second Order Theory of Trees Given by Arbitrary Level-Two Recursion Schemes Is Decidable.
39-54
Electronic Edition (link) BibTeX
- Patrick Baillot, Kazushige Terui:
A Feasible Algorithm for Typing in Elementary Affine Logic.
55-70
Electronic Edition (link) BibTeX
- Gilles Barthe, Benjamin Grégoire, Fernando Pastawski:
Practical Inference for Type-Based Termination in a Polymorphic Setting.
71-85
Electronic Edition (link) BibTeX
- Nick Benton, Benjamin Leperchey:
Relational Reasoning in a Nominal Semantics for Storage.
86-101
Electronic Edition (link) BibTeX
- Yves Bertot:
Filters on CoInductive Streams, an Application to Eratosthenes' Sieve.
102-115
Electronic Edition (link) BibTeX
- Ana Bove, Venanzio Capretta:
Recursive Functions with Higher Order Domains.
116-130
Electronic Edition (link) BibTeX
- Paolo Coppola, Ugo Dal Lago, Simona Ronchi Della Rocca:
Elementary Affine Logic and the Call-by-Value Lambda Calculus.
131-145
Electronic Edition (link) BibTeX
- Ferruccio Damiani:
Rank-2 Intersection and Polymorphic Recursion.
146-161
Electronic Edition (link) BibTeX
- René David, Karim Nour:
Arithmetical Proofs of Strong Normalization Results for the Symmetric lambda-µ-Calculus.
162-178
Electronic Edition (link) BibTeX
- Roberto Di Cosmo, François Pottier, Didier Rémy:
Subtyping Recursive Types Modulo Associative Commutative Products.
179-193
Electronic Edition (link) BibTeX
- Ken-etsu Fujita:
Galois Embedding from Polymorphic Types into Existential Types.
194-208
Electronic Edition (link) BibTeX
- Hugo Herbelin:
On the Degeneracy of Sigma-Types in Presence of Computational Classical Logic.
209-220
Electronic Edition (link) BibTeX
- Olivier Hermant:
Semantic Cut Elimination in the Intuitionistic Sequent Calculus.
221-233
Electronic Edition (link) BibTeX
- James Laird:
The Elimination of Nesting in SPCF.
234-245
Electronic Edition (link) BibTeX
- François Lamarche, Lutz Straßburger:
Naming Proofs in Classical Propositional Logic.
246-261
Electronic Edition (link) BibTeX
- Sam Lindley, Ian Stark:
Reducibility and TT-Lifting for Computation Types.
262-277
Electronic Edition (link) BibTeX
- Stan Matwin, Amy P. Felty, István T. Hernádvölgyi, Venanzio Capretta:
Privacy in Data Mining Using Formal Methods.
278-292
Electronic Edition (link) BibTeX
- Greg Morrisett, Amal J. Ahmed, Matthew Fluet:
L3: A Linear Language with Locations.
293-307
Electronic Edition (link) BibTeX
- John Power, Miki Tanaka:
Binding Signatures for Generic Contexts.
308-323
Electronic Edition (link) BibTeX
- Virgile Prevosto, Sylvain Boulmé:
Proof Contexts with Late Binding.
324-338
Electronic Edition (link) BibTeX
- Carsten Schürmann, Adam Poswolsky, Jeffrey Sarnat:
The [triangle]-Calculus. Functional Programming with Higher-Order Encodings.
339-353
Electronic Edition (link) BibTeX
- Peter Selinger, Benoît Valiron:
A Lambda Calculus for Quantum Computation with Classical Control.
354-368
Electronic Edition (link) BibTeX
- Paula Severi, Fer-Jan de Vries:
Continuity and Discontinuity in Lambda Calculus.
369-385
Electronic Edition (link) BibTeX
- François-Régis Sinot:
Call-by-Name and Call-by-Value as Token-Passing Interaction Nets.
386-400
Electronic Edition (link) BibTeX
- Christian Urban, James Cheney:
Avoiding Equivariance in Alpha-Prolog.
401-416
Electronic Edition (link) BibTeX
- Damiano Zanardini:
Higher-Order Abstract Non-interference.
417-432
Electronic Edition (link) BibTeX
Copyright © Sat May 16 23:43:49 2009
by Michael Ley (ley@uni-trier.de)
