Bibliography

Major publications by the team in recent years

• 1D. 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, n^o 2, pp. 1-89. [ DOI : 10.6092/issn.1972-5787/4650 ]
  
  https://hal.inria.fr/hal-01102709
• 2A. 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

Publications of the year

Doctoral Dissertations and Habilitation Theses

• 3U. Gérard.
  
  Computing with relations, functions, and bindings, École Polytechnique ; Inria Saclay, October 2019.
  
  https://hal.archives-ouvertes.fr/tel-02414237

Articles in International Peer-Reviewed Journals

• 4B. Accattoli, G. Guerrieri.
  
  Abstract Machines for Open Call-by-Value, in: Science of Computer Programming, 2019, vol. 184. [ DOI : 10.1016/j.scico.2019.03.002 ]
  
  https://hal.archives-ouvertes.fr/hal-02415780
• 5T. Brock-Nannestad, D. Ilik.
  
  An Intuitionistic Formula Hierarchy Based on High-School Identities, in: Mathematical Logic Quarterly, May 2019, vol. 65, n^o 1, pp. 57-79, https://arxiv.org/abs/1601.04876. [ DOI : 10.1002/malq.201700047 ]
  
  https://hal.inria.fr/hal-01354181
• 6K. Chaudhuri, C. Olarte, E. Pimentel, J. Despeyroux.
  
  Hybrid Linear Logic, revisited, in: Mathematical Structures in Computer Science, 2019, forthcoming. [ DOI : 10.1017/S0960129518000439 ]
  
  https://hal.inria.fr/hal-01968154
• 7J. Courtiel, K. Yeats, N. Zeilberger.
  
  Connected chord diagrams and bridgeless maps, in: The Electronic Journal of Combinatorics, November 2019.
  
  https://hal.archives-ouvertes.fr/hal-01650141
• 8Q. Heath, D. Miller.
  
  A proof theory for model checking, in: Journal of Automated Reasoning, December 2019, vol. 63, n^o 4, pp. 857-885. [ DOI : 10.1007/s10817-018-9475-3 ]
  
  https://hal.inria.fr/hal-01814006
• 9R. Kuznets, L. Straßburger.
  
  Maehara-style modal nested calculi, in: Archive for Mathematical Logic, May 2019, vol. 58, n^o 3-4, pp. 359-385. [ DOI : 10.1007/s00153-018-0636-1 ]
  
  https://hal.inria.fr/hal-01942240
• 10D. Miller.
  
  Mechanized metatheory revisited, in: Journal of Automated Reasoning, October 2019, vol. 63, n^o 3, pp. 625-665. [ DOI : 10.1007/s10817-018-9483-3 ]
  
  https://hal.inria.fr/hal-01884210
• 11D. Miller.
  
  Reciprocal Influences Between Proof Theory and Logic Programming, in: Philosophy & Technology, August 2019. [ DOI : 10.1007/s13347-019-00370-x ]
  
  https://hal.inria.fr/hal-02368867
• 12L. Straßburger.
  
  Deep inference and expansion trees for second-order multiplicative linear logic, in: Mathematical Structures in Computer Science, September 2019, vol. 29, pp. 1030-1060. [ DOI : 10.1017/S0960129518000385 ]
  
  https://hal.inria.fr/hal-01942410
• 13L. Straßburger.
  
  On the decision problem for MELL, in: Theoretical Computer Science, May 2019, vol. 768, pp. 91-98. [ DOI : 10.1016/j.tcs.2019.02.022 ]
  
  https://hal.inria.fr/hal-02386746
• 14L. Straßburger.
  
  The problem of proof identity, and why computer scientists should care about Hilbert's 24th problem, in: Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, January 2019, vol. 377, n^o 2140, 20180038 p. [ DOI : 10.1098/rsta.2018.0038 ]
  
  https://hal.inria.fr/hal-02475417

International Conferences with Proceedings

• 15B. Accattoli, C. Faggian, G. Guerrieri.
  
  Factorization and Normalization, Essentially, in: APLAS 2019 - 17th Asian Symposium on Programming Languages and Systems, Bali, Indonesia, Springer, December 2019. [ DOI : 10.1007/978-3-030-34175-6_9 ]
  
  https://hal.archives-ouvertes.fr/hal-02411556
