EN FR
EN FR
PARSIFAL - 2014
PARSIFAL - 2014
Project-Team Parsifal
Members
Overall Objectives
Research Program
Application Domains
New Software and Platforms
New Results
Partnerships and Cooperations
Dissemination
Bibliography
Project-Team Parsifal
Members
Overall Objectives
Research Program
Application Domains
New Software and Platforms
New Results
Partnerships and Cooperations
Dissemination
Bibliography


previous Previous | up Home


Bibliography

Major publications by the team in recent years
  • 1K. Chaudhuri, N. Guenot, L. Straßburger.

    The Focused Calculus of Structures, in: Computer Science Logic: 20th Annual Conference of the EACSL, Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl–Leibniz-Zentrum für Informatik, September 2011, pp. 159–173.

    http://drops.dagstuhl.de/opus/frontdoor.php?source_opus=3229
  • 2M. Farooque, S. Graham-Lengrand, A. Mahboubi.

    A bisimulation between DPLL(T) and a proof-search strategy for the focused sequent calculus, in: Proceedings of the 2013 International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP 2013), A. Momigliano, B. Pientka, R. Pollack (editors), ACM Press, September 2013. [ DOI : 10.1145/2503887.2503892 ]
  • 3A. Gacek, D. Miller, G. Nadathur.

    Nominal abstraction, in: Information and Computation, 2011, vol. 209, no 1, pp. 48–73.

    http://arxiv.org/abs/0908.1390
  • 4A. Guglielmi, T. Gundersen, L. Straßburger.

    Breaking Paths in Atomic Flows for Classical Logic, in: Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science (LICS 2010), Edinburgh, United Kingdom, July 2010, pp. 284–293. [ DOI : 10.1109/LICS.2010.12 ]

    http://www.lix.polytechnique.fr/~lutz/papers/AFII.pdf
  • 5F. 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, pp. 246–261.
  • 6C. Liang, D. Miller.

    Focusing and Polarization in Linear, Intuitionistic, and Classical Logics, in: Theoretical Computer Science, 2009, vol. 410, no 46, pp. 4747–4768.
  • 7C. Liang, D. Miller.

    A Focused Approach to Combining Logics, in: Annals of Pure and Appl. Logic, 2011, vol. 162, no 9, pp. 679–697. [ DOI : 10.1016/j.apal.2011.01.012 ]

    http://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/lku.pdf
  • 8D. Miller.

    A proposal for broad spectrum proof certificates, in: CPP: First International Conference on Certified Programs and Proofs, J.-P. Jouannaud, Z. Shao (editors), LNCS, 2011, vol. 7086, pp. 54–69.

    http://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/cpp11.pdf
  • 9L. Straßburger.

    On the Axiomatisation of Boolean Categories with and without Medial, in: Theory and Applications of Categories, 2007, vol. 18, no 18, pp. 536–601.

    http://arxiv.org/abs/cs.LO/0512086
  • 10A. Tiu, D. Miller.

    Proof Search Specifications of Bisimulation and Modal Logics for the π-calculus, in: ACM Trans. on Computational Logic, 2010, vol. 11, no 2.

    http://arxiv.org/abs/0805.2785
Publications of the year

Doctoral Dissertations and Habilitation Theses

