Team Parsifal

Members
Overall Objectives
Scientific Foundations
Application Domains
Software
New Results
Other Grants and Activities
Dissemination
Bibliography

Bibliography

Major publications by the team in recent years

[1]
J. Despeyroux, P. Leleu.
Recursion over Objects of Functional Type, in: Special issue of MSCS on `Modalities in Type Theory', August 2001, vol. 11, no 4.
[2]
J. Despeyroux, F. Pfenning, C. Schürmann.
Primitive Recursion for Higher-Order Abstract Syntax, in: Theoretical Computer Science (TCS), September 2001, vol. 266, no 1-2, p. 1–57.
[3]
R. Dyckhoff, S. Lengrand.
Call-by-Value $ \lambda$ -calculus and LJQ, in: Journal of Logic and Computation, 2007, vol. 17, no 6, p. 1109–1134.
[4]
F. Lamarche, L. Straßburger.
Naming Proofs in Classical Propositional Logic, in: Typed Lambda Calculi and Applications, TLCA 2005, P. Urzyczyn (editor), LNCS, Springer-Verlag, 2005, vol. 3461, p. 246–261.
[5]
F. Lamarche, L. Straßburger.
From Proof Nets to the Free *-Autonomous Category, in: Logical Methods in Computer Science, 2006, vol. 2, no 4:3, p. 1–44
http://arxiv.org/pdf/cs.LO/0605054.
[6]
C. Liang, D. Miller.
Focusing and Polarization in Linear, Intuitionistic, and Classical Logics, Accepted to Theoretical Computer Science, 2008.
[7]
R. McDowell, D. Miller.
Reasoning with Higher-Order Abstract Syntax in a Logical Framework, in: ACM Trans. on Computational Logic, 2002, vol. 3, no 1, p. 80–136
http://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/mcdowell01.pdf.
[8]
R. McDowell, D. Miller, C. Palamidessi.
Encoding transition systems in sequent calculus, in: Theoretical Computer Science, 2003, vol. 294, no 3, p. 411–437
http://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/tcs97.pdf.
[9]
D. Miller, A. Tiu.
A proof theory for generic judgments, in: ACM Trans. on Computational Logic, October 2005, vol. 6, no 4, p. 749–783
http://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/tocl-nabla.pdf.
[10]
L. Straßburger.
On the Axiomatisation of Boolean Categories with and without Medial, in: Theory and Applications of Categories, 2007, vol. 18, no 18, p. 536–601
http://arxiv.org/abs/cs.LO/0512086.

Publications of the year

Doctoral Dissertations and Habilitation Theses

[11]
D. Baelde.
A linear approach to the proof-theory of least and greatest fixed points, Ph. D. Thesis, Ecole Polytechnique, December 2008.
[12]
A. Saurin.
Une étude logique du contrôle (appliquée à la programmation fonctionnelle et logique), Ph. D. Thesis, Ecole Polytechnique, September 2008.

Articles in Non Peer-Reviewed Journal

[13]
D. Miller.
Formalizing operational semantic specifications in logic, in: Concurrency Column of the Bulletin of the EATCS, October 2008
http://www.ru.is/faculty/luca/BEATCS/miller.pdf.

International Peer-Reviewed Conference/Proceedings

[14]
D. Baelde.
On the Expressivity of Minimal Generic Quantification, in: LFMTP 2008: International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice, A. Abel, C. Urban (editors), 2008, p. 16–31
http://hal.inria.fr/inria-00284186/en/.
[15]
K. Chaudhuri, D. Miller, A. Saurin.
Canonical Sequent Proofs via Multi-Focusing, in: Fifth IFIP International Conference on Theoretical Computer Science, G. Ausiello, J. Karhumäki, G. Mauri, L. Ong (editors), IFIP International Federation for Information Processing, Boston: Springer, September 2008, vol. 273, p. 383–396
http://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/tcs08trackb.pdf.
[16]
O. Delande, D. Miller.
A neutral approach to proof and refutation in MALL, in: 23th Symp. on Logic in Computer Science, F. Pfenning (editor), IEEE Computer Society Press, 2008, p. 498–508
http://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/lics08b.pdf.
[17]
A. Gacek, D. Miller, G. Nadathur.
Combining generic judgments with recursive definitions, in: 23th Symp. on Logic in Computer Science, F. Pfenning (editor), IEEE Computer Society Press, 2008, p. 33–44
http://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/lics08a.pdf.
[18]
A. Gacek, D. Miller, G. Nadathur.
Reasoning in Abella about Structural Operational Semantics Specifications, in: LFMTP 2008: International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice, A. Abel, C. Urban (editors), 2008, p. 75–89
http://arxiv.org/pdf/0804.3914.pdf.
[19]
K. Kikuchi, S. Lengrand.
Strong Normalisation of Cut-Elimination that Simulates $ \beta$ -Reduction, in: 11th International Conference on Foundations of Software Science and Computation Structures (FOSSACS'08), Budapest, Hungary, R. Amadio (editor), LNCS, Springer-Verlag, March 2008, vol. 4962, p. 380–394.

References in notes

[20]
S. Abramsky.
Computational Interpretations of Linear Logic, in: Theoretical Computer Science, 1993, vol. 111, p. 3–57.
[21]
E. Albert, G. Puebla, M. V. Hermenegildo.
Abstraction-Carrying Code, in: LPAR 2004: Logic for Programming, Artificial Intelligence, and Reasoning, Lecture Notes in Computer Science, Springer, 2004, vol. 3452, p. 380–397.
[22]
J.-M. Andreoli.
Logic Programming with Focusing Proofs in Linear Logic, in: Journal of Logic and Computation, 1992, vol. 2, no 3, p. 297–347.
[23]
A. W. Appel, A. P. Felty.
Lightweight Lemmas in Lambda Prolog, in: 16th International Conference on Logic Programming, MIT Press, November 1999, p. 411–425.
[24]
B. E. Aydemir, A. Bohannon, M. Fairbairn, J. N. Foster, B. C. Pierce, P. Sewell, D. Vytiniotis, G. Washburn, S. Weirich, S. Zdancewic.
Mechanized Metatheory for the Masses: The PoplMark Challenge, in: Theorem Proving in Higher Order Logics: 18th International Conference, LNCS, Springer-Verlag, 2005, p. 50–65.
[25]
D. Baelde, A. Gacek, D. Miller, G. Nadathur, A. Tiu.
The Bedwyr system for model checking over syntactic expressions, in: 21th Conference on Automated Deduction (CADE), F. Pfenning (editor), Lecture Notes in Artificial Intelligence, Springer, 2007, no 4603, p. 391–397
http://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/cade2007.pdf.
[26]
R. Blossey, L. Cardelli, A. Phillips.
A Compositional Approach to the Stochastic Dynamics of Gene Networks, in: Transactions on Computational Systems Biology, 2006, vol. IV, no 3939, p. 99–122.
[27]
O. Delande, D. Miller, A. Saurin.
Proof and refutation in MALL as a game, Submitted for publication, October 2008.
[28]
J. Despeyroux, P. Leleu.
Primitive recursion for higher-order abstract syntax with dependant types, in: Informal proceedings of the FLoC'99 IMLA Workshop on Intuitionistic Modal Logics and Applications, June 1999
http://www-sop.inria.fr/parsifal/Joelle.Despeyroux/papers/imla99.ps.
[29]
G. Gentzen.
Investigations into Logical Deductions, in: The Collected Papers of Gerhard Gentzen, Amsterdam, M. E. Szabo (editor), North-Holland, 1969, p. 68–131.
[30]
J.-Y. Girard.
Linear Logic, in: Theoretical Computer Science, 1987, vol. 50, p. 1–102.
[31]
J.-Y. Girard.
A Fixpoint Theorem in Linear Logic, An email posting to the mailing list linear@cs.stanford.edu, February 1992.
[32]
M. Gordon.
HOL: A Machine Oriented Formulation of Higher-Order Logic, Technical report, University of Cambridge, July 1985, no 68.
[33]
A. Guglielmi.
A System of Interaction and Structure, in: ACM Trans. on Computational Logic, 2007, vol. 8, no 1.
[34]
A. Guglielmi, L. Straßburger.
Non-commutativity and MELL in the Calculus of Structures, in: Computer Science Logic, CSL 2001, L. Fribourg (editor), LNCS, Springer-Verlag, 2001, vol. 2142, p. 54–68.
[35]
L. Hallnäs, P. Schroeder-Heister.
A Proof-Theoretic Approach to Logic Programming. II. Programs as definitions, in: Journal of Logic and Computation, October 1991, vol. 1, no 5, p. 635–660.
[36]
F. Lamarche, L. Straßburger.
Constructing free Boolean categories, in: Proceedings of the Twentieth Annual IEEE Symposium on Logic in Computer Science (LICS'05), 2005, p. 209–218.
[37]
S. Lengrand.
Termination of lambda-calculus with the extra Call-By-Value rule known as assoc, Technical report, LIX, 2007
http://hal.inria.fr/inria-00292029.
[38]
P. Martin-Löf.
Constructive Mathematics and Computer Programming, in: Sixth International Congress for Logic, Methodology, and Philosophy of Science, Amsterdam, North-Holland, 1982, p. 153–175.
[39]
R. McDowell.
Reasoning in a Logic with Definitions and Induction, Ph. D. Thesis, University of Pennsylvania, December 1997.
[40]
R. McDowell, D. Miller.
Cut-elimination for a logic with definitions and induction, in: Theoretical Computer Science, 2000, vol. 232, p. 91–119.
[41]
R. McDowell, D. Miller.
A Logic for Reasoning with Higher-Order Abstract Syntax, in: Proceedings, Twelfth Annual IEEE Symposium on Logic in Computer Science, Warsaw, Poland, G. Winskel (editor), IEEE Computer Society Press , July 1997, p. 434-445.
[42]
D. Miller.
Forum: A Multiple-Conclusion Specification Logic, in: Theoretical Computer Science, September 1996, vol. 165, no 1, p. 201–232.
[43]
D. Miller, G. Nadathur, F. Pfenning, A. Scedrov.
Uniform Proofs as a Foundation for Logic Programming, in: Annals of Pure and Applied Logic, 1991, vol. 51, p. 125–157.
[44]
D. Miller, A. Saurin.
A game semantics for proof search: Preliminary results, in: Proceedings of the Mathematical Foundations of Programming Semantics (MFPS05), Electr. Notes Theor. Comput. Sci, 2006, no 155, p. 543–563
http://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/mfps05.pdf.
[45]
D. Miller, A. Tiu.
A Proof Theory for Generic Judgments: An extended abstract, in: Proc. 18th IEEE Symposium on Logic in Computer Science (LICS 2003), IEEE, June 2003, p. 118-127
http://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/lics03.pdf.
[46]
A. Momigliano, A. Tiu.
Induction and Co-induction in Sequent Calculus, in: Post-proceedings of TYPES 2003, M. C. S. Berardi, F. Damiani (editors), LNCS, January 2003, no 3085, p. 293–308
http://www.lix.polytechnique.fr/Labo/Alwen.Tiu/linc.pdf.
[47]
G. C. Necula.
Proof-carrying code, in: Conference Record of the 24th Symposium on Principles of Programming Languages 97, Paris, France, ACM Press , 1997, p. 106–119.
[48]
G. C. Necula, S. P. Rahul.
Oracle-based checking of untrusted software., in: POPL, 2001, p. 142–154.
[49]
L. C. Paulson.
Isabelle: The Next 700 Theorem Provers, in: Logic and Computer Science, P. Odifreddi (editor), Academic Press, 1990, p. 361–386.
[50]
F. Pfenning, C. Schürmann.
System Description: Twelf — A Meta-Logical Framework for Deductive Systems, in: 16th Conference on Automated Deduction, Trento, H. Ganzinger (editor), LNAI, Springer, 1999, no 1632, p. 202–206.
[51]
E. Pimentel, D. Miller.
On the specification of sequent systems, in: LPAR 2005: 12th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Lecture Notes in Artificial Intelligence, 2005, no 3835, p. 352–366
http://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/lpar05.pdf.
[52]
E. P. Robinson.
Proof Nets for Classical Logic, in: Journal of Logic and Computation, 2003, vol. 13, p. 777–797.
[53]
L. Straßburger, F. Lamarche.
On Proof Nets for Multiplicative Linear Logic with Units, in: Computer Science Logic, CSL 2004, J. Marcinkowski, A. Tarlecki (editors), LNCS, Springer-Verlag, 2004, vol. 3210, p. 145–159.
[54]
L. Straßburger.
What could a Boolean category be?, in: Classical Logic and Computation 2006 (Satellite Workshop of ICALP'06), S. van Bakel (editor), 2006
http://www.lix.polytechnique.fr/~lutz/papers/medial-kurz.pdf.
[55]
A. Tiu, D. Miller.
Proof Search Specifications of Bisimulation and Modal Logic for the $ \pi$ -calculus, Submitted May 2008..
[56]
A. Tiu, G. Nadathur, D. Miller.
Mixing Finite Success and Finite Failure in an Automated Prover, in: Proceedings of ESHOL'05: Empirically Successful Automated Reasoning in Higher-Order Logics, December 2005, p. 79–98
http://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/eshol05.pdf.
[57]
A. Tiu.
A Logical Framework for Reasoning about Logical Specifications, Ph. D. Thesis, Pennsylvania State University, May 2004
http://www.lix.polytechnique.fr/Labo/Alwen.Tiu/etd.pdf.

previous
next