Team Parsifal
Members
Overall Objectives
Scientific Foundations
Application Domains
Software
New Results
Other Grants and Activities
Dissemination
Bibliography
previous up next PDF XML

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. McDowell, D. Miller.
Reasoning with Higher-Order Abstract Syntax in a Logical Framework, in: ACM Transactions on Computational Logic, January 2002, vol. 3, no 1, p. 80-136
http://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/mcdowell01.pdf.
[4]
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.
[5]
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), P. Kolaitis (editor), IEEE, June 2003, p. 118-127
http://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/lics03.pdf.
[6]
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.
[7]
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.

Publications of the year

Articles in refereed journals and book chapters

[8]
R. DiCosmo, D. Miller.
Linear Logic, in: The Stanford Encyclopedia of Philosophy, E. N. Zalta (editor), 2006
http://plato.stanford.edu/archives/fall2006/entries/logic-linear/.
[9]
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/cs.LO/0605054.

Publications in Conferences and Workshops

[10]
G. T. Leavens, J.-R. Abrial, D. Batory, M. Butler, A. Coglio, K. Fisler, E. Hehner, C. Jones, D. Miller, S. Peyton-Jones, M. Sitaraman, D. R. Smith, A. Stump.
Roadmap for Enhanced Languages and Methods to Aid Verification, in: Fifth International Conference on Generative Programming and Component Engineering (GPCE), ACM, October 2006, p. 221-235.
[11]
D. Miller.
Collection analysis for Horn clause programs, in: Proceedings of PPDP 2006: 8th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, July 2006, p. 179 - 188
http://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/ppdp06.pdf.
[12]
D. Miller.
Representing and reasoning with operational semantics, in: Proceedings of IJCAR: International Joint Conference on Automated Reasoning, U. Furbach, N. Shankar (editors), LNAI, August 2006, vol. 4130, p. 4-20
http://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/ijcar06.pdf.
[13]
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.

Internal Reports

[14]
D. Baelde, A. Gacek, D. Miller, G. Nadathur, A. Tiu.
A User Guide to Bedwyr, November 2006.
[15]
L. Straßburger.
Proof Nets and the Identity of Proofs, Research Report, INRIA, 10 2006, no 6013
https://hal.inria.fr/inria-00107260.

Miscellaneous

[16]
C. Liang, D. Miller.
On focusing and polarities in linear logic and intuitionistic logic, Unpublished report, December 2006
http://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/focusli.pdf.
[17]
D. Miller.
Logic and Logic Programming: A Personal Account, Vol. 19, No. 1, February 2006
http://www.cs.kuleuven.ac.be/~dtai/projects/ALP/newsletter/feb06/nav/articles/Dale/dale.pdf, ALP Newsletter.

References in notes

