Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic Scholar7. TLCA 2005: Nara, Japan
Pawel Urzyczyn:
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- Amy P. Felty:
A Tutorial Example of the Semantic Approach to Foundational Proof-Carrying Code: Abstract. 10-10
Contributed Papers
- Andreas Abel, Thierry Coquand:
Untyped Algorithmic Equality for Martin-Löf's Logical Framework with Surjective Pairs. 23-38 - 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 - Gilles Barthe, Benjamin Grégoire, Fernando Pastawski:
Practical Inference for Type-Based Termination in a Polymorphic Setting. 71-85 - Paolo Coppola, Ugo Dal Lago, Simona Ronchi Della Rocca:
Elementary Affine Logic and the Call-by-Value Lambda Calculus. 131-145 - René David, Karim Nour:
Arithmetical Proofs of Strong Normalization Results for the Symmetric lambda-µ-Calculus. 162-178 - Roberto Di Cosmo, François Pottier, Didier Rémy:
Subtyping Recursive Types Modulo Associative Commutative Products. 179-193 - Hugo Herbelin:
On the Degeneracy of Sigma-Types in Presence of Computational Classical Logic. 209-220 - Stan Matwin, Amy P. Felty, István T. Hernádvölgyi, Venanzio Capretta:
Privacy in Data Mining Using Formal Methods. 278-292 - Carsten Schürmann, Adam Poswolsky, Jeffrey Sarnat:
The [triangle]-Calculus. Functional Programming with Higher-Order Encodings. 339-353 - Peter Selinger, Benoît Valiron:
A Lambda Calculus for Quantum Computation with Classical Control. 354-368
maintained by 
at 
at 
data released under the ODC-BY 1.0 license; see also our legal information page
last updated on 2018-04-26 15:18 CEST by the dblp team