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
2A. Gacek, D. Miller, G. Nadathur.

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

http://arxiv.org/abs/0908.1390
3A. 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
4F. 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.
5Stéphane. 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, n^o 1.

http://www.lix.polytechnique.fr/~lengrand/Work/Reports/TTSC09.pdf
6C. Liang, D. Miller.

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

A Focused Approach to Combining Logics, in: Annals of Pure and Appl. Logic, 2011, vol. 162, n^o 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, n^o 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, n^o 2.

http://arxiv.org/abs/0805.2785

Publications of the year

Doctoral Dissertations and Habilitation Theses

11I. Gazeau.

Programmation sûre en précision finie : Contrôler les erreurs et les fuites d'informations, Ecole Polytechnique X, October 2013.

http://hal.inria.fr/pastel-00913469
12N. Guenot.

Nested Deduction in Logical Foundations for Computation, Ecole Polytechnique, April 2013.

http://www.itu.dk/people/ngue/pub/thesis.pdf

Articles in International Peer-Reviewed Journals

13A. Bernadet, S. Graham-Lengrand.

Non-idempotent intersection types and strong normalisation, in: Logical Methods in Computer Science, 2013, vol. 9, n^o 4, pp. 17-42.

http://hal.inria.fr/hal-00906778
14K. Chaudhuri, S. Hetzl, D. Miller.

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

http://hal.inria.fr/hal-00937056
15S. Hetzl, L. Straßburger.

Herbrand-Confluence, in: LMCS, 2013, vol. 9, n^o 4:24, 25 p, final version, accepted for publication. [ DOI : 10.2168/LMCS-9(4:24)2013 ]

http://hal.inria.fr/hal-00925641
16C. Liang, D. Miller.

Kripke Semantics and Proof Systems for Combining Intuitionistic Logic and Classical Logic, in: Annals of Pure and Applied Logic, February 2013, vol. 164, n^o 2, pp. 86-111. [ DOI : 10.1016/j.apal.2012.09.005 ]

http://hal.inria.fr/hal-00787601
17D. Miller, E. Pimentel.

A formal framework for specifying sequent calculus proof systems, in: Theoretical Computer Science, February 2013, pp. 98-116. [ DOI : 10.1016/j.tcs.2012.12.008 ]

http://hal.inria.fr/hal-00787586

International Conferences with Proceedings

18K. Chaudhuri.

Subformula Linking as an Interaction Method, in: 4th Conference on Interactive Theorem Proving, Rennes, France, Lecture Notes in Computer Science, Springer, July 2013, vol. 7998, pp. 386-401. [ DOI : 10.1007/978-3-642-39634-2_28 ]

http://hal.inria.fr/hal-00937009
19Z. Chihani, D. Miller, F. Renaud.

Checking foundational proof certificates for first-order logic, in: PxTP - Proof Exchange for Theorem Proving, Lake Placid, United States, June 2013.

http://hal.inria.fr/hal-00906486
20Z. Chihani, D. Miller, F. Renaud.

Foundational proof certificates in first-order logic, in: CADE - 24th International Conference on Automated Deduction, Lake Placid, United States, June 2013.

http://hal.inria.fr/hal-00906485
21M. Farooque, S. Lengrand, A. Mahboubi.

A bisimulation between DPLL(T) and a proof-search strategy for the focused sequent calculus, in: LFMTP - International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice - 2013, Boston, United States, A. Momigliano, B. Pientka, R. Pollack (editors), ACM, September 2013. [ DOI : 10.1145/2503887.2503892 ]

http://hal.inria.fr/hal-00854426
22I. Gazeau, D. Miller, C. Palamidessi.

Preserving differential privacy under finite-precision semantics, in: QAPL - 11th International Workshop on Quantitative Aspects of Programming Languages and Systems, Rome, Italy, L. Bortolussi, H. Wiklicky (editors), Electronic Proceedings in Theoretical Computer Science, Open Publishing Association, 2013, vol. 117, pp. 1-18. [ DOI : 10.4204/EPTCS.117.1 ]

http://hal.inria.fr/hal-00780774
23S. 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
24C. Liang, D. Miller.

Unifying Classical and Intuitionistic Logics for Computational Control, in: Logic in computer science (LICS 2013), New Orleans, United States, O. Kupferman (editor), June 2013.

http://hal.inria.fr/hal-00906299
25L. Straßburger.

Cut Elimination in Nested Sequents for Intuitionistic Modal Logics, in: FoSSaCS 2013, Rome, Italy, F. Pfenning (editor), LNCS, Springer, March 2013, vol. 7794, pp. 209-224. [ DOI : 10.1007/978-3-642-37075-5_14 ]

http://hal.inria.fr/hal-00770678
26Y. Wang, K. Chaudhuri, A. Gacek, G. Nadathur.

Reasoning About Higher-Order Relational Specifications, in: International Symposium on Principles and Practice of Declarative Programming, Madrid, Spain, T. Schrijvers (editor), ACM, September 2013. [ DOI : 10.1145/2505879.2505889 ]