[18]
J.-M. Andreoli, R. Pareschi.
Linear Objects: Logical Processes with Built-In Inheritance, in: Proceeding of the Seventh International Conference on Logic Programming, Jerusalem, May 1990.
[19]
J. Despeyroux.
A Higher-order specification of the $ \pi$ -calculus, in: Proc. of the IFIP International Conference on Theoretical Computer Science, IFIP TCS'2000, Sendai, Japan, August 17-19, 2000., August 2000.
[20]
J. Despeyroux, A. Felty, A. Hirschowitz.
Higher-order abstract syntax in Coq, in: Second International Conference on Typed Lambda Calculi and Applications, April 1995, p. 124–138.
[21]
J. Despeyroux, A. Hirschowitz.
Higher-order abstract syntax with induction in Coq, in: Fifth International Conference on Logic Programming and Automated Reasoning (LPAR), June 1994, p. 159–173.
[22]
J. Despeyroux, P. Leleu.
Metatheoretic Results for a Modal lambda-Calculus, in: Journal of Functional and Logic Programming (JFLP), January 2000, vol. 2000, no 1.
[23]
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.
[24]
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.
[25]
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.
[26]
F. Fages, P. Ruet, S. Soliman.
Phase semantics and verification of concurrent constraint programs, in: Symposium on Logic in Computer Science, V. Pratt (editor), IEEE, July 1998.
[27]
G. Gentzen.
Investigations into Logical Deductions, in: The Collected Papers of Gerhard Gentzen, Amsterdam, M. E. Szabo (editor), North-Holland Publishing Co., 1969, p. 68-131.
[28]
J.-Y. Girard.
A Fixpoint Theorem in Linear Logic, An email posting to the mailing list linear@cs.stanford.edu, February 1992.
[29]
M. Gordon.
HOL: A Machine Oriented Formulation of Higher-Order Logic, Technical report, University of Cambridge, July 1985, no 68.
[30]
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.
[31]
J. Hodas, D. Miller.
Logic Programming in a Fragment of Intuitionistic Linear Logic, in: Information and Computation, 1994, vol. 110, no 2, p. 327-365.
[32]
J. S. Hodas, N. Tamura.
lolliCop — A Linear Logic Implementation of a Lean Connection-Method Theorem Prover for First-Order Classical Logic, in: Proceedings of IJCAR: International Joint Conference on Automated Reasoning, R. Goré, A. Leitsch, T. Nipkow (editors), LNCS, 2001, no 2083, p. 670-684.
[33]
M. Hofmann.
Semantical analysis of higher-order abstract syntax, in: 14th Annual Symposium on Logic in Computer Science, IEEE Computer Society Press, 1999, p. 204-213.
[34]
A. Lisitsa.
$ \lambda$ leanTAP: Lean Deduction in $ \lambda$ Prolog, Technical report, University of Liverpool, Department of Computer Science, 2003, no ULCS-03-017.
[35]
R. McDowell.
Reasoning in a Logic with Definitions and Induction, Ph. D. Thesis, University of Pennsylvania, December 1997.
[36]
R. McDowell, D. Miller.
Cut-elimination for a logic with definitions and induction, in: Theoretical Computer Science, 2000, vol. 232, p. 91-119.
[37]
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.
[38]
D. Miller.
Forum: A Multiple-Conclusion Specification Language, in: Theoretical Computer Science, September 1996, vol. 165, no 1, p. 201–232.
[39]
D. Miller, A. Saurin.
A game semantics for proof search: Preliminary results, in: Proceedings of the Mathematical Foundations of Programming Semantics (MFPS), 2005
http://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/mfps05.pdf.
[40]
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.
[41]
A. Momigliano, A. Tiu.
Induction and Co-induction in Sequent Calculus, in: Post-proceedings of TYPES 2003, S. Berardi, M. Coppo, F. Damiani (editors), LNCS, January 2003, no 3085, p. 293 - 308
http://www.lix.polytechnique.fr/Labo/Alwen.Tiu/linc.pdf.
[42]
G. Nadathur, D. Miller.
An Overview of $ \lambda$ Prolog, in: Fifth International Logic Programming Conference, Seattle, MIT Press, August 1988, p. 810-827.
[43]
G. Nadathur, F. Pfenning.
The type system of a higher-order logic programming language, in: Types in Logic Programming, F. Pfenning (editor), MIT Press, 1992, p. 245-283.
[44]
L. C. Paulson.
Isabelle: The Next 700 Theorem Provers, in: Logic and Computer Science, P. Odifreddi (editor), Academic Press, 1990, p. 361-386.
[45]
C. Schürmann, F. Pfenning.
A Coverage Checking Algorithm for LF, in: Theorem Proving in Higher Order Logics: 16th International Conference, TPHOLs 2003, LNCS, Springer-Verlag, 2003, vol. 2758, p. 120-135.
[46]
C. Schürmann.
Automating the Meta Theory of Deductive Systems, CMU-CS-00-146, Carnegie Mellon University, October 2000.
[47]
A. Tiu, D. Miller.
A Proof Search Specification of the $ \pi$ -Calculus, in: 3rd Workshop on the Foundations of Global Ubiquitous Computing, ENTCS, September 2004, vol. 138, p. 79-101.
[48]
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.
[49]
A. Tiu.
Level 0/1 Prover: A tutorial, Available online., September 2004.
[50]
A. Tiu.
Model Checking for $ \pi$ -Calculus Using Proof Search, in: CONCUR, M. Abadi, L. de Alfaro (editors), Lecture Notes in Computer Science, Springer, 2005, vol. 3653, p. 36-50.
[51]
A. Ziegler, D. Miller, C. Palamidessi.
A congruence format for name-passing calculi, in: Proceedings of SOS 2005: Structural Operational Semantics, Lisbon, Portugal, ENTCS, Elsevier Science B.V., July 2005
http://www.lix.polytechnique.fr/parsifal/ziegler05report.pdf.

previous
next