• 16M. Acclavio, L. Straßburger.
  
  On Combinatorial Proofs for Logics of Relevance and Entailment, in: WoLLIC 2019 - 26th International Workshop on Logic, Language, Information, and Computation, Utrecht, Netherlands, June 2019, pp. 1-16. [ DOI : 10.1007/978-3-662-59533-6_1 ]
  
  https://hal.inria.fr/hal-02390426
• 17M. Acclavio, L. Straßburger.
  
  On Combinatorial Proofs for Modal Logic, in: TABLEAUX 2019 - 28t International Conference on Automated Reasoning with Analytic Tableaux and Related Methods, London, United Kingdom, Springer, September 2019, pp. 223-240. [ DOI : 10.1007/978-3-030-29026-9_13 ]
  
  https://hal.inria.fr/hal-02390400
• 18R. Blanco, D. Miller, A. Momigliano.
  
  Property-Based Testing via Proof Reconstruction, in: PPDP 2019 - 21st International Symposium on Principles and Practice of Programming Languages, Porto, Portugal, ACM Press, October 2019, pp. 1-13. [ DOI : 10.1145/3354166.3354170 ]
  
  https://hal.inria.fr/hal-02368931
• 19K. Chaudhuri, M. Manighetti, D. Miller.
  
  A Proof-Theoretic Approach to Certifying Skolemization, in: CPP 2019 - 8th ACM SIGPLAN International Conference, Cascais, Portugal, ACM Press, January 2019, pp. 78-90. [ DOI : 10.1145/3293880.3294094 ]
  
  https://hal.inria.fr/hal-02368946
• 20U. Gérard, D. Miller, G. Scherer.
  
  Functional programming with $\lambda$-tree syntax, in: PPDP 2019 - 21st International Symposium on Principles and Practice of Programming Languages, Porto, Portugal, ACM Press, October 2019, pp. 1-16. [ DOI : 10.1145/3354166.3354177 ]
  
  https://hal.inria.fr/hal-02368906
• 21W. Heijltjes, D. J. D. Hughes, L. Straßburger.
  
  Proof Nets for First-Order Additive Linear Logic, in: FSCD 2019 - 4th International Conference on Formal Structures for Computation and Deduction, Dortmund, Germany, Proceedings of 4th International Conference on Formal Structures for Computation and Deduction (FSCD 2019), June 2019, vol. 131, pp. 22:1-22:22. [ DOI : 10.4230/LIPIcs.FSCD.2019.22 ]
  
  https://hal.inria.fr/hal-02386942
• 22B. Ralph, L. Straßburger.
  
  Towards a Combinatorial Proof Theory, in: TABLEAUX 2019 - 28th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods, London, United Kingdom, August 2019, pp. 259-276. [ DOI : 10.1007/978-3-030-29026-9_15 ]
  
  https://hal.inria.fr/hal-02390417
• 23L. Straßburger, W. Heijltjes, D. J. D. Hughes.
  
  Intuitionistic proofs without syntax, in: LICS 2019 - 34th Annual ACM/IEEE Symposium on Logic in Computer Science, Vancouver, Canada, IEEE, June 2019, pp. 1-13. [ DOI : 10.1109/LICS.2019.8785827 ]
  
  https://hal.inria.fr/hal-02386878

National Conferences with Proceedings

• 24S. Colin, R. Lepigre, G. Scherer.
  
  Unboxing Mutually Recursive Type Definitions in OCaml, in: JFLA 2019 - 30 èmes journées francophones des langages applicatifs, Les Rousses, France, January 2019, https://arxiv.org/abs/1811.02300.
  
  https://hal.inria.fr/hal-01929508

Conferences without Proceedings

• 25B. Accattoli.
  
  A Fresh Look at the λ-Calculus, in: FSCD 2019 - 4th International Conference on Formal Structures for Computation and Deduction, Dortmund, Germany, June 2019. [ DOI : 10.4230/LIPIcs.FSCD.2019.1 ]
  
  https://hal.archives-ouvertes.fr/hal-02415786
• 26B. Accattoli, A. Condoluci, G. Guerrieri, C. S. Coen.
  
  Crumbling Abstract Machines, in: PPDP 2019 - 21st International Symposium on Principles and Practice of Programming Languages, Porto, Portugal, October 2019. [ DOI : 10.1145/3354166.3354169 ]
  
  https://hal.archives-ouvertes.fr/hal-02415766
• 27B. Accattoli, G. Guerrieri, M. Leberle.
  
  Types by Need, in: ESOP 2019 - 28th European Symposium on Programming, Prague, Czech Republic, April 2019. [ DOI : 10.1007/978-3-030-17184-1_15 ]
  
  https://hal.archives-ouvertes.fr/hal-02415758
