Members
Overall Objectives
Research Program
Application Domains
Highlights of the Year
New Software and Platforms
New Results
Partnerships and Cooperations
Dissemination
Bibliography
XML PDF e-pub
PDF e-Pub


Bibliography

Major publications by the team in recent years
[1]
D. 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
[2]
K. 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
[3]
M. 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 ]
[4]
A. 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
[5]
A. 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
[6]
F. 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.
[7]
C. Liang, D. Miller.
Focusing and Polarization in Linear, Intuitionistic, and Classical Logics, in: Theoretical Computer Science, 2009, vol. 410, no 46, pp. 4747–4768.
[8]
C. 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
[9]
D. 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
[10]
L. 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
[11]
A. 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

Articles in International Peer-Reviewed Journals

[12]
B. Accattoli, U. Dal Lago.
(Leftmost-outermost) beta reduction is invariant, indeed, in: Logical Methods in Computer Science, 2016. [ DOI : 10.2168/LMCS-12(1:4)2016 ]
https://hal.inria.fr/hal-01337712
[13]
Z. Chihani, D. Miller.
Proof Certificates for Equality Reasoning, in: Electronic Notes in Theoretical Computer Science, 2016, vol. 323, pp. 93 - 108. [ DOI : 10.1016/j.entcs.2016.06.007 ]
https://hal.inria.fr/hal-01390919
[14]
Z. Chihani, D. Miller, F. Renaud.
A Semantic Framework for Proof Evidence, in: Journal of Automated Reasoning, 2016. [ DOI : 10.1007/s10817-016-9380-6 ]
https://hal.inria.fr/hal-01390912
[15]
A. Das, L. Straßburger.
On linear rewriting systems for Boolean logic and some applications to proof theory, in: Logical Methods in Computer Science, December 2016.
https://hal.inria.fr/hal-01422611
[16]
I. Gazeau, D. Miller, C. Palamidessi.
Preserving differential privacy under finite-precision semantics, in: Journal of Theoretical Computer Science (TCS), 2016.
https://hal.inria.fr/hal-01390927
[17]
W. Heijltjes, L. Straßburger.
Proof nets and semi-star-autonomous categories, in: Mathematical Structures in Computer Science, June 2016, vol. 26, no 5, pp. 789-828. [ DOI : 10.1017/S0960129514000395 ]
https://hal.inria.fr/hal-01417643
[18]
D. Miller.
Proof Checking and Logic Programming, in: Formal Aspects of Computing, 2016. [ DOI : 10.1007/s00165-016-0393-z ]
https://hal.inria.fr/hal-01390901
[19]
N. Zeilberger.
Linear lambda terms as invariants of rooted trivalent maps, in: Journal of Functional Programming, November 2016, vol. 26. [ DOI : 10.1017/S095679681600023X ]
https://hal.archives-ouvertes.fr/hal-01247757

Invited Conferences

[20]
B. Accattoli.
The Complexity of Abstract Machines, in: Third International Workshop on Rewriting Techniques for Program Transformations and Evaluation (WPTE 2016), Porto, Portugal, June 2016, vol. 235, pp. 1 - 15. [ DOI : 10.4204/EPTCS.235.1 ]
https://hal.inria.fr/hal-01425560

International Conferences with Proceedings

