| [1] | M. J. Gabbay and J. Cheney. A sequent calculus for nominal logic. In 19uth Symp. on Logic in Computer Science, pages 139--148, 2004. [ bib | .pdf ] |
| [2] | Dale Miller. Bindings, mobility of bindings, and the -quantifier. In Jerzy Marcinkowski and Andrzej Tarlecki, editors, 18th International Conference on Computer Science Logic (CSL) 2004, volume 3210 of LNCS, page 24, 2004. [ bib | .pdf ] |
| [3] | Dale Miller. Overview of linear logic programming. In Thomas Ehrhard, Jean-Yves Girard, Paul Ruet, and Phil Scott, editors, Linear Logic in Computer Science, volume 316 of London Mathematical Society Lecture Note, pages 119--150. Cambridge University Press, 2004. [ bib | .dvi | .ps | .pdf ] |
| [4] | Dale Miller and Elaine Pimentel. Linear logic as a framework for specifying sequent calculus. In Jan van Eijck, Vincent van Oostrom, and Albert Visser, editors, Logic Colloquium '99: Proceedings of the Annual European Summer Meeting of the Association for Symbolic Logic, Lecture Notes in Logic, pages 111--135. A K Peters Ltd, 2004. [ bib | .dvi | .ps | .pdf ] |
| [5] | Alwen Tiu. Level 0/1 Prover: A tutorial, September 2004. Available online. [ bib ] |
| [6] | Alwen Tiu. A Logical Framework for Reasoning about Logical Specifications. PhD thesis, Pennsylvania State University, May 2004. [ bib | http | .pdf ] |
| [7] | Axelle Ziegler. Un format pour que la bisimulation soit une congruence dans les langages de processus avec mobilité. Technical report, INRIA Futurs, LIX and ENS, 2004. [ bib | .pdf ] |
This file was generated by bibtex2html 1.98.