Papers in 2009

[1] David Baelde. On the proof theory of regular fixed points. In Martin Giese and Arild Waller, editors, TABLEAUX 09: Automated Reasoning with Analytic Tableaux and Related Methods, number 5607 in LNAI, pages 93-107, 2009. [ bib | .pdf ]
[2] Kai Brünnler and Lutz Straßburger. Modular sequent systems for modal logic. In Martin Giese and Arild Waller, editors, TABLEAUX 09: Automated Reasoning with Analytic Tableaux and Related Methods, number 5607 in LNAI, pages 152-166. Springer, 2009. [ bib | DOI | .pdf ]
[3] Kaustuv Chaudhuri and Joëlle Despeyroux. A hybrid linear logic for constrained transition systems with applications to molecular biology. Research Report inria-00402942, INRIA-HAL, 2009. [ bib | http ]
[4] Agata Ciabattoni, Lutz Straßburger, and Kazushige Terui. Expanding the realm of systematic proof theory. In Erich Grädel and Reinhard Kahle, editors, Computer Science Logic, CSL'09, volume 5771 of Lecture Notes in Computer Science, pages 163-178. Springer, 2009. [ bib | DOI ]
[5] Olivier Delande. Symmetric Dialogue Games in the Proof Theory of Linear Logic. PhD thesis, Ecole Polytechnique, October 2009. [ bib | http ]
[6] Murdoch Gabbay and Stéphane Lengrand. The lambda-context calculus. Information and Computation, 207(12):1369-1400, 2009. [ bib ]
[7] Anders Starcke Henriksen. Using LJF as a Framework for Proof Systems. Technical Report, University of Copenhagen, 2009. [ bib | http ]
[8] Stefan Hetzl. On the form of witness terms. Draft manuscript, 2009. [ bib ]
[9] Chuck Liang and Dale Miller. Focusing and polarization in linear, intuitionistic, and classical logics. Theoretical Computer Science, 410(46):4747-4768, 2009. [ bib | DOI ]
[10] Chuck Liang and Dale Miller. A unified sequent calculus for focused proofs. In 24th Symp. on Logic in Computer Science, pages 355-364, 2009. [ bib | .pdf ]
[11] Laurent Méhats and Lutz Straßburger. Non-crossing tree realizations of ordered degree sequences. Research Report hal-00649591, INRIA, December 2009. [ bib | http | .pdf ]
[12] Dale Miller. Formalizing operational semantic specifications in logic. In Proceedings of the 17th International Workshop on Functional and (Constraint) Logic Programming (WFLP 2008), volume 246, pages 147-165, August 2009. [ bib | DOI ]
[13] Vivek Nigam. Exploiting non-canonicity in the sequent calculus. PhD thesis, Ecole Polytechnique, September 2009. [ bib | .pdf ]
[14] Vivek Nigam and Dale Miller. Algorithmic specifications in linear logic with subexponentials. In ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP), pages 129-140, 2009. [ bib | .pdf ]
[15] Lutz Straßburger. A Kleene theorem for forest languages. In Adrian Horia Dediu, Armand-Mihai Ionescu, and Carlos Martín-Vide, editors, Language and Automata Theory and Applications, LATA'09, volume 5457 of LNCS, pages 715-727. Springer, 2009. [ bib | DOI ]
[16] Lutz Straßburger. Some observations on the proof theory of second order propositional multiplicative linear logic. In Pierre-Louis Curien, editor, Typed Lambda Calculi and Applications, TLCA'09, volume 5608 of LNCS, pages 309-324. Springer, 2009. [ bib | DOI ]

This file was generated by bibtex2html 1.97.