[21]
B. Accattoli.
The Useful MAM, a Reasonable Implementation of the Strong λ-Calculus, in: 23rd International Workshop on Logic, Language, Information, and Computation (WoLLIC 2016), Puebla, Mexico, August 2016, pp. 1 - 21. [ DOI : 10.1007/978-3-662-52921-8_1 ]
https://hal.inria.fr/hal-01425534
[22]
B. Accattoli, G. Guerrieri.
Open Call-by-Value, in: 14th Asian Symposium on Programming Languages and Systems (APLAS), Hanoi, Vietnam, November 2016, pp. 206 - 226. [ DOI : 10.1007/978-3-319-47958-3_12 ]
https://hal.inria.fr/hal-01425465
[23]
S. Azaiez, D. Doligez, M. Lemerre, T. Libal, S. Merz.
Proving Determinacy of the PharOS Real-Time Operating System, in: Abstract State Machines, Alloy, B, TLA, VDM, and Z - 5th International Conference, ABZ 2016, Linz, Austria, M. J. Butler, K.-D. Schewe, A. Mashkoor, M. Biró (editors), LNCS - Lecture Notes in Computer Science, Springer, May 2016, vol. 9675, pp. 70-85. [ DOI : 10.1007/978-3-319-33600-8_4 ]
https://hal.inria.fr/hal-01322335
[24]
T. Brock-Nannestad.
Space-efficient Planar Acyclicity Constraints - A Declarative Pearl, in: FLOPS 2016 - 13th International Symposium on Functional and Logic Programming, Kochi, Japan, March 2016.
https://hal.inria.fr/hal-01426753
[25]
K. Chaudhuri, S. Marin, L. Straßburger.
Focused and Synthetic Nested Sequents, in: FOSSACS 2016 - 19th International Conference Foundations of Software Science and Computation Structures, Eindhoven, Netherlands, B. Jacobs, C. Löding (editors), LNCS - Lecture Notes in Computer Science, Springer, April 2016, vol. 9634, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016. [ DOI : 10.1007/978-3-662-49630-5_23 ]
https://hal.inria.fr/hal-01417618
[26]
K. Chaudhuri, S. Marin, L. Straßburger.
Modular Focused Proof Systems for Intuitionistic Modal Logics, in: FSCD 2016 - 1st International Conference on Formal Structures for Computation and Deduction, Porto, Portugal, June 2016. [ DOI : 10.4230/LIPIcs.FSCD.2016.16 ]
https://hal.inria.fr/hal-01417603
[27]
D. Ilik.
On the exp-log normal form of types: Decomposing extensional equality and representing terms compactly, in: Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, Paris, France, January 2017, pp. 387-399.
https://hal.inria.fr/hal-01167162
[28]
T. Libal, D. Miller.
Functions-as-constructors Higher-order Unification, in: 1st International Conference on Formal Structures for Computation and Deduction (FSCD 2016), Porto, Portugal, Delia Kesner and Brigitte Pientka, June 2016, pp. 1 - 17. [ DOI : 10.4230/LIPIcs.FSCD.2016.26 ]
https://hal.inria.fr/hal-01379683
[29]
T. Libal, M. Volpe.
Certification of Prefixed Tableau Proofs for Modal Logic, in: the Seventh International Symposium on Games, Automata, Logics and Formal Verification (GandALF 2016), Catania, Italy, September 2016, vol. 226, pp. 257 - 271. [ DOI : 10.4204/EPTCS.226.18 ]
https://hal.archives-ouvertes.fr/hal-01379625
[30]
S. Marin, D. Miller, M. Volpe.
A focused framework for emulating modal proof systems, in: 11th conference on "Advances in Modal Logic", Budapest, Hungary, L. Beklemishev, S. Demri, A. Máté (editors), Advances in Modal Logic, College Publications, August 2016, no 11, pp. 469-488.
https://hal.archives-ouvertes.fr/hal-01379624
[31]
L. Mehats, L. Straßburger.
Non-crossing Tree Realizations of Ordered Degree Sequences, in: LACL 2016 - 9th International Conference Logical Aspects of Computational Linguistics - Celebrating 20 Years of LACL (1996–2016), Nancy, France, M. Amblard, P. de Groote, S. Pogodalla, C. Retoré (editors), LNCS - Lecture Notes in Computer Science, Springer, December 2016, vol. 10054. [ DOI : 10.1007/978-3-662-53826-5_13 ]
https://hal.inria.fr/hal-01417567

Conferences without Proceedings

