| [1] | David Baelde. A linear approach to the proof-theory of least and greatest fixed points. PhD thesis, Ecole Polytechnique, December 2008. [ bib ] |
| [2] | David Baelde. On the expressivity of minimal generic quantification. In A. Abel and C. Urban, editors, International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP 2008), number 228 in ENTCS, pages 3--19, 2008. [ bib | DOI ] |
| [3] | David Baelde. On the expressivity of minimal generic quantification: Extended version. Technical Report inria-00284186, INRIA/HAL, 2008. [ bib | http ] |
| [4] | David Baelde and Samuel Mimram. De la webradio lambda à la λ-webradio. In Ensiie Cedric, editor, Journées Francophones des Langages Applicatifs, pages 47--61. INRIA, 2008. [ bib | .pdf ] |
| [5] | Kaustuv Chaudhuri, Dale Miller, and Alexis Saurin. Canonical sequent proofs via multi-focusing. In G. Ausiello, J. Karhumäki, G. Mauri, and L. Ong, editors, Fifth International Conference on Theoretical Computer Science, volume 273 of IFIP, pages 383--396. Springer, September 2008. [ bib | .pdf ] |
| [6] | Kaustuv Chaudhuri, Frank Pfenning, and Greg Price. A logical characterization of forward and backward chaining in the inverse method. J. of Automated Reasoning, 40(2-3):133--177, March 2008. [ bib | DOI | .pdf ] |
| [7] | Olivier Delande and Dale Miller. A neutral approach to proof and refutation in MALL. In F. Pfenning, editor, 23th Symp. on Logic in Computer Science, pages 498--508. IEEE Computer Society Press, 2008. [ bib | DOI | .pdf ] |
| [8] | Murdoch Gabbay and Stéphane Lengrand. The lambda-context calculus. In Brigitte Pientka and Carsten Schürmann, editors, Revisions from the Second International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP 2007), volume 196 of Electronic Notes in Theoretical Computer Science, pages 19--35, 2008. [ bib | DOI ] |
| [9] | Andrew Gacek, Dale Miller, and Gopalan Nadathur. Combining generic judgments with recursive definitions. In F. Pfenning, editor, 23th Symp. on Logic in Computer Science, pages 33--44. IEEE Computer Society Press, 2008. [ bib | .pdf ] |
| [10] | Andrew Gacek, Dale Miller, and Gopalan Nadathur. Reasoning in Abella about structural operational semantics specifications. In A. Abel and C. Urban, editors, International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP 2008), number 228 in ENTCS, pages 85--100, 2008. [ bib | DOI | .pdf ] |
| [11] | Kentaro Kikuchi and Stéphane Lengrand. Strong normalisation of cut-elimination that simulates β-reduction. In Roberto Amadio, editor, 11th International Conference on Foundations of Software Science and Computation Structures (FOSSACS'08), volume 4962 of LNCS, pages 380--394, Budapest, Hungary, March 2008. Springer. [ bib | .pdf ] |
| [12] | Stéphane Lengrand and Alexandre Miquel. Classical Fω, orthogonality and symmetric candidates. Annals of Pure and Applied Logic, 153(1--3):3--20, March 2008. [ bib ] |
| [13] | Dale Miller. Formalizing operational semantic specifications in logic. Concurrency Column of the Bulletin of the EATCS, October 2008. [ bib | .pdf ] |
| [14] | Dale Miller. A proof-theoretic approach to the static analysis of logic programs. In Reasoning in Simple Type Theory: Festschrift in Honor of Peter B. Andrews on His 70th Birthday, number 17 in Studies in Logic, pages 423--442. College Publications, 2008. [ bib | .pdf ] |
| [15] | Vivek Nigam. Using tables to construct non-redundant proofs. In CiE 2008: Abstracts and extended abstracts of unpublished papers, 2008. [ bib | .pdf ] |
| [16] | Vivek Nigam and Dale Miller. Focusing in linear meta-logic. In Proceedings of IJCAR: International Joint Conference on Automated Reasoning, volume 5195 of LNAI, pages 507--522. Springer, 2008. [ bib | http ] |
| [17] | Michele Pagani and Alexis Saurin. Stream associative nets and lambda-mu-calculus. Technical Report 6431, INRIA, January 2008. [ bib | http ] |
| [18] | Alexis Saurin. On the relations between the syntactic theories of λμ-calculi. In 17th EACSL Annual Conference on Computer Science Logic 2008 (CSL 2008), LNCS. Spring, September 2008. To appear. [ bib | .pdf ] |
| [19] | Alexis Saurin. Towards ludics programming: Interactive proof search. In Logic Programming, 24th International Conference, volume 5366 of LNCS, pages 253--268, December 2008. [ bib | .pdf ] |
| [20] | Alexis Saurin. Une étude logique du contrôle (appliquée à la programmation fonctionnelle et logique). PhD thesis, Ecole Polytechnique, September 2008. [ bib | http ] |
This file was generated by bibtex2html 1.98.