Papers in 2011

[1] Alexis Bernadet and Stéphane Lengrand. Complexity of strongly normalising λ-terms via non-idempotent intersection types. In Martin Hofmann, editor, Proceedings of the 14th international conference on Foundations of Software Science and Computation Structures (FOSSACS'11), volume 6604 of LNCS. Springer, March 2011. [ bib ]
[2] Alexis Bernadet and Stéphane Lengrand. Filter models: non-idempotent intersection types, orthogonality and polymorphism. In Marc Bezem, editor, Proceedings of the 20th Annual conference of the European Association for Computer Science Logic (CSL'11), Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl--Leibniz-Zentrum für Informatik, September 2011. [ bib ]
[3] Alexis Bernadet and Stéphane Lengrand. Filter models: non-idempotent intersection types, orthogonality and polymorphism - long version. Technical Report hal-00600070, Laboratoire d'informatique de l'école polytechnique - LIX, CNRS-Ecole Polytechnique-INRIA, June 2011. [ bib | http ]
[4] Kaustuv Chaudhuri, Nicolas Guenot, and Lutz Straßburger. The Focused Calculus of Structures. In Computer Science Logic: 20th Annual Conference of the EACSL, Leibniz International Proceedings in Informatics (LIPIcs), pages 159--173. Schloss Dagstuhl--Leibniz-Zentrum für Informatik, September 2011. [ bib | DOI | .pdf ]
[5] Mahfuza Farooque and Stéphane Lengrand. A sequent calculus with procedure calls. Technical report, Laboratoire d'informatique de l'école polytechnique - LIX, CNRS-Ecole Polytechnique-INRIA, December 2011. [ bib | http ]
[6] Andrew Gacek, Dale Miller, and Gopalan Nadathur. Nominal abstraction. Information and Computation, 209(1):48--73, 2011. [ bib | DOI | http ]
[7] Nicolas Guenot. Nested proof search as reduction in the lambda-calculus. In Proceedings of the 13th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP), pages 183--194, 2011. [ bib ]
[8] Alessio Guglielmi and Lutz Straßburger. A system of interaction and structure V: the exponentials and splitting. Mathematical Structures in Computer Science, 21(3):563--584, 2011. [ bib | DOI ]
[9] Stéphane Lengrand, Roy Dyckhoff, and James McKinna. A focused sequent calculus framework for proof search in pure type systems. Logical Methods in Computer Science, 7(1), 2011. [ bib | .pdf ]
[10] Chuck Liang and Dale Miller. A focused approach to combining logics. Annals of Pure and Applied Logic, 162(9):679--697, 2011. [ bib | DOI | .pdf ]
[11] Dale Miller. A proposal for broad spectrum proof certificates. In J.-P. Jouannaud and Z. Shao, editors, CPP: First International Conference on Certified Programs and Proofs, volume 7086 of LNCS, pages 54--69, 2011. [ bib | DOI | .pdf ]
[12] Lutz Straßburger. From deep inference to proof nets via cut elimination. J. of Logic and Computation, 21(4):589--624, August 2011. [ bib ]
[13] Lutz Straßburger. Towards a Theory of Proofs of Classical Logic. Habiliatation à diriger des recherches, Université Paris VII, 2011. [ bib ]
[14] Lutz Straßburger and Alessio Guglielmi. A system of interaction and structure IV: The exponentials and decomposition. ACM Trans. Comput. Log., 12(4):23, 2011. [ bib | DOI ]

This file was generated by bibtex2html 1.98.