• 28A. Condoluci, B. Accattoli, C. S. Coen.
  
  Sharing Equality is Linear, in: PPDP 2019 - 21st International Symposium on Principles and Practice of Programming Languages, Porto, Portugal, October 2019. [ DOI : 10.1145/3354166.3354174 ]
  
  https://hal.archives-ouvertes.fr/hal-02415769

Books or Proceedings Editing

• 29B. Accattoli, C. Olarte (editors)
  
  Preface, The proceedings of LSFA 2018, the 13th Workshop on Logical and Semantic Frameworks with Applications (LSFA’18), Elsevier, August 2019, vol. 344, pp. 1-2. [ DOI : 10.1016/j.entcs.2019.07.001 ]
  
  https://hal.archives-ouvertes.fr/hal-02415802

Other Publications

• 30S. Marin, M. Morales, L. Straßburger.
  
  A fully labelled proof system for intuitionistic modal logics, September 2019, working paper or preprint.
  
  https://hal.inria.fr/hal-02390454
• 31A. A. Tubella, L. Straßburger.
  
  Introduction to Deep Inference, August 2019, Lecture.
  
  https://hal.inria.fr/hal-02390267

References in notes

• 32S. Abramsky.
  
  Computational Interpretations of Linear Logic, in: Theoretical Computer Science, 1993, vol. 111, pp. 3–57.
• 33B. Accattoli, U. Dal Lago.
  
  Beta reduction is invariant, indeed, 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), CSL-LICS '14, Vienna, Austria, July 14 - 18, 2014, 2014, pp. 8:1–8:10.
  
  http://doi.acm.org/10.1145/2603088.2603105
• 34J.-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.
• 35D. 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, n^o 6173, pp. 278–292. [ DOI : 10.1007/978-3-642-14203-1 ]
  
  http://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/ijcar10.pdf
• 36G. E. Blelloch, J. Greiner.
  
  Parallelism in Sequential Functional Languages, in: Proceedings of the seventh international conference on Functional programming languages and computer architecture, FPCA 1995, La Jolla, California, USA, June 25-28, 1995, 1995, pp. 226–237.
  
  http://doi.acm.org/10.1145/224164.224210
• 37K. 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
• 38K. 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
• 39K. 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
• 40A. 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
• 41A. 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
• 42J.-Y. Girard.
  
  Linear Logic, in: Theoretical Computer Science, 1987, vol. 50, pp. 1–102.
• 43S. 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, n^o 1.
  
  http://www.csl.sri.com/users/sgl/Work/Reports/TTSC09.pdf
• 44A. Guglielmi.
  
  A System of Interaction and Structure, in: ACM Trans. on Computational Logic, 2007, vol. 8, n^o 1.
• 45A. 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
• 46A. 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.
• 47D. Hughes.
  
  Proofs Without Syntax, in: Annals of Mathematics, 2006, vol. 164, n^o 3, pp. 1065–1076.
• 48F. Lamarche, L. Straßburger.
  
  Naming Proofs in Classical Propositional Logic, in: Typed Lambda Calculi and Applications, TLCA 2005, P. Urzyczyn (editor), LNCS, Springer, 2005, vol. 3461, pp. 246–261.
• 49C. 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.
  
  http://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/tcs09.pdf
• 50C. Liang, D. Miller.
  
  A Focused Approach to Combining Logics, in: Annals of Pure and Applied Logic, 2011, vol. 162, n^o 9, pp. 679–697.
  
  http://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/lku.pdf
• 51P. 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.
• 52R. 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
• 53R. 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.
• 54D. Miller.
  
  Forum: A Multiple-Conclusion Specification Logic, in: Theoretical Computer Science, September 1996, vol. 165, n^o 1, pp. 201–232.
• 55D. 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.
• 56D. 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
• 57F. 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.
• 58B. 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.
• 59E. P. Robinson.
  
  Proof Nets for Classical Logic, in: Journal of Logic and Computation, 2003, vol. 13, pp. 777–797.
• 60The Coq Development Team.
  
  The Coq Proof Assistant Version 8.3 Reference Manual, Inria, October 2010.
• 61A. Tiu, D. Miller.
  
  Proof Search Specifications of Bisimulation and Modal Logics for the $\pi$-calculus, in: ACM Trans. on Computational Logic, 2010, vol. 11, n^o 2.
  
  http://arxiv.org/abs/0805.2785