[32]
T. Libal, A. Steen.
Towards a Substitution Tree Based Index for Higher-order Resolution Theorem Provers, in: 5th Workshop on Practical Aspects of Automated Reasoning, Coimbra, Portugal, Proceedings of the 5th Workshop on Practical Aspects of Automated Reasoning co-located with International Joint Conference on Automated Reasoning (IJCAR 2016), Coimbra, Portugal, July 2nd, 2016, July 2016.
https://hal.archives-ouvertes.fr/hal-01424749
[33]
P.-A. Melliès, N. Zeilberger.
A bifibrational reconstruction of Lawvere's presheaf hyperdoctrine, in: IEEE/ACM Logic in Computer Science (LICS) 2016, New York, United States, Proceedings of LICS'16, June 2016.
https://hal.archives-ouvertes.fr/hal-01261955

Internal Reports

[34]
M. P. Bonacina, S. Graham-Lengrand, N. Shankar.
A model-constructing framework for theory combination, Universita degli Studi di Verona, September 2016, no RR-99/2016.
https://hal.inria.fr/hal-01425305
[35]
K. Chaudhuri, S. Marin, L. Straßburger.
Focused and Synthetic Nested Sequents (Extended Technical Report), Inria, April 2016.
https://hal.inria.fr/hal-01251722

Other Publications

[36]
R. Blanco, Z. Chihani.
An interactive assistant for the definition of proof certificates, December 2016, working paper or preprint.
https://hal.inria.fr/hal-01422829
[37]
T. Brock-Nannestad, D. Ilik.
An Intuitionistic Formula Hierarchy Based on High-School Identities, August 2016, working paper or preprint.
https://hal.inria.fr/hal-01354181
[38]
Z. Chihani, D. Ilik, D. Miller.
Classical polarizations yield double-negation translations, August 2016, working paper or preprint.
https://hal.inria.fr/hal-01354298
[39]
D. Ilik.
Perspectives for proof unwinding by programming languages techniques, August 2016, Book chapter to appear.
https://hal.inria.fr/hal-01354180
References in notes
[40]
J. A. Robinson, A. Voronkov (editors)
Handbook of Automated Reasoning, Elsevier and MIT press, 2001.
[41]
S. Abramsky.
Computational Interpretations of Linear Logic, in: Theoretical Computer Science, 1993, vol. 111, pp. 3–57.
[42]
B. 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
[43]
J.-M. Andreoli.
Logic Programming with Focusing Proofs in Linear Logic, in: Journal of Logic and Computation, 1992, vol. 2, no 3, pp. 297–347.
[44]
A. Assaf, G. Burel, R. Cauderlier, D. Delahaye, G. Dowek, C. Dubois, F. Gilbert, P. Halmagrand, O. Hermant, R. Saillard.
Dedukti: a Logical Framework based on the λΠ-Calculus Modulo Theory, 2016, Unpublished.
http://www.lsv.ens-cachan.fr/~dowek/Publi/expressing.pdf
[45]
D. 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
[46]
G. 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
[47]
O. Bodini, D. Gardy, A. Jacquot.
Asymptotics and random sampling for BCI and BCK lambda terms, in: Theoretical Computer Science, 2013, vol. 502, pp. 227–238.
[48]
K. 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
[49]
K. 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
[50]
K. 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
[51]
Z. 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.
[52]
Z. 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.
[53]
A. 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, 26th International Conference on Rewriting Techniques and Applications (RTA 2015), June 2015. [ DOI : 10.4230/LIPIcs.RTA.2015.127 ]
https://hal.inria.fr/hal-01236948
[54]
C. 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
[55]
P. 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 ]
[56]
A. 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
[57]
H. Ganzinger, H. RueB, N. Shankar.
Modularity and Refinement in Inference Systems, SRI, 2004, no SRI-CSL-04-02.
[58]
J.-Y. Girard.
Linear Logic, in: Theoretical Computer Science, 1987, vol. 50, pp. 1–102.
[59]
S. 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
[60]
S. 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
[61]
A. Guglielmi.
A System of Interaction and Structure, in: ACM Trans. on Computational Logic, 2007, vol. 8, no 1.
[62]
A. 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
[63]
A. 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.
[64]
Q. Heath, D. Miller.
A framework for proof certificates in finite state exploration, in: Proceedings of the Fourth Workshop on Proof eXchange for Theorem Proving, C. Kaliszyk, A. Paskevich (editors), Electronic Proceedings in Theoretical Computer Science, Open Publishing Association, August 2015, no 186, pp. 11–26. [ DOI : 10.4204/EPTCS.186.4 ]
http://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/pxtp2015.pdf
[65]
D. Jovanović, C. Barrett, L. de Moura.
The Design and Implementation of the Model Constructing Satisfiability Calculus, in: Proc. of the 13th Int. Conf. on Formal Methods In Computer-Aided Design (FMCAD '13), FMCAD Inc., 2013, Portland, Oregon.
http://www.cs.nyu.edu/~barrett/pubs/JBdM13.pdf
[66]
F. W. Lawvere.
Adjointness in Foundations, in: Dialectica, 1969, vol. 23, pp. 281–296.
[67]
C. 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
[68]
C. 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 ]
[69]
P. 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.
[70]
R. 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
[71]
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, pp. 434–445.
[72]
P.-A. Melliès, N. Zeilberger.
Functors are Type Refinement Systems, in: 42nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2015), Mumbai, India, January 2015. [ DOI : 10.1145/2676726.2676970 ]
https://hal.inria.fr/hal-01096910
[73]
D. Miller.
Forum: A Multiple-Conclusion Specification Logic, in: Theoretical Computer Science, September 1996, vol. 165, no 1, pp. 201–232.
[74]
D. Miller, G. Nadathur.
Programming with Higher-Order Logic, Cambridge University Press, June 2012. [ DOI : 10.1017/CBO9781139021326 ]
[75]
D. 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.
[76]
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, pp. 118–127.
http://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/lics03.pdf
[77]
R. 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.
[78]
S. Negri.
Proof Analysis in Modal Logic, in: Journal of Philosophical Logic, 2005, vol. 34, no 5-6, pp. 507–544. [ DOI : 10.1007/s10992-005-2267-3 ]
[79]
G. Nelson, D. C. Oppen.
Simplification by Cooperating Decision Procedures, in: ACM Press Trans. on Program. Lang. and Syst., October 1979, vol. 1, no 2, pp. 245–257. [ DOI : 10.1145/357073.357079 ]
[80]
F. 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.
[81]
B. 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.
[82]
M. Puech.
Typeful Continuations, in: Journées Francophones des Langages Applicatifs (JFLA) 2017, Gourette, France, January 2017.
https://hal.archives-ouvertes.fr/hal-01419473
[83]
E. P. Robinson.
Proof Nets for Classical Logic, in: Journal of Logic and Computation, 2003, vol. 13, pp. 777–797.
[84]
R. E. Shostak.
Deciding Combinations of Theories, in: J. ACM, 1984, vol. 31, no 1, pp. 1–12. [ DOI : 10.1145/2422.322411 ]
[85]
The Coq Development Team.
The Coq Proof Assistant Version 8.3 Reference Manual, Inria, October 2010.
[86]
A. 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
[87]
N. Zeilberger, A. Giorgetti.
A correspondence between rooted planar maps and normal planar lambda terms, in: Logical Methods in Computer Science, September 2015, vol. 11, no 3:22, pp. 1-39. [ DOI : 10.2168/LMCS-11(3:22)2015 ]
https://hal.inria.fr/hal-01057269
[88]
N. Zeilberger.
Counting isomorphism classes of β-normal linear lambda terms, September 2015, 5 pages.
https://hal.archives-ouvertes.fr/hal-01214121
[89]
L. M. de Moura, D. Jovanovic.
A Model-Constructing Satisfiability Calculus, in: Proc. of the 14th Int. Conf. on Verification, Model Checking, and Abstract Interpretation (VMCAI'13), R. Giacobazzi, J. Berdine, I. Mastroeni (editors), LNCS, Springer-Verlag, 2013, vol. 7737, pp. 1–12. [ DOI : 10.1007/978-3-642-35873-9_1 ]
[90]
L. 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