Articles in International Peer-Reviewed Journals

  • 12A. Ascherio, K. L. Munger, R. White, K. Köchert, K. C. Simon, C. H. Polman, M. S. Freedman, H.-P. Hartung, D. H. Miller, X. Montalbán, G. Edan, F. Barkhof, D. Pleimes, E.-W. Radü, R. Sandbrink, L. Kappos, C. Pohl.

    Vitamin D as an early predictor of multiple sclerosis activity and progression, in: JAMA Neurology, February 2014, pp. 306-14.

    http://www.hal.inserm.fr/inserm-01103094
  • 13K. Chaudhuri, S. Hetzl, D. Miller.

    A Multi-Focused Proof System Isomorphic to Expansion Proofs, in: Journal of Logic and Computation, 2014.

    https://hal.inria.fr/hal-00937056
  • 14W. Heijltjes, L. Straßburger.

    Proof nets and semi-star-autonomous categories, in: Mathematical Structures in Computer Science, November 2014, pp. 1-40. [ DOI : 10.1017/S0960129514000395 ]

    https://hal.inria.fr/hal-01092253
  • 15D. Ilik, K. Nakata.

    A Direct Version of Veldman's Proof of Open Induction on Cantor Space via Delimited Control Operators, in: Leibniz International Proceedings in Informatics (LIPIcs), December 2014, pp. 288-201. [ DOI : 10.4230/LIPIcs.TYPES.2013.188 ]

    https://hal.inria.fr/hal-01092427
  • 16F. Lamarche.

    Modeling Martin Löf Type Theory in Categories, in: Journal of Applied Logic, 2014, vol. 12, no 1, pp. 28-44. [ DOI : 10.1016/j.jal.2013.08.003 ]

    https://hal.inria.fr/hal-00706562
  • 17G. J. A. Nagtegaal, C. Pohl, M. P. Wattjes, H. E. Hulst, M. S. Freedman, H.-P. Hartung, D. Miller, X. Montalbán, L. Kappos, G. Edan, D. Pleimes, K. Beckman, B. Stemper, C. H. Polman, R. Sandbrink, F. Barkhof.

    Interferon beta-1b reduces black holes in a randomised trial of clinically isolated syndrome, in: Mult Scler, January 2014, vol. 20, no 2, pp. 234-42, Trial Registration Number: NCT00544037.

    http://www.hal.inserm.fr/inserm-01103080

International Conferences with Proceedings

  • 18K. Chaudhuri.

    Undecidability of Multiplicative Subexponential Logic, in: 3rd International Workshop on Linearity, Vienna, Austria, S. Alves, I. Cervesato (editors), July 2014.

    https://hal.inria.fr/hal-00998753
  • 19K. Chaudhuri, M. Cimini, D. Miller.

    A Lightweight Formalization of the Metatheory of Bisimulation-Up-To, in: 4th ACM-SIGPLAN Conference on Certified Programs and Proofs (CPP), Mumbai, India, X. Leroy, A. Tiu (editors), ACM Proceedings, January 2015. [ DOI : 10.1145/2676724.2693170 ]

    https://hal.inria.fr/hal-01091524
  • 20K. Chaudhuri, N. Guenot.

    Equality and fixpoints in the calculus of structures, in: Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Vienna, Austria, T. A. Henzinger, D. Miller (editors), ACM-SIGPLAN, July 2014, pp. 1 - 10. [ DOI : 10.1145/2603088.2603140 ]

    https://hal.inria.fr/hal-01091570
  • 21A. Das.

    On the pigeonhole and related principles in deep inference and monotone systems, in: CSL-LICS '14 Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Vienna, Austria, July 2014, pp. 1 - 10. [ DOI : 10.1145/2603088.2603164 ]

    https://hal.inria.fr/hal-01096154
  • 22N. Guenot, L. Straßburger.

    Symmetric Normalisation for Intuitionistic Logic, in: CSL-LICS 2014, Vienna, Austria, July 2014. [ DOI : 10.1145/2603088.2603160 ]

    https://hal.inria.fr/hal-01092105
  • 23D. Ilik.

    Axioms and Decidability for Type Isomorphism in the Presence of Sums, in: CSL-LICS '14 Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Vienna, Austria, T. Henzinger, D. Miller (editors), ACM, July 2014. [ DOI : 10.1145/2603088.2603115 ]

    https://hal.inria.fr/hal-00991147
  • 24S. Marin, L. Straßburger.

    Label-free Modular Systems for Classical and Intuitionistic Modal Logics, in: Advances in Modal Logic 10, Groningen, Netherlands, August 2014.

    https://hal.inria.fr/hal-01092148
  • 25S. Mehner, D. Seidel, L. Straßburger, J. Voigtländer.

    Parametricity and Proving Free Theorems for Functional-Logic Languages, in: Principles and Practice of Declarative Programming - PPDP, Canterbury, United Kingdom, September 2014. [ DOI : 10.1145/2643135.2643147 ]

    https://hal.inria.fr/hal-01092357
  • 26O. Savary Bélanger, K. Chaudhuri.

    Automatically Deriving Schematic Theorems for Dynamic Contexts, in: Logical Frameworks and Meta-Languages: Theory and Practice, Vienna, Austria, ACM-SIGPLAN, July 2014. [ DOI : 10.1145/2631172.2631181 ]

    https://hal.inria.fr/hal-01091555
  • 27M. Southern, K. Chaudhuri.

    A Two-Level Logic Approach to Reasoning about Typed Specification Languages, in: 34th International Conference on Foundation of Software Technology and Theoretical Computer Science (FSTTCS 2014), New Delhi, India, V. Raman, S. P. Suresh (editors), Schloss Dagstuhl–Leibniz-Zentrum für Informatik, December 2014, vol. 29. [ DOI : 10.4230/LIPIcs.FSTTCS.2014.557 ]

    https://hal.inria.fr/hal-01091544

Scientific Books (or Scientific Book chapters)

  • 28R. Blute, A. Guglielmi, I. T. Ivanov, P. Panangaden, L. Straßburger.

    A Logical Basis for Quantum Evolution and Entanglement, in: Categories and Types in Logic, Language, and Physics - Essays Dedicated to Jim Lambek on the Occasion of His 90th Birthday, Springer, 2014, vol. 8222, pp. 90 - 107. [ DOI : 10.1007/978-3-642-54789-8_6 ]

    https://hal.inria.fr/hal-01092279
  • 29D. Galmiche, S. Graham-Lengrand.

    Special issue on computational logic in honour of Roy Dyckhoff. Journal of Logic and Computation, Oxford University Press, June 2014.

    https://hal.archives-ouvertes.fr/hal-01094032
  • 30T. Henzinger, D. Miller.

    Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), ACM, July 2014, pp. 1-764.

    https://hal.inria.fr/hal-01087515

Scientific Popularization

  • 31D. Baelde, K. Chaudhuri, A. Gacek, D. Miller, G. Nadathur, A. Tiu, Y. Wang.

    Abella: A System for Reasoning about Relational Specifications, in: Journal of Formalized Reasoning, 2014, vol. 7, no 2, pp. 1-89. [ DOI : 10.6092/issn.1972-5787/4650 ]

    https://hal.inria.fr/hal-01102709

Other Publications

References in notes
  • 37J. A. Robinson, A. Voronkov (editors)

    Handbook of Automated Reasoning, Elsevier and MIT press, 2001.
  • 38S. Abramsky.

    Computational Interpretations of Linear Logic, in: Theoretical Computer Science, 1993, vol. 111, pp. 3–57.
  • 39J.-M. Andreoli.

    Logic Programming with Focusing Proofs in Linear Logic, in: Journal of Logic and Computation, 1992, vol. 2, no 3, pp. 297–347.
  • 40D. Baelde, D. Miller, Z. Snow.

    Focused Inductive Theorem Proving, in: Fifth International Joint Conference on Automated Reasoning (IJCAR 2010), J. Giesl, R. Hähnle (editors), LNCS, 2010, no 6173, pp. 278–292. [ DOI : 10.1007/978-3-642-14203-1 ]

    http://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/ijcar10.pdf
  • 41R. Blute, I. Ivanov, P. Panangaden.

    Discrete quantum causal dynamics, in: International Journal of Theoretical Phsysics, 2003, vol. 42, pp. 2025–2041.
  • 42K. Chaudhuri.

    The Focused Inverse Method for Linear Logic, Carnegie Mellon University, December 2006, Technical report CMU-CS-06-162.

    http://reports-archive.adm.cs.cmu.edu/anon/2006/CMU-CS-06-162.pdf
  • 43K. Chaudhuri.

    Classical and Intuitionistic Subexponential Logics are Equally Expressive, in: 19th Annual EACSL Conference on Computer Science Logic (CSL 2010), Brno, Czech Republic, A. Dawar, H. Veith (editors), LNCS, Springer, August 2010, vol. 6247, pp. 185–199. [ DOI : 10.1007/978-3-642-15205-4_17 ]
  • 44K. Chaudhuri, N. Guenot, L. Straßburger.

    The Focused Calculus of Structures, in: Computer Science Logic: 20th Annual Conference of the EACSL, Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl–Leibniz-Zentrum für Informatik, September 2011, pp. 159–173. [ DOI : 10.4230/LIPIcs.CSL.2011.159 ]

    http://drops.dagstuhl.de/opus/volltexte/2011/3229/pdf/16.pdf
  • 45K. Chaudhuri, S. Hetzl, D. Miller.

    A Multi-Focused Proof System Isomorphic to Expansion Proofs, in: Journal of Logic and Computation, June 2014. [ DOI : 10.1093/logcom/exu030 ]

    http://hal.inria.fr/hal-00937056
  • 46Z. Chihani, D. Miller, F. Renaud.

    Checking Foundational Proof Certificates for First-Order Logic (extended abstract), in: Third International Workshop on Proof Exchange for Theorem Proving (PxTP 2013), J. C. Blanchette, J. Urban (editors), EPiC Series, EasyChair, 2013, vol. 14, pp. 58–66.
  • 47Z. Chihani, D. Miller, F. Renaud.

    Foundational proof certificates in first-order logic, in: CADE 24: Conference on Automated Deduction 2013, M. P. Bonacina (editor), Lecture Notes in Artificial Intelligence, 2013, no 7898, pp. 162–177.
  • 48J. Christiansen, D. Seidel, J. Voigtländer.

    Free Theorems for Functional Logic Programs, in: PLPV, Proceedings, ACM, 2010, pp. 39–48.
  • 49C. Dross, S. Conchon, J. Kanig, A. Paskevich.

    Reasoning with Triggers, in: 10th Intern. Worksh. on Satisfiability Modulo Theories, SMT 2012, P. Fontaine, A. Goel (editors), EPiC Series, EasyChair, June 2012, vol. 20, pp. 22–31.

    http://www.easychair.org/publications/?page=2135488790
  • 50M. Fiore, R. D. Cosmo, V. Balat.

    Remarks on isomorphisms in typed lambda calculi with empty and sum types, in: Annals of Pure and Applied Logic, 2006, vol. 141, pp. 35–50.
  • 51P. Fontaine, J.-Y. Marion, S. Merz, L. P. Nieto, A. Tiu.

    Expressiveness + Automation + Soundness: Towards Combining SMT Solvers and Interactive Proof Assistants, in: TACAS: Tools and Algorithms for the Construction and Analysis of Systems, 12th International Conference, H. Hermanns, J. Palsberg (editors), LNCS, Springer, 2006, vol. 3920, pp. 167–181. [ DOI : 10.1007/11691372_11 ]
  • 52A. 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, pp. 33–44.

    http://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/lics08a.pdf
  • 53A. Gill, J. Launchbury, S. Peyton Jones.

    A short cut to deforestation, in: FPCA, Proceedings, ACM, 1993, pp. 223–232.
  • 54J.-Y. Girard.

    Linear Logic, in: Theoretical Computer Science, 1987, vol. 50, pp. 1–102.
  • 55S. Graham-Lengrand, R. Dyckhoff, J. McKinna.

    A Focused Sequent Calculus Framework for Proof Search in Pure Type Systems, in: Logical Methods in Computer Science, 2011, vol. 7, no 1.

    http://www.lix.polytechnique.fr/~lengrand/Work/Reports/TTSC09.pdf
  • 56S. Graham-Lengrand.

    Psyche: a proof-search engine based on sequent calculus with an LCF-style architecture, in: 22nd International Conference on Automated Reasoning with Analytic Tableaux and Related Methods (Tableaux'13), Nancy, France, D. Galmiche, D. Larchey-Wendling (editors), Lecture Notes in Computer Science, Springer-Verlag, 2013, vol. 8123, pp. 149–156.

    http://hal.inria.fr/hal-00906789
  • 57A. Guglielmi.

    A System of Interaction and Structure, in: ACM Trans. on Computational Logic, 2007, vol. 8, no 1.
  • 58A. Guglielmi, T. Gundersen.

    Normalisation Control in Deep Inference Via Atomic Flows, in: Logical Methods in Computer Science, 2008, vol. 4, no 1:9, pp. 1–36.

    http://arxiv.org/abs/0709.1205
  • 59A. 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, pp. 54–68.
  • 60M. Hanus.

    Functional Logic Programming: From Theory to Curry, in: Programming Logics — Essays in Memory of Harald Ganzinger, LNCS, Springer, 2013, vol. 7797, pp. 123–168.
  • 61R. Harper, F. Honsell, G. Plotkin.

    A Framework for Defining Logics, in: 2nd Symp. on Logic in Computer Science, Ithaca, NY, June 1987, pp. 194–204.
  • 62C. Liang, D. Miller.

    Focusing and Polarization in Linear, Intuitionistic, and Classical Logics, in: Theoretical Computer Science, 2009, vol. 410, no 46, pp. 4747–4768. [ DOI : 10.1016/j.tcs.2009.07.041 ]

    http://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/tcs09.pdf
  • 63C. Liang, D. Miller.

    A Focused Approach to Combining Logics, in: Annals of Pure and Applied Logic, 2011, vol. 162, no 9, pp. 679–697. [ DOI : 10.1016/j.apal.2011.01.012 ]
  • 64P. Martin-Löf.

    Constructive Mathematics and Computer Programming, in: Sixth International Congress for Logic, Methodology, and Philosophy of Science, Amsterdam, North-Holland, 1982, pp. 153–175.
  • 65R. McDowell, D. Miller.

    Reasoning with Higher-Order Abstract Syntax in a Logical Framework, in: ACM Trans. on Computational Logic, 2002, vol. 3, no 1, pp. 80–136.

    http://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/mcdowell01.pdf
  • 66R. 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, pp. 434–445.
  • 67D. Miller.

    A Multiple-Conclusion Meta-Logic, in: 9th Symp. on Logic in Computer Science, Paris, S. Abramsky (editor), IEEE Computer Society Press, July 1994, pp. 272–281.
  • 68D. Miller.

    Forum: A Multiple-Conclusion Specification Logic, in: Theoretical Computer Science, September 1996, vol. 165, no 1, pp. 201–232.
  • 69D. Miller, G. Nadathur.

    Programming with Higher-Order Logic, Cambridge University Press, June 2012. [ DOI : 10.1017/CBO9781139021326 ]
  • 70D. 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, pp. 125–157.
  • 71D. 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, pp. 118–127.

    http://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/lics03.pdf
  • 72F. 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, pp. 202–206.
  • 73B. Pientka, J. Dunfield.

    Beluga: A Framework for Programming and Reasoning with Deductive Systems (System Description), in: Fifth International Joint Conference on Automated Reasoning, J. Giesl, R. Hähnle (editors), LNCS, 2010, no 6173, pp. 15–21.
  • 74E. P. Robinson.

    Proof Nets for Classical Logic, in: Journal of Logic and Computation, 2003, vol. 13, pp. 777–797.
  • 75L. Straßburger.

    Cut Elimination in Nested Sequents for Intuitionistic Modal Logics, in: FoSSaCS'13, F. Pfenning (editor), LNCS, Springer, 2013, vol. 7794, pp. 209–224.
  • 76The Coq Development Team.

    The Coq Proof Assistant Version 8.3 Reference Manual, Inria, October 2010.
  • 77A. Tiu, D. Miller.

    Proof Search Specifications of Bisimulation and Modal Logics for the π-calculus, in: ACM Trans. on Computational Logic, 2010, vol. 11, no 2.

    http://arxiv.org/abs/0805.2785
  • 78J. Voigtländer.

    Bidirectionalization for Free!, in: POPL, Proceedings, ACM, 2009, pp. 165–176.
  • 79P. Wadler.

    Theorems for free!, in: FPCA, Proceedings, ACM, 1989, pp. 347–359.
  • 80N. Zeilberger.

    The Logical Basis of Evaluation Order and Pattern-Matching, Carnegie Mellon University, April 2009.


previous Previous | up Home