http://hal.inria.fr/hal-00787126

Scientific Books (or Scientific Book chapters)

27Proceedings of the Sixth Workshop on Intersection Types and Related Systems (ITRS'12), EPTCS, 2013, vol. 121, pp. 1–93. [ DOI : 10.4204/EPTCS.121 ]

http://hal.inria.fr/hal-00912611

Internal Reports

28K. Chaudhuri, J. Despeyroux.

A Hybrid Linear Logic for Constrained Transition Systems with Applications to Molecular Biology, October 2013, 30 p.

http://hal.inria.fr/inria-00402942
29M. Farooque.

Automated reasoning techniques as proof-search in sequent calculus, October 2013, Version of thesis at time of defense.

http://hal.inria.fr/hal-00939124
30M. Farooque, S. Graham-Lengrand.

Sequent Calculi with procedure calls, September 2013.

http://hal.inria.fr/hal-00779199

Other Publications

31F. Lamarche.

Path Functors in Cat, September 2013.

http://hal.inria.fr/hal-00831430
32D. Miller.

Communicating and trusting proofs: The case for foundational proof certificates, January 2013, To appear in the Proceedings of the 14th Congress of Logic, Methodology and Philosophy of Science in Nancy, France, 19-26 July 2011.

http://hal.inria.fr/hal-00772727
33D. Miller, A. Tiu.

Extracting Proofs from Tabled Proof Search, September 2013.

http://hal.inria.fr/hal-00863561
34L. Straßburger, N. Novakovic.

On the Power of Substitution in the Calculus of Structures, November 2013, submitted.

http://hal.inria.fr/hal-00925707

References in notes

35S. Abramsky.

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

Logic Programming with Focusing Proofs in Linear Logic, in: Journal of Logic and Computation, 1992, vol. 2, n^o 3, pp. 297–347.
37B. 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, pp. 50–65.
38K. 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
39K. Chaudhuri, S. Hetzl, D. Miller.

A Systematic Approach to Canonicity in the Classical Sequent Calculus, in: Computer Science Logic (CSL'12): 21st Annual Conference of the EACSL, P. Cégielski, A. Durand (editors), Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl–Leibniz-Zentrum für Informatik, September 2012, vol. 16, pp. 183–197.

http://drops.dagstuhl.de/opus/frontdoor.php?source_opus=3672
40K. 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, pp. 383–396.

http://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/tcs08trackb.pdf
41A. 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
42J.-Y. Girard.

Linear Logic, in: Theoretical Computer Science, 1987, vol. 50, pp. 1–102.
43A. Guglielmi.

A System of Interaction and Structure, in: ACM Trans. on Computational Logic, 2007, vol. 8, n^o 1.
44A. Guglielmi, T. Gundersen.

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

http://arxiv.org/abs/0709.1205
45A. 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.
46S. Hetzl, L. Straßburger.

Herbrand-Confluence for Cut-Elimination in Classical First-Order Logic, in: Computer Science Logic (CSL) 2012, P. Cégielski, A. Durand (editors), Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, 2012, vol. 16, pp. 320–334.
47F. Lamarche.

Modeling Martin Löf Type Theory in Categories, in: Logic, Categories, Semantics, Bordeaux, France, C. Retoré, J. Gilibert (editors), Elsevier North-Holland, 2014, vol. 12, special Issue of J. of Applied Logic. [ DOI : 10.1016/j.jal.2013.08.003 ]

http://hal.inria.fr/hal-00706562
48P. 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.
49R. McDowell, D. Miller.

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

http://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/mcdowell01.pdf
50R. 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.
51D. Miller.

Communicating and trusting proofs: The case for broad spectrum proof certificates, June 2011, Available from author's website.
52D. Miller.

Forum: A Multiple-Conclusion Specification Logic, in: Theoretical Computer Science, September 1996, vol. 165, n^o 1, pp. 201–232.
53D. 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.
54D. 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
55F. 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, n^o 1632, pp. 202–206.
56B. 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, n^o 6173, pp. 15–21.
57E. P. Robinson.

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

Extension without Cut, in: Annals of Pure and Applied Logic, 2012, vol. 163, n^o 12, pp. 1995–2007. [ DOI : 10.1016/j.apal.2012.07.004 ]

http://hal.inria.fr/hal-00759215
59The Coq Development Team.

The Coq Proof Assistant Version 8.3 Reference Manual, Inria, October 2010.
60C. Tinelli.

An Abstract Framework for Satisfiability Modulo Theories, in: Proceedings of the 16th International Conference on Tableaux methods (Tableaux'07), N. Olivetti (editor), LNCS, Springer-Verlag, 2007, vol. 4548.

http://dl.acm.org/citation.cfm?id=1420269.1420273
61A. Tiu, D. Miller.

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

http://arxiv.org/abs/0805.2785

Previous |

Home