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
• 2K. 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
• 3M. 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 ]
• 4A. 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
• 5A. 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
• 6F. 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.
• 7C. 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.
• 8C. 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
• 9D. 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
• 10L. 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
• 11A. 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

Publications of the year

Articles in International Peer-Reviewed Journals

• 12B. Accattoli.
  
  Proof nets and the call-by-value λ-calculus, in: Journal of Theoretical Computer Science (TCS), 2015. [ DOI : 10.1016/j.tcs.2015.08.006 ]
  
  https://hal.archives-ouvertes.fr/hal-01244842
• 13R. Arisaka, A. Das, L. Straßburger.
  
  On Nested Sequents for Constructive Modal Logics, in: Logical Methods in Computer Science, September 2015, vol. 11, n^o 3, pp. 1-33. [ DOI : 10.2168/LMCS-11(3:7)2015 ]
  
  https://hal.inria.fr/hal-01093143
• 14G. Edan, M. Freedman, X. Montalban, D. Miller, H. Hartung, B. Hemmer, E. Fox, F. Barkhof, S. Schippling, A. Schulze, D. Pleimes, C. Pohl, R. Sandbrink, G. Suarez, E.-M. Wicklein, L. Kappos.
  
  Long-term Impact of Early MS Treatment with Interferon Beta-1b (IFNB-1b): Clinical, MRI, Employment, and Patient-Reported Outcomes (PROs) at the 11-Year Follow-up of BENEFIT (BENEFIT 11) (P7.012), in: Neurology, June 2015, vol. 84, n^o 14 Supplement, P7.012 p.
  
  https://hal-univ-rennes1.archives-ouvertes.fr/hal-01259391
• 15L. Majumdar, P. Gorai, A. Das, S. K. Chakrabarti.
  
  Potential formation of three pyrimidine bases in interstellar regions, in: Astrophysics and Space Science, December 2015, vol. 360, 14 p. [ DOI : 10.1007/s10509-015-2567-1 ]
  
  https://hal.archives-ouvertes.fr/hal-01239142
• 16L. Straßburger, N. Novakovic.
  
  On the Power of Substitution in the Calculus of Structures, in: ACM Transactions on Computational Logic, April 2015, vol. 16, n^o 3. [ DOI : 10.1145/2701424 ]
  
  https://hal.archives-ouvertes.fr/hal-00925707

International Conferences with Proceedings

• 17B. Accattoli, P. Barenbaum, D. Mazza.
  
  A Strong Distillery, in: Programming Languages and Systems - 13th Asian Symposium, APLAS 2015, Pohang, South Korea, Lecture notes in computer science, November 2015, vol. 9458, pp. 231-250. [ DOI : 10.1007/978-3-319-26529-2_13 ]
  
  https://hal.archives-ouvertes.fr/hal-01244838
• 18B. Accattoli, C. Sacerdoti Coen.
  
  On the Relative Usefulness of Fireballs, in: 30th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2015, Kyoto, Japan, July 2015. [ DOI : 10.1109/LICS.2015.23 ]
  
  https://hal.archives-ouvertes.fr/hal-01244833
• 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
• 20A. Das, L. Straßburger.
  
  No complete linear term rewriting system for propositional logic, in: 26th International Conference on Rewriting Techniques and Applications (RTA 2015), Warsaw, Poland, June 2015. [ DOI : 10.4230/LIPIcs.RTA.2015.127 ]
  
  https://hal.inria.fr/hal-01236948
• 21S. Graham-Lengrand.
  
  Realisability semantics of abstract focussing, formalised, in: Proceedings of the First International Workshop on Focusing, Suva, Fiji, November 2015, vol. 197, 14 p. [ DOI : 10.4204/EPTCS.197.3 ]
  
  https://hal.archives-ouvertes.fr/hal-01242866
• 22D. Rouhling, M. Farooque, S. Graham-Lengrand, J.-M. Notin, A. Mahboubi.
  
  Axiomatic constraint systems for proof search modulo theories, in: 10th International Symposium on Frontiers of Combining Systems (FroCoS'15), Wroclaw, Poland, C. Lutz, S. Ranise (editors), LNAI, Springer, September 2015, vol. 9322. [ DOI : 10.1007/978-3-319-24246-0_14 ]
  
  https://hal.inria.fr/hal-01107944

Conferences without Proceedings

• 23R. Blanco, T. Libal, D. Miller.
  
  Defining the meaning of TPTP formatted proofs, in: 11th International Workshop on the Implementation of Logics, Suva, Fiji, November 2015.
  
  https://hal.inria.fr/hal-01238434
• 24R. Blanco, D. Miller.
  
  Proof Outlines as Proof Certificates: A System Description, in: First International Workshop on Focusing, Suva, Fiji, November 2015.
  
  https://hal.inria.fr/hal-01238436
• 25T. Brock-Nannestad, K. Chaudhuri.
  
  Disproving Using the Inverse Method by Iterative Refinement of Finite Approximations, in: Automated Reasoning with Analytic Tableaux and Related Methods, Wrocław, Poland, September 2015. [ DOI : 10.1007/978-3-319-24312-2_11 ]
  
  https://hal.inria.fr/hal-01222592
• 26T. Brock-Nannestad, N. Guenot.
  
  Focused Linear Logic and the λ-calculus, in: Mathematical Foundations of Programming Semantics XXXI, Nijmegen, Netherlands, June 2015. [ DOI : 10.1016/j.entcs.2015.12.008 ]
  
  https://hal.inria.fr/hal-01249220
• 27T. Brock-Nannestad, N. Guenot, D. Gustafsson.
  
  Computation in Focused Intuitionistic Logic, in: 17th International Symposium on Principles and Practice of Declarative Programming, Siena, Italy, July 2015. [ DOI : 10.1145/2790449.2790528 ]
  
  https://hal.inria.fr/hal-01249216
• 28K. Chaudhuri, G. Reis.
  
  An adequate compositional encoding of bigraph structure in linear logic with subexponentials, in: 20th International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR), Suva, Fiji, M. Davis, A. Fehnker, A. McIver, A. Voronkov (editors), Lecture Notes in Computer Science, Springer-Verlag Berlin Heidelberg, November 2015, vol. 9450, pp. 146–161. [ DOI : 10.1007/978-3-662-48899-7_11 ]
  
  https://hal.inria.fr/hal-01208362
• 29Z. Chihani, T. Libal, G. Reis.
  
  The Proof Certifier Checkers, in: Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX), Wroclaw, Poland, September 2015, vol. 9323, pp. 201-210. [ DOI : 10.1007/978-3-319-24312-2_14 ]
  
  https://hal.inria.fr/hal-01208333
• 30S. Graham-Lengrand.
  
  Slot Machines: an approach to the Strategy Challenge in SMT solving (presentation only), in: 13th International Workshop on Satisfiability Modulo Theories, San Francisco, United States, July 2015.
  
  https://hal.inria.fr/hal-01211209
• 31Q. Heath, D. Miller.
  
  A framework for proof certificates in finite state exploration, in: Proceedings of the Fourth Workshop on Proof eXchange for Theorem Proving, Berlin, Germany, August 2015. [ DOI : 10.4204/EPTCS.186.4 ]
  
  https://hal.inria.fr/hal-01240172
• 32C. Liang, D. Miller.
  
  On Subexponentials, Synthetic Connectives, and Multi-level Delimited Control, in: LPAR 20 - International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Suva, Fiji, M. Davis, A. Fehnker, A. McIver, A. Voronkov (editors), LNCS - Lecture Notes in Computer Science, Springer, November 2015, vol. 9450, pp. 297-312. [ DOI : 10.1007/978-3-662-48899-7_21 ]
  
  https://hal.inria.fr/hal-01239753
• 33T. Libal.
  
  Regular Patterns in Second-Order Unification, in: Proceedings of CADE-25 - 25th International Conference on Automated Deduction, Berlin, Germany, Berlin, Germany, August 2015. [ DOI : 10.1007/978-3-319-21401-6_38 ]
  
  https://hal.archives-ouvertes.fr/hal-01242215
• 34T. Libal.
  
  Towards Deciding Second-order Unification Problems Using Regular Tree Automata, in: 29th International Workshop on Unification, Warsaw, Poland, June 2015.
  
  https://hal.inria.fr/hal-01242233
• 35D. Miller, M. Volpe.
  
  Focused labeled proof systems for modal logic, in: 20th International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR), Suva, Fiji, November 2015.
  
  https://hal.inria.fr/hal-01213858
• 36Y. Wang, K. Chaudhuri.
  
  A Proof-theoretic Characterization of Independence in Type Theory, in: 13th International Conference on Typed Lambda Calculi and Applications (TLCA 2015), Warsaw, Poland, T. Altenkirch (editor), Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, July 2015, vol. 38, pp. 332–346. [ DOI : 10.4230/LIPIcs.TLCA.2015.332 ]
  
  https://hal.inria.fr/hal-01222743

Scientific Books (or Scientific Book chapters)

• 37D. Miller.
  
  Foundational Proof Certificates, in: All about Proofs, Proofs for All, D. Delahaye, B. W. Paleo (editors), College Publications, January 2015, vol. Mathematical Logic and Foundations, n^o 55, pp. 150-163.
  
  https://hal.inria.fr/hal-01239733

Books or Proceedings Editing

• 38I. Cervesato, K. Chaudhuri (editors)
  
  Proceedings Tenth International Workshop on Logical Frameworks and Meta Languages: Theory and Practice, July 2015. [ DOI : 10.4204/EPTCS.185 ]
  
  https://hal.inria.fr/hal-01222747

Internal Reports

• 39K. Chaudhuri, S. Marin, L. Straßburger.
  
  Focused and Synthetic Nested Sequents (Extended Technical Report), Inria, April 2016.
  
  https://hal.inria.fr/hal-01251722

Scientific Popularization

• 40K. Chaudhuri, G. Nadathur.
  
  Reasoning about Computational Systems using Abella, August 2015, Abella Tutorial.
  
  https://hal.inria.fr/hal-01222774

Other Publications

• 41K. Chaudhuri.
  
  Expressing Additives Using Multiplicatives and Subexponentials, August 2015, working paper or preprint.
  
  https://hal.inria.fr/hal-01222767
• 42D. Ilik.
  
  On the exp-log normal form of types, June 2015, working paper or preprint.
  
  https://hal.inria.fr/hal-01167162
• 43P.-A. Melliès, N. Zeilberger.
  
  A bifibrational reconstruction of Lawvere's presheaf hyperdoctrine, January 2016, working paper or preprint.
  
  https://hal.archives-ouvertes.fr/hal-01261955
• 44M. Rocchetto, L. Viganò, M. Volpe.
  
  An interpolation-based method for the verification of security protocols, December 2015, working paper or preprint.
  
  https://hal.archives-ouvertes.fr/hal-01245442
• 45L. Viganò, M. Volpe, M. Zorzi.
  
  A Branching Distributed Temporal Logic for Reasoning about Quantum State Transformations, October 2015, working paper or preprint.
  
  https://hal.archives-ouvertes.fr/hal-01213511
• 46N. Zeilberger.
  
  Linear lambda terms as invariants of rooted trivalent maps, December 2015, working paper or preprint.
  
  https://hal.archives-ouvertes.fr/hal-01247757

References in notes

• 47J. A. Robinson, A. Voronkov (editors)
  
  Handbook of Automated Reasoning, Elsevier and MIT press, 2001.
• 48S. Abramsky.
  
  Computational Interpretations of Linear Logic, in: Theoretical Computer Science, 1993, vol. 111, pp. 3–57.
• 49B. 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
• 50J.-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.
• 51D. 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
• 52N. Bjorner, M. Janota.
  
  Playing with Quantified Satisfaction, in: Proc. of the 20th Intern. Conf. on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR'15), M. Davis, A. Fehnker, A. McIver, A. Voronkov (editors), LNCS, Springer, 2015, vol. 9450. [ DOI : 10.1007/978-3-662-48899-7 ]
• 53G. 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
• 54K. 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
• 55K. 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
• 56K. 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
• 57K. 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
• 58Z. 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.
• 59Z. 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, n^o 7898, pp. 162–177.
• 60P. Crégut.
  
  An Abstract Machine for Lambda-Terms Normalization, in: LISP and Functional Programming, 1990, pp. 333–340.
  
  http://doi.acm.org/10.1145/91556.91681
• 61C. 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
• 62P. 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 ]
• 63A. 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
• 64J.-Y. Girard.
  
  Linear Logic, in: Theoretical Computer Science, 1987, vol. 50, pp. 1–102.
• 65S. 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.lix.polytechnique.fr/~lengrand/Work/Reports/TTSC09.pdf
• 66A. Guglielmi.
  
  A System of Interaction and Structure, in: ACM Trans. on Computational Logic, 2007, vol. 8, n^o 1.
• 67A. 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
• 68A. 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.
• 69C. 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. [ DOI : 10.1016/j.tcs.2009.07.041 ]
  
  http://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/tcs09.pdf
• 70C. 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. [ DOI : 10.1016/j.apal.2011.01.012 ]
• 71P. 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.
• 72R. 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
• 73R. 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.
• 74S. McLaughlin, F. Pfenning.
  
  Imogen: Focusing the Polarized Focused Inverse Method for Intuitionistic Propositional Logic, in: 15th International Conference on Logic, Programming, Artificial Intelligence and Reasoning (LPAR), I. Cervesato, H. Veith, A. Voronkov (editors), LNCS, November 2008, vol. 5330, pp. 174–181.
  
  http://www.cs.cmu.edu/~seanmcl/papers/McLaughlin-LPAR-2008.pdf
• 75D. Miller.
  
  Forum: A Multiple-Conclusion Specification Logic, in: Theoretical Computer Science, September 1996, vol. 165, n^o 1, pp. 201–232.
• 76D. Miller, G. Nadathur.
  
  Programming with Higher-Order Logic, Cambridge University Press, June 2012. [ DOI : 10.1017/CBO9781139021326 ]
• 77D. 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.
• 78D. 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
• 79R. Milner.
  
  LCF: A Way of Doing Proofs with a Machine, in: Proc. of the 8th Intern. Symp. on the Mathematical Foundations of Computer Science, J. Becvár (editor), LNCS, Springer, 1979, vol. 74, pp. 146-159.
• 80G. Munch-Maccagnoni.
  
  Focalisation and Classical Realisability, in: Proc. of the 18th Annual Conf. of the European Association for Computer Science Logic (CSL'09), E. Grädel, R. Kahle (editors), LNCS, Springer, 2009, vol. 5771, pp. 409-423. [ DOI : 10.1007/978-3-642-04027-6_30 ]
• 81F. 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.
• 82B. 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.
• 83E. P. Robinson.
  
  Proof Nets for Classical Logic, in: Journal of Logic and Computation, 2003, vol. 13, pp. 777–797.
• 84L. 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
• 85The Coq Development Team.
  
  The Coq Proof Assistant Version 8.3 Reference Manual, Inria, October 2010.
• 86A. 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
• 87N. Zeilberger.
  
  The Logical Basis of Evaluation Order and Pattern-Matching, Carnegie Mellon University, April 2009.
• 88L. M. de Moura, G. O. Passmore.
  
  The Strategy Challenge in SMT Solving, in: Automated Reasoning and Mathematics - Essays in Memory of William W. McCune, M. P. Bonacina, M. E. Stickel (editors), LNCS, Springer, 2013, vol. 7788, pp. 15–44. [ DOI : 10.1007/978-3-642-36675-8_2 ]
  
  http://dx.doi.org/10.1007/978-3-642-36675-8