%% Dale Miller's Master Bibliography file. %% Use bibclean on this file to find errors and make the format consistent. %% For years, this file resided on the gforge.inria.fr site within the Parsifal repository. %% This file was also made available via "The Collection of Computer Science %% Bibliographies" found at http://liinwww.ira.uka.de/bibliography/. %% 2023: It seems that this site is no longer being operated. %% This file has four parts %% (0) Documentation about this file. %% (1) A list of string definitions. %% (2) A "staging area" where new or temporary references are put. %% (3) The rest, in which almost all the bibtex referenecs reside. %% Some of the rules I follow for entering items: %% (1) The key for a reference is composed of three parts. The first part %% is the last name of the first author. The second part is the last two %% digits of the year (or a period if the paper is not published yet). %% The third part is some acronym concerning the paper's publication. %% For example, abadi01popl, abramsky94jsl, miller.magnumopus, etc. %% (2) Make sure that the reference is not already present somewhere in the %% file. %% (3) Try to use a string abbreviate if one is supplied (just below). %% (4) If you are using emacs, use the fill-entry command on the entry. %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %% A possible hack to sort names right: for example, Jan von Plato %% should appear under Plato in the sort, while his name should %% appear at "von Plato" in the citation reference. %% -at-PREAMBLE{"\newcommand{\SortNoop}[1]{}"} %% Sept 2023: I dropped this since it did not work. The sorting was %% done on the token "SortNoop", which is laughable. I'm doing the %% following silly thing instead. @Preamble{"\newcommand{\Plato}[1]{}"} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %% String abbreviations below %% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% @String{apal = "Annals of Pure and Applied Logic"} @String{cacm = "Communications of the ACM"} @String{cade92 = "11th Conf.\ on Automated Deduction (CADE)"} @String{cade94 = "12th Conf.\ on Automated Deduction (CADE)"} @String{cade97 = "14th Conf.\ on Automated Deduction (CADE)"} @String{cade98 = "15th Conf.\ on Automated Deduction (CADE)"} @String{cade99 = "16th Conf.\ on Automated Deduction (CADE)"} @String{cade00 = "17th Conf.\ on Automated Deduction (CADE)"} @String{cade02 = "18th Conf.\ on Automated Deduction (CADE)"} @String{cade05 = "20th Conf.\ on Automated Deduction (CADE)"} @String{cade07 = "21th Conf.\ on Automated Deduction (CADE)"} @String{cade13 = "24th Conf.\ on Automated Deduction (CADE)"} @String{cade15 = "25th Conf.\ on Automated Deduction (CADE)"} @String{csl94 = "CSL 1994: Computer Science Logic"} @String{csl98 = "CSL 1998: Computer Science Logic"} @String{csl05 = "CSL 2005: Computer Science Logic"} @String{csl06 = "CSL 2006: Computer Science Logic"} @String{csl07 = "CSL 2007: Computer Science Logic"} @String{csl08 = "CSL 2008: Computer Science Logic"} @String{csl10 = "CSL 2010: Computer Science Logic"} @String{csl11 = "CSL 2011: Computer Science Logic"} @String{csl12 = "CSL 2012: Computer Science Logic"} @String{csl17 = "CSL 2017: Computer Science Logic"} @String{csl23 = "CSL 2023: Computer Science Logic"} %@String{cpp13 = "Third International Conference on Certified Programs and Proofs"} @String{cpp13 = "Certified Programs and Proofs"} %@String{entcs = "Electronic Notes in Theoretical Computer Science"} @String{entcs = "ENTCS"} @String{eptcs = "Electronic Proceedings in Theoretical Computer Science"} @String{fsttcs05 = "FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science"} @String{ic = "Information and Computation"} @String{lci = "Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik"} @String{ijcar06 = "Third International Joint Conference on Automated Reasoning (IJCAR'06)"} @String{ijcar08 = "Fourth International Joint Conference on Automated Reasoning"} @String{ijcar10 = "Fifth International Joint Conference on Automated Reasoning"} @String{jacm = "J. of the ACM"} @String{jar = "J. of Automated Reasoning"} @String{jcss = "J. of Computer and System Sciences"} @String{jlap = "J. of Logic and Algebraic Programming"} @String{jlc = "J. of Logic and Computation"} @String{jlp = "J. of Logic Programming"} @String{jpl = "J. of Philosophical Logic"} @String{jsl = "J. of Symbolic Logic"} @String{lfmtp08 = "International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP 2008)"} @String{lfmtp11 = "International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP 2011)"} @String{lfmtp14 = "International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP 2014)"} @String{lics86 = "1st Symp.\ on Logic in Computer Science"} @String{lics87 = "2nd Symp.\ on Logic in Computer Science"} @String{lics88 = "3nd Symp.\ on Logic in Computer Science"} @String{lics89 = "4th Symp.\ on Logic in Computer Science"} @String{lics90 = "5th Symp.\ on Logic in Computer Science"} @String{lics91 = "6th Symp.\ on Logic in Computer Science"} @String{lics92 = "7th Symp.\ on Logic in Computer Science"} @String{lics93 = "8th Symp.\ on Logic in Computer Science"} @String{lics94 = "9th Symp.\ on Logic in Computer Science"} @String{lics95 = "10th Symp.\ on Logic in Computer Science"} @String{lics96 = "11th Symp.\ on Logic in Computer Science"} @String{lics97 = "12th Symp.\ on Logic in Computer Science"} @String{lics98 = "13th Symp.\ on Logic in Computer Science"} @String{lics99 = "14th Symp.\ on Logic in Computer Science"} @String{lics01 = "16th Symp.\ on Logic in Computer Science"} @String{lics02 = "17th Symp.\ on Logic in Computer Science"} @String{lics03 = "18th Symp.\ on Logic in Computer Science"} @String{lics04 = "19uth Symp.\ on Logic in Computer Science"} @String{lics05 = "20th Symp.\ on Logic in Computer Science"} @String{lics07 = "22th Symp.\ on Logic in Computer Science"} @String{lics08 = "23th Symp.\ on Logic in Computer Science"} @String{lics09 = "24th Symp.\ on Logic in Computer Science"} @String{lics10 = "25th Symp.\ on Logic in Computer Science"} @String{lics12 = "27th Symp.\ on Logic in Computer Science"} @String{lics13 = "28th Symp.\ on Logic in Computer Science"} @String{lics15 = "30th Symp.\ on Logic in Computer Science"} @String{lics23 = "38th Symp.\ on Logic in Computer Science"} @String{lipics = "Leibniz International Proceedings in Informatics (LIPIcs)"} @String{lmcs = "Logical Methods in Computer Science"} %% @String{lnai = "Lecture Notes in Artificial Intelligence"} %% @String{lncs = "Lecture Notes in Computer Science"} %% @String{lncs = "Lecture Notes in Mathematics"} @String{lnai = "LNAI"} @String{lncs = "LNCS"} @String{lnm = "LNM"} @String{lopstr15 = "Logic-Based Program Synthesis and Transformation (LOPSTR) 2015"} @String{lpar = "LPAR: Logic Programming and Automated Reasoning, International Conference"} @String{lpar05 = "LPAR: Logic Programming and Automated Reasoning, International Conference"} @String{lpar92 = "LPAR: Logic Programming and Automated Reasoning, International Conference"} @String{lpar15 = "LPAR-20: Logic Programming and Automated Reasoning, International Conference"} @String{mscs = "Math. Structures in Computer Science"} @String{popl08 = "35th ACM Symp.\ on Principles of Programming Languages"} @String{popl05 = "32nd ACM Symp.\ on Principles of Programming Languages"} @String{popl02 = "29th ACM Symp.\ on Principles of Programming Languages"} @String{popl01 = "28th ACM Symp.\ on Principles of Programming Languages"} @String{popl88 = "15th ACM Symp.\ on Principles of Programming : Languages"} @String{popl90 = "17th ACM Symp.\ on Principles of Programming Languages"} @String{popl91 = "18th ACM Symp.\ on Principles of Programming Languages"} @String{ppdp09 = "ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP)"} @String{ppdp10 = "ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP)"} @String{ppdp15 = "ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP)"} @String{pub-sv = "Springer"} @String{tableaux95 = "TABLEAUX 95: Automated Reasoning with Analytic Tableaux and Related Methods"} @String{tableaux99 = "TABLEAUX 99: Automated Reasoning with Analytic Tableaux and Related Methods"} @String{tableaux09 = "TABLEAUX 09: Automated Reasoning with Analytic Tableaux and Related Methods"} @String{tableaux15 = "TABLEAUX 15: Automated Reasoning with Analytic Tableaux and Related Methods"} @String{tcs = "Theoretical Computer Science"} @String{tocl = "ACM Trans.\ on Computational Logic"} @String{tplp = "Theory and Practice of Logic Programming"} @String{welp91 = "2nd Workshop on Extensions to Logic Programming"} @String{welp92 = "3rd Workshop on Extensions to Logic Programming"} @String{welp93 = "4th Workshop on Extensions to Logic Programming"} @String{welp94 = "5th Workshop on Extensions to Logic Programming"} @String{welp96 = "7th Workshop on Extensions to Logic Programming"} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %% Staging Area %% %% %% %% Place references here if they are incomplete, don't follow all the %% %% rules, or are about papers "to appear". Eventually they will be moved %% %% to the mail bibliograph area. Note: the key may change when the entry %% %% is moved. %% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% @Misc{Abella, key = "Abella", title = "The {A}bella Prover", note = "Available at \url{https://abella-prover.org/}", year = "2012", } @Misc{try-abella, key = "Abella try", title = "The {A}bella in your browser", URL = "https://abella-prover.org/tutorial/try", year = "2015", } @Misc{Bedwyr, key = "Bedwyr", title = "The {B}edwyr system", note = "Available at \url{https://slimmer.gforge.inria.fr/bedwyr/}", year = "2015", } @Misc{Profound, title = "Profound: a linking-based interactive prover", note = "Available at: \url{https://chaudhuri.info/software/profound/}", year = "2013", author = "Kaustuv Chaudhuri", } %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %% Evolution of the size of this bibtex file (Date | #entries) %% 23.04.12 | 1545 %% 28.08.12 | 1571 %% 05.02.13 | 1601 %% 11.06.13 | 1741 %% 25.08.14 | 1798 %% 06.03.15 | 1846 %% 18.08.15 | 1890 %% 22.12.15 | 1938 %% 23.10.17 | 2044 %% 09.01.18 | 2058 %% 18.03.18 | 2065 %% 18.10.19 | 2175 %% 05.05.19 | 2196 %% 03.05.20 | 2256 %% 22.12.20 | 2302 %% 29.03.21 | 2323 %% 25.04.21 | 2345 %% 20.08.21 | 2354 %% 26.10.22 | 2395 %% 12.07.23 | 2429 %% 29.12.23 | 2454 %% 10.02.24 | 2468 %% 27.03.24 | 2488 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %% The references start below %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% @InProceedings{abadi01popl, author = "Mart{\'\i}n Abadi and C\'edric Fournet", title = "Mobile values, new names, and secure communication", booktitle = "POPL '01: Proc. of the 28th Symposium on Principles of programming languages", year = "2001", ISBN = "1-58113-336-7", pages = "104--115", location = "London, United Kingdom", doi = "10.1145/360204.360213", publisher = "ACM Press", } @Article{abadi02ic, title = "Secure Implementation of Channel Abstractions", author = "Mart{\'i}n Abadi and C{\'e}dric Fournet and Georges Gonthier", journal = "Information and Computation", year = "2002", number = "1", volume = "174", pages = "37--83", } @Article{abadi07, title = "Access Control in a Core Calculus of Dependency", author = "Mart{\'i}n Abadi", journal = "Electr. Notes Theor. Comput. Sci", year = "2007", volume = "172", pages = "5--31", } @InProceedings{abadi08deontic, title = "Variations in Access Control Logic", author = "Mart{\'i}n Abadi", booktitle = "Deontic Logic in Computer Science (DEON 2008)", publisher = "Springer", year = "2008", volume = "5076", editor = "Ron van der Meyden and Leendert W. N. van der Torre", pages = "96--109", series = lncs, doi = "10.1007/978-3-540-70525-3_9", } @Article{abadi91jfp, author = "{Mart{\'\i}n} Abadi and Luca Cardelli and Pierre-Louis Curien and Jean-Jacques L\'evy", title = "Explicit Substitutions", journal = "Journal of Functional Programming", year = "1991", volume = "1", number = "4", month = oct, pages = "375--416", } @InProceedings{abadi97cccs, author = "M. Abadi and A. D. Gordon", title = "A Calculus for Cryptographic Protocols: The Spi Calculus", year = "1997", publisher = "{ACM} Press", booktitle = "Fourth ACM Conference on Computer and Communications Security", pages = "36--47", } @Article{abadi99ic, author = "{Mart\'\i n} Abadi and Andrew D. Gordon", title = "A calculus for cryptographic protocols: {The} spi calculus", journal = "Information and Computation", year = "1999", volume = "148", number = "1", pages = "1--70", } @InCollection{abel11tlca, title = "Higher-order dynamic pattern unification for dependent types and records", author = "Andreas Abel and Brigitte Pientka", booktitle = "Typed Lambda Calculi and Applications", pages = "10--26", year = "2011", publisher = "Springer", } @Article{abel19jfp, author = "Andreas Abel and Guillame Allais and Aliya Hameer and Alberto Momigliano and Brigitte Pientka and Steven Schaefer and Kathrin Stark", title = "{POPLM}ark reloaded: Mechanizing proofs by logical relations", journal = "Journal of Functional Programming", year = "2019", doi = "10.1017/S0956796819000170", volume = "29", } @Misc{abella.website, title = "The {A}bella system and homepage", author = "Andrew Gacek", year = "2009", howpublished = "\url{https://abella.cs.umn.edu/}", key = "zzz", } @Misc{abella2.website, title = "The {A}bella web-site", year = "2015", howpublished = "\url{https://abella-prover.org/}", key = "zzz", } @Book{abelson85, author = "Harold Abelson and Gerald J. Sussman", title = "Structure and Interpretation of Computer Programs", publisher = "MIT Press", year = "1985", } @Article{abramsky00ic, author = "Samson Abramsky and Radha Jagadeesan and Pasquale Malacaria", title = "Full abstraction for {PCF}", journal = "Information and Computation", volume = "163", number = "2", year = "2000", pages = "409--470", publisher = "Academic Press, Inc.", address = "Duluth, MN, USA", } @Article{abramsky03mscs, author = "Samson Abramsky", title = "Sequentiality vs. concurrency in games and logic", journal = "Mathematical Structures in Computer Science", year = "2003", volume = "13", number = "4", month = aug, pages = "531--565", doi = "10.1017/S0960129503003980", URL = "https://www.comlab.ox.ac.uk//files/332/seqcon.ps.gz", } @InProceedings{abramsky04tacas, author = "Samson Abramsky and Dan R. Ghica and Andrzej S. Murawski and C.-H. Luke Ong", title = "Applying Game Semantics to Compositional Software Modeling and Verification", booktitle = "Proceedings of Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2004)", pages = "421--435", year = "2004", editor = "Kurt Jensen and Andreas Podelski", volume = "2988", series = lncs, publisher = pub-sv, } @InCollection{abramsky06sandu, author = "S. Abramsky", title = "Socially Responsive, Environmentally Friendly Logic", booktitle = "In Truth and Games: Essays in Honour of Gabriel Sandu", pages = "17--46", publisher = "Acta Philosophica Fennica, Societas Philosophicas Fennica, Helsinki", year = "2006", editor = "Tuomo Aho and Ahti V. Pietarinen", } @Article{abramsky87tcs, author = "Samson Abramsky", title = "Observation Equivalence as a Testing Equivalence", journal = "Theoretical Computer Science", year = "1987", volume = "53", pages = "225--241", } @InCollection{abramsky90lazy, author = "S. Abramsky", title = "The Lazy Lambda Calculus", booktitle = "Research Topics in Functional Programming", publisher = "Addison-Welsey", address = "Reading, MA", editor = "D. A. Turner", ISBN = "0-201-17236-4", pages = "65--116", year = "1990", URL = "citeseer.nj.nec.com/abramsky90lazy.html", } @TechReport{abramsky90tr, author = "Samson Abramsky", title = "Computational Interpretations of Linear Logic", number = "Research Report DOC 90/20", institution = "Imperial College", month = oct, year = "1990", } @TechReport{abramsky90tra, author = "Samson Abramsky and S. Vickers", title = "Quantales, Observational Logic, and Process Semantics", year = "1990", institution = "Imperial College", note = "Research Report DOC 90/1", } @Unpublished{abramsky91slides, author = "Samson Abramsky", title = "Proofs as Processes", year = "1991", note = "Copy of transparencies", } @Article{abramsky93tcs, author = "Samson Abramsky", title = "Computational Interpretations of Linear Logic", journal = "Theoretical Computer Science", volume = "111", year = "1993", pages = "3--57", } @Article{abramsky94jsl, author = "Samson Abramsky and Radha Jagadeesan", title = "Games and Full Completeness for Multiplicative Linear Logic", journal = jsl, year = "1994", volume = "59", number = "2", pages = "543--574", URL = "https://web.comlab.ox.ac.uk/oucl/work/samson.abramsky/gfc.ps.gz", } @InProceedings{abramsky99lics, author = "Samson Abramsky and Paul-Andr\'{e} Melli\`{e}s", title = "Concurrent Games and Full Completeness", booktitle = lics99, pages = "431--442", year = "1999", publisher = "IEEE Computer Society Press", } @TechReport{abrusci90tr, author = "V. Michele Abrusci", title = "Cut elimination theorem for pure non-commutative classical linear propositional logic", institution = "Department of Philosophy, University of Bari, Italy", year = "1990", number = "12", month = sep, } @Article{abrusci90zml, author = "M.~Abrusci", title = "A comparison between {Lambek} syntactic calculi and intuitionistic linear logic", journal = "Zeitschrift f{\"{u}}r Mathematische Logik und Grundlagen der Mathematik", year = "1990", volume = "36", pages = "11--15", } @Article{abrusci90zmlb, author = "V. Michele Abrusci", title = "Non-commutative intuitionistic linear propositional logic", journal = "Zeitschrift für Mathematische Logik und Grundlagen der Mathematik", year = "1990", volume = "36", pages = "297--318", } @InProceedings{abrusci91, author = "V. Michele Abrusci", title = "Lambek Syntactic Calculus and Non-commutative Linear Logic", booktitle = "Nuovi problemi della logica e della filosofia della scienza", year = "1991", volume = "II", editor = "G. Corsi and G. Sambin", publisher = "CLUEB", address = "Viareggio, Italy", month = jan, } @Article{abrusci91jsl, author = "V. Michele Abrusci", title = "Phase semantics and sequent calculus for pure non-commutative classical linear propositional logic", journal = jsl, year = "1991", volume = "56", number = "4", pages = "1403--1451", month = dec, } @InCollection{abrusci95, author = "V. Michele Abrusci", title = "Non-commutative Proof Nets", booktitle = "Advances in Linear Logic", editor = "J.-Y. Girard and Y. Lafont and L. Regnier", year = "1995", pages = "271--296", publisher = "Cambridge University Press", note = "Proceedings of the Workshop on Linear Logic, Ithaca, New York, June 1993", } @Article{abrusci99apal, author = "V. Michele Abrusci and Paul Ruet", title = "Non-Commutative Logic {I}: The Multiplicative Fragment", journal = apal, volume = "101", number = "1", pages = "29--64", year = "1999", } @InProceedings{accattoli10csl, title = "The Structural lambda-Calculus", author = "Beniamino Accattoli and Delia Kesner", booktitle = "Computer Science Logic, 24th International Workshop, CSL 2010, 19th Annual Conference of the EACSL, Brno, Czech Republic, August 23-27, 2010. Proceedings", publisher = "Springer", year = "2010", volume = "6247", editor = "Anuj Dawar and Helmut Veith", pages = "381--395", series = "Lecture Notes in Computer Science", } @InProceedings{accattoli12cpp, author = "Beniamino Accattoli", title = "Proof pearl: Abella formalization of lambda calculus cube property", booktitle = "Second International Conference on Certified Programs and Proofs", editor = "Chris Hawblitzel and Dale Miller", year = "2012", publisher = pub-sv, series = lncs, volume = "7679", pages = "173--187", } @InProceedings{accattoli12flops, author = "Beniamino Accattoli and Luca Paolini", title = "Call-by-Value Solvability, Revisited", booktitle = "Eleventh International Symposium on Functional and Logic Programming (FLOPS 2012)", editor = "Tom Schrijvers and Peter Thiemann", year = "2012", pages = "4--16", doi = "10.1007/978-3-642-29822-6\_4", publisher = pub-sv, series = lncs, volume = "7294", } @Article{accattoli12lmcs, author = "Beniamino Accattoli and Delia Kesner", title = "Preservation of Strong Normalisation modulo permutations for the structural lambda-calculus", journal = lmcs, volume = "8", number = "1", year = "2012", doi = "10.2168/LMCS-8(1:28)2012", URL = "https://hal.archives-ouvertes.fr/hal-00686780", } @InProceedings{accattoli12lpar, author = "Beniamino Accattoli and Delia Kesner", title = "The Permutative $\lambda$-Calculus", booktitle = "Logic for Programming, Artificial Intelligence, and Reasoning - 18th International Conference (LPAR-18)", year = "2012", editor = "Nikolaj Bjørner and Andrei Voronkov", pages = "23--36", doi = "10.1007/978-3-642-28717-6\_5", publisher = pub-sv, series = lncs, volume = "7180", URL = "https://hal.archives-ouvertes.fr/hal-00686795", } @InProceedings{accattoli12rtaa, author = "Beniamino Accattoli and Ugo Dal Lago", title = "On the Invariance of the Unitary Cost Model for Head Reduction", booktitle = "23rd International Conference on Rewriting Techniques and Applications (RTA)", editor = "Ashish Tiwari", year = "2012", pages = "22--37", doi = "10.4230/LIPIcs.RTA.2012.22", publisher = lci, series = lipics, volume = "15", } @InProceedings{accattoli12rtab, author = "Beniamino Accattoli", title = "An Abstract Factorization Theorem for Explicit Substitutions", booktitle = "23rd International Conference on Rewriting Techniques and Applications (RTA)", editor = "Ashish Tiwari", year = "2012", pages = "6--21", doi = "10.4230/LIPIcs.RTA.2012.6", publisher = lci, series = lipics, volume = "15", } @InProceedings{accattoli13termgraph, author = "Beniamino Accattoli", title = "Evaluating functions as processes", booktitle = "7th International Workshop on Computing with Terms and Graphs", year = "2013", series = eptcs, note = "To appear.", } @InProceedings{accattoli14popl, title = "A nonstandard standardization theorem", author = "Beniamino Accattoli and Eduardo Bonelli and Delia Kesner and Carlos Lombardi", booktitle = "The 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '14, San Diego, CA, USA, January 20-21, 2014", publisher = "ACM", year = "2014", editor = "Suresh Jagannathan and Peter Sewell", pages = "659--670", URL = "https://dl.acm.org/citation.cfm?id=2535838", } @InProceedings{accattoli15aplas, title = "{A Strong Distillery}", author = "Beniamino Accattoli and Pablo Barenbaum and Damiano Mazza", booktitle = "{Programming Languages and Systems - 13th Asian Symposium, APLAS 2015}", address = "Pohang, South Korea", series = "Lecture notes in computer science", volume = "9458", pages = "231--250", year = "2015", month = Nov, doi = "10.1007/978-3-319-26529-2\_13", URL = "https://hal.archives-ouvertes.fr/hal-01244838", hal_id = "hal-01244838", hal_version = "v1", } @InProceedings{accattoli15lics, title = "{On the Relative Usefulness of Fireballs}", author = "Beniamino Accattoli and Claudio Sacerdoti Coen", booktitle = "{30th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2015}", address = "Kyoto, Japan", year = "2015", month = Jul, doi = "10.1109/LICS.2015.23", URL = "https://hal.archives-ouvertes.fr/hal-01244833", hal_id = "hal-01244833", hal_version = "v1", } @Article{accattoli15tcs, title = "{Proof nets and the call-by-value λ-calculus}", author = "Beniamino Accattoli", journal = "{Journal of Theoretical Computer Science (TCS)}", publisher = "{Elsevier}", year = "2015", doi = "10.1016/j.tcs.2015.08.006", URL = "https://hal.archives-ouvertes.fr/hal-01244842", hal_id = "hal-01244842", hal_version = "v1", } @Article{accattoli16lmcs, title = "{(Leftmost-outermost) beta reduction is invariant, indeed}", author = "Beniamino Accattoli and Ugo Dal Lago", URL = "https://hal.inria.fr/hal-01337712", journal = "{Logical Methods in Computer Science}", publisher = "{Logical Methods in Computer Science Association}", year = "2016", doi = "10.2168/LMCS-12(1:4)2016", keywords = "sharing ; standardization ; lambda calculus ; cost models ; linear logic ; invariance ; operational semantics LOGICAL METHODS", pdf = "https://hal.inria.fr/hal-01337712/file/lmcs2016.pdf", hal_id = "hal-01337712", hal_version = "v1", } @InProceedings{accattoli17aplas, author = "Beniamino Accattoli and Bruno Barras", title = "The Negligible and Yet Subtle Cost of Pattern Matching", booktitle = "Programming Languages and Systems - 15th Asian Symposium, {APLAS} 2017, Suzhou, China, November 27-29, 2017, Proceedings", pages = "426--447", year = "2017", URL = "https://doi.org/10.1007/978-3-319-71237-6\_21", doi = "10.1007/978-3-319-71237-6\_21", } @InProceedings{accattoli17ppdp, author = "Beniamino Accattoli and Bruno Barras", title = "Environments and the complexity of abstract machines", booktitle = "Proceedings of the 19th International Symposium on Principles and Practice of Declarative Programming, Namur, Belgium, October 09 - 11, 2017", pages = "4--16", year = "2017", URL = "https://doi.acm.org/10.1145/3131851.3131855", doi = "10.1145/3131851.3131855", } @InProceedings{accattoli23itp, author = "Beniamino Accattoli and Horace Blanc and Claudio Sacerdoti Coen", title = "{Formalizing Functions as Processes}", booktitle = "14th International Conference on Interactive Theorem Proving (ITP 2023)", pages = "5:1--5:21", series = "Leibniz International Proceedings in Informatics (LIPIcs)", year = "2023", volume = "268", editor = "Adam Naumowicz and Ren\'{e} Thiemann", publisher = "Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik", address = "Dagstuhl, Germany", URL = "https://drops.dagstuhl.de/opus/volltexte/2023/18380", URN = "urn:nbn:de:0030-drops-183800", doi = "10.4230/LIPIcs.ITP.2023.5", } @Article{aceto96ic, title = "{CPO} Models for Compact {GSOS} Languages", author = "Luca Aceto and Anna Ingólfsdóttir", pages = "107--141", journal = "Information and Computation", month = sep, year = "1996", volume = "129", number = "2", } @InCollection{aczel77hml, author = "Peter Aczel", title = "An Introduction to Inductive Definitions", editor = "J. Barwise", booktitle = "Handbook of Mathematical Logic", series = "Studies in Logic and the Foundations of Mathematics", volume = "90", pages = "739--782", publisher = "North-Holland", address = "Amsterdam", year = "1977", } @InProceedings{ager03ppdp, author = "M. S. Ager and D. Biernacki and O. Danvy and J. Midtgaard", title = "A functional correspondence between evaluators and abstract machines", booktitle = "PPDP'03: the Fifth ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming", pages = "9--18", year = "2003", editor = "D. Miller", publisher = "ACM Press", } @Book{agha86, author = "Gul Agha", title = "Actors: {A} Model of Concurrent Computation in Distributed Systems", publisher = "MIT Press", year = "1986", } @InProceedings{agha92concur, author = "Gul Agha and Ian A. Mason and Scott Smith and Carolyn Talcott", title = "Towards a Theory of Actor Computation (Extended Abstract)", editor = "Rance Cleaveland", booktitle = "CONCUR92", publisher = pub-sv, series = lncs, volume = "630", pages = "565--578", year = "1992", } @InProceedings{ahn17concur, author = "Ki Yung Ahn and Ross Horne and Alwen Tiu", title = "{A Characterisation of Open Bisimilarity using an Intuitionistic Modal Logic}", booktitle = "28th International Conference on Concurrency Theory (CONCUR 2017)", pages = "7:1--7:17", series = "Leibniz International Proceedings in Informatics (LIPIcs)", year = "2017", volume = "85", editor = "Roland Meyer and Uwe Nestmann", publisher = "Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik", address = "Dagstuhl, Germany", URL = "https://drops.dagstuhl.de/opus/volltexte/2017/7789", doi = "10.4230/LIPIcs.CONCUR.2017.7", } @Book{aho07book, author = "Alfred V. Aho and Monica S. Lam and Ravi Sethi and Jeffrey D. Ullman", title = "Compilers: Principles, Techniques, and Tools", publisher = "Pearson, Addison Wesley", year = "2007", edition = "Second", } @InProceedings{aiken94ppcp, author = "Alexander Aiken", title = "Set constraints: results, applications, and future directions", booktitle = "PPCP94: Principles and Practice of Constraint Programming", pages = "171--179", year = "1994", series = lncs, number = "874", } @Article{aitkaci89, author = "Hassan A{\"\i}t{-}Kaci and Robert Boyer and Patrick Lincoln and Roger Nasr", title = "Efficient Implementation of Lattice Operations", journal = "ACM Transactions on Programming Languages and Systems", year = "1989", volume = "11", number = "1", pages = "115--146", month = jan, } @Book{aitkaci91wam, author = "Hassan A{\"\i}t{-}Kaci", title = "Warren's Abstract Machine: {A} Tutorial Reconstruction", publisher = "MIT Press", address = "Cambridge, MA", series = "Logic Programming Research Reports and Notes", year = "1991", URL = "https://wambook.sourceforge.net/", } @InProceedings{albert04lpar, author = "Elvira Albert and Germ{\'a}n Puebla and Manuel V. Hermenegildo", title = "Abstraction-Carrying Code", booktitle = "LPAR 2004: Logic for Programming, Artificial Intelligence, and Reasoning", year = "2004", publisher = pub-sv, series = lncs, volume = "3452", pages = "380--397", } @Book{alexander14book, author = "Amir Alexander", title = "Infinitesimal: How a dangerous mathematical theory shaped the modern world", publisher = "Oneworld Publications", year = "2014", } @InProceedings{allali07types, author = "Lisa Allali", title = "Algorithmic Equality in Heyting Arithmetic Modulo", booktitle = "TYPES", year = "2007", pages = "1--17", doi = "10.1007/978-3-540-68103-8\_1", editor = "Marino Miculan and Ivan Scagnetto and Furio Honsell", title = "Types for Proofs and Programs, International Conference, {TYPES} 2007, Cividale del Friuli, Italy, May 2-5, 2007, Revised Selected Papers", publisher = pub-sv, series = lncs, volume = "4941", year = "2008", ISBN = "978-3-540-68084-0", } @PhdThesis{allen87phd, author = "Stuart F. Allen", title = "A Non-type-theoretic Semantics for Type-theoretic Language", school = "Cornell University", year = "1987", } @Article{allwein93jsl, author = "Gerard Allwein and J. Michael Dunn", title = "Kripke Models for Linear Logic", journal = jsl, year = "1993", volume = "58", number = "2", pages = "514--545", } @InProceedings{altenkirch93tlca, author = "Thorsten Altenkirch", title = "A formalization of the strong normalization proof for system {F} in {LEGO}", booktitle = "Typed Lambda Calculi and Applications (TLCA)", journal = "Lecture Notes in Computer Science", volume = "664", pages = "13--28", year = "1993", } @InCollection{altenkirch99csl, author = "Thorsten Altenkirch", title = "Logical Relations and Inductive/Coinductive Types", editor = "Georg Gottlob and Etienne Grandjean and Katrin Seyr", booktitle = "Proceedings 12th Int.\ Workshop on Computer Science Logic, CSL'98, Brno, Czech Republic", series = lncs, volume = "1584", pages = "343--354", month = oct, publisher = pub-sv, address = "Berlin", year = "1999", } @InProceedings{alves06csl, author = "Sandra Alves and Maribel Fern{\'a}ndez and M{\'a}rio Florido and Ian Mackie", title = "The Power of Linear Functions", booktitle = csl06, year = "2006", pages = "119--134", doi = "10.1007/11874683_8", } @Proceedings{alves15linearity, editor = "Sandra Alves and Iliano Cervesato", title = "Proceedings Third International Workshop on Linearity, {LINEARITY} 2014, Vienna, Austria, 13th July, 2014", series = "{EPTCS}", volume = "176", year = "2015", URL = "https://dx.doi.org/10.4204/EPTCS.176", doi = "10.4204/EPTCS.176", } @TechReport{alwardani22hal, author = "Farah {Al Wardani} and Kaustuv Chaudhuri and Dale Miller", title = "Distributing and trusting proof checking: a preliminary report", institution = "Inria Saclay", year = "2022", URL = "https://hal.inria.fr/hal-03909741", } @InProceedings{alwardani23frocos, author = "Farah {Al Wardani} and Kaustuv Chaudhuri and Dale Miller", title = "Formal Reasoning Using Distributed Assertions", booktitle = "FroCoS 2023", year = "2023", editor = "U. Sattler and M. Suda", volume = "14279", series = "LNAI", pages = "176--194", doi = "10.1007/978-3-031-43369-6\_10", } @InProceedings{ambler02tphol, author = "Simon Ambler and Roy Crole and Alberto Momigliano", title = "Combining Higher Order Abstract Syntax with Tactical Theorem Proving and (Co)Induction", booktitle = "Proceedings of the 15th International Conference on Theorem Proving in Higher Order Logics, Hampton, VA, 1-3 August 2002", year = "2002", editor = "V.~A.~Carreño", volume = "2342", series = lncs, publisher = pub-sv, } @Article{ambriola85, author = "V. Ambriola and F. Giannotti and D. Pedreschi and F. Turini", title = "Symbolic Semantics and Program Reductiion", journal = "{IEEE} Transactions on Software Engineering", volume = "11", number = "8", pages = "784--794", year = "1985", } @InProceedings{anderson04tphol, title = "Verifying Uniqueness in a Logical Framework", author = "Penny Anderson and Frank Pfenning", year = "2004", editor = "Konrad Slind and Annette Bunker and Ganesh Gopalakrishnan", booktitle = "17th International Conference on Theorem Proving in Higher Order Logics (TPHOLs)", publisher = pub-sv, series = lncs, volume = "3223", pages = "18--33", } @Book{anderson75book, author = "Alan~R. Anderson and Nuel~D. Belnap", title = "Entailment: The Logic of Relevance and Necessity", publisher = "Princeton University Press", year = "1975", address = "Princeton, NJ", } @Book{anderson75vol1, title = "Entailment: The Logic of Relevance and Neccessity, Vol. {I}", author = "Alan Ross Anderson and Nuel D. Belnap", editor = "Nuel D. Belnap and J. Michael Dunn", publisher = "Princeton, N.J.: Princeton University Press", year = "1975", } @Book{anderson92vol2, author = "Alan Ross Anderson and Nuel D. Belnap and J. Michael Dunn", title = "Entailment: The Logic of Relevance and Neccessity, Vol. {II}", publisher = "Princeton, N.J.: Princeton University Press", year = "1992", doi = "10.2307/j.ctt1m3nx4z.1", } @Article{andreoli01apal, author = "Jean-Marc Andreoli", title = "Focussing and proof construction", journal = apal, volume = "107", number = "1", pages = "131--163", year = "2001", publisher = "Elsevier", } @InProceedings{andreoli02cade, author = "Jean-Marc Andreoli", title = "Focussing Proof-Net Construction as a Middleware Paradigm", booktitle = cade02, pages = "501--516", year = "2002", editor = "Andrei Voronkov", number = "2392", series = lnai, publisher = pub-sv, } @InProceedings{andreoli90iclp, author = "J.-M. Andreoli and R. Pareschi", title = "Linear Objects: Logical Processes with Built-In Inheritance", booktitle = "Proceeding of the Seventh International Conference on Logic Programming, Jerusalem", month = may, year = "1990", publisher = "MIT Press", } @PhdThesis{andreoli90phd, author = "Jean-Marc Andreoli", title = "Proposal for a Synthesis of Logic and Object-Oriented Programming Paradigms", school = "University of Paris {VI}", year = "1990", } @InProceedings{andreoli91elp, author = "Jean-Marc Andreoli and Remo Pareschi", title = "Logic Programming with Sequent Systems: a Linear Logic Approach", editor = "Peter Schroeder-Heister", booktitle = "Extensions of Logic Programming: International Workshop, T{\"u}bingen FRG, December 1989", publisher = pub-sv, series = lnai, volume = "475", year = "1991", } @Article{andreoli91ngc, title = "Linear Objects: Logical Processes with Built-in Inheritance", author = "J. M. Andreoli and R. Pareschi", year = "1991", journal = "New Generation Computing", pages = "445--473", volume = "9", number = "3-4", } @InProceedings{andreoli91oopsla, author = "J.-M. Andreoli and R.~Pareschi", title = "Communication as Fair Distribution of Knowledge", booktitle = "Proceedings of {OOPSLA} 91", year = "1991", pages = "212--229", } @Article{andreoli92jlc, author = "Jean-Marc Andreoli", title = "Logic Programming with Focusing Proofs in Linear Logic", journal = jlc, volume = "2", number = "3", pages = "297--347", year = "1992", doi = "10.1093/logcom/2.3.297", } @InProceedings{andreoli99lpar, author = "J.-M. Andreoli and R. Maieli", title = "Focusing and proof nets in linear and noncommutative logic", booktitle = "International Conference on Logic for Programming and Automated Reasoning (LPAR)", year = "1999", volume = "1581", series = lnai, publisher = pub-sv, } @InProceedings{andrews00cade, author = "Peter B. Andrews and Matthew Bishop and Chad E. Brown", title = "{TPS}: {A} Theorem Proving System for Type Theory", booktitle = "Proceedings of the 17th International Conference on Automated Deduction", editor = "David McAllester", number = "1831", series = lnai, year = "2000", publisher = pub-sv, address = "Pittsburgh, USA", pages = "164--169", } @Book{andrews02book, author = "Peter B. Andrews", title = "An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof", publisher = "Kluwer Academic Publishers", year = "2002", edition = "second", } @InCollection{andrews09sep, author = "Peter Andrews", title = "Church's Type Theory", booktitle = "The Stanford Encyclopedia of Philosophy", editor = "Edward N. Zalta", publisher = "Stanford University", howpublished = "\url{https://plato.stanford.edu/archives/spr2009/entries/type-theory-church/}", year = "2009", edition = "Spring 2009", } @Misc{andrews12ijcar, author = "Peter B. Andrews", title = "Looking ahead", howpublished = "https://gtps.math.cmu.edu/looking-ahead.pdf", month = jun, year = "2012", note = "Text of an invited lecture presented to IJCAR 2012, the 6th International Joint Conference on Automated Reasoning, in Manchester, United Kingdom, on June 27, 2012, as a Guest Speaker.", } % See the newer version at benzmueller19sep. @Book{andrews65book, author = "{P. B. Andrews}", publisher = "North-Holland Publishing Company", title = "{A} {T}ransfinite {T}ype {T}heory with {T}ype {V}ariables", year = "1965", series = "Studies in Logic and the Foundations of Mathematics", } @Article{andrews71jsl, author = "Peter B. Andrews", title = "Resolution in Type Theory", journal = jsl, volume = "36", year = "1971", pages = "414--432", } @Article{andrews72jsla, author = "Peter B. Andrews", title = "General Models, Descriptions, and Choice in Type Theory", journal = "Journal of Symbolic Logic", volume = "37", number = "2", year = "1972", pages = "385--394", } @Article{andrews72jslb, author = "Peter B. Andrews", title = "General Models and Extensionality", journal = "Journal of Symbolic Logic", volume = "37", year = "1972", pages = "395--397", } @Misc{andrews73letter, author = "Peter B. Andrews", year = "1973", note = "letter to Roger Hindley dated January 22, 1973", } @Article{andrews74ndjfl, author = "Peter B. Andrews", journal = "Notre Dame Journal of Formal Logic", pages = "73--84", title = "Resolution and the Consistency of Analysis", volume = "15", number = "1", year = "1974", } @Article{andrews74zmlgm, author = "Peter B. Andrews", title = "Provability in Elementary Type Theory", journal = "Zeitschrift fur Mathematische Logic und Grundlagen der Mathematik", year = "1974", volume = "20", pages = "411--418", } @Article{andrews76ieee, author = "Peter B. Andrews", title = "Refutations by Matings", journal = "IEEE Trans. Computers", volume = "25", number = "8", year = "1976", pages = "801--807", doi = "10.1109/TC.1976.1674698", } @InProceedings{andrews80, author = "Peter B. Andrews", title = "Transforming Matings into Natural Deduction Proofs", booktitle = "Fifth Conference on Automated Deduction", address = "Les Arcs, France", publisher = pub-sv, year = "1980", editor = "W. Bibel and R. Kowalski", series = lncs, volume = "87", pages = "281--292", } @Article{andrews81jacm, author = "Peter B. Andrews", title = "Theorem Proving via General Matings", journal = "J. ACM", volume = "28", number = "2", year = "1981", pages = "193--214", doi = "10.1145/322248.322249", } @Article{andrews84ahol, author = "Peter B. Andrews and Eve Longini-Cohen and Dale Miller and Frank Pfenning", journal = "Contemp. Math", pages = "169--192", title = "Automating Higher Order Logics", volume = "29", year = "1984", } @InCollection{andrews84ams, title = "Automating higher order logic", author = "Peter B. Andrews and Eve Longini Cohen and Dale Miller and Frank Pfenning", booktitle = "Automated Theorem Proving: After 25 Years", editor = "W. W. Bledsoe and D. W. Loveland", publisher = "American Mathematical Society", address = "Providence, RI", year = "1984", pages = "169--192", } @InProceedings{andrews86, title = "The {TPS} Theorem Proving System", author = "Peter B. Andrews and Frank Pfenning and Sunil Issar and C. P. Klapper", booktitle = "Eighth International Conference on Automated Deduction", month = jul, year = "1986", pages = "663--664", publisher = "Springer", series = lncs, volume = "230", editor = "J{\"o}rg H. Siekmann", } @Book{andrews86ap, author = "Peter B. Andrews", title = "An Introduction to Mathematical Logic and Type Theory", publisher = "Academic Press", address = "New York", year = "1986", } @Book{andrews86book, author = "Peter B. Andrews", publisher = "Academic Press", title = "{An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof}", year = "1986", } @Article{andrews89jar, author = "Peter B. Andrews", title = "On Connections and Higher-Order Logic", journal = "Journal of Automated Reasoning", year = "1989", volume = "5", number = "3", year = "1989", pages = "257--291", doi = "10.1007/BF00248320", } @Misc{andrews94qed, author = "Peter B. Andrews", title = "Accept Diversity", month = aug, year = "1994", note = "Email message archived at \url{https://mizar.org/qed/mail-archive/volume-2/0199.html}", } @Article{andrews96jar, author = "Peter B. Andrews and Matthew Bishop and Sunil Issar and Dan Nesmith and Frank Pfenning and Hongwei Xi", title = "{TPS}: {A} Theorem Proving System for Classical Type Theory", journal = "Journal of Automated Reasoning", year = "1996", volume = "16", number = "3", pages = "321--353", } @Article{andrews97tcs, author = "James Andrews", title = "A logical semantics for depth-first {Prolog} with ground negation", journal = "Theoretical Computer Science", year = "1997", volume = "184", number = "1-2", pages = "105--143", } @InProceedings{anonymous94cade, author = "Anonymous", title = "The {QED} Manifesto", pages = "238--251", year = "1994", month = jun, editor = "Alan Bundy", booktitle = "12th International Conference on Automated Deduction", address = "Nancy, France", series = lnai, number = "814", publisher = "Springer-Verlag", } @Misc{anssi21coq, key = "ANSSI", author = "French National Cybersecurity Agency ANSSI", title = "Requirements on the Use of {Coq} in the Context of Common Criteria Evaluations", month = dec, year = "2021", note = "v1.1", howpublished = "\href{https://www.ssi.gouv.fr/uploads/2014/11/anssi-requirements-on-the-use-of-coq-in-the-context-of-common-criteria-evaluations-v1.1-en.pdf}{URL}", } @Article{apery79jal, author = "Roger Ap{\'e}ry", title = "Irrationalit{\'e} de $\zeta 2$ et $\zeta 3$", journal = "Journées Arithmétiques de Luminy, Astérisque", year = "1979", volume = "61", pages = "11--13", } @InProceedings{appel01lics, author = "Andrew W. Appel", title = "Foundational Proof-Carrying Code", pages = "247--258", booktitle = lics01, year = "2001", } @InProceedings{appel02fcs, author = "Andrew W. Appel and Neophytos Michael and Aaron Stump and Roberto Virga", title = "A trustworthy proof checker", booktitle = "Foundations of Computer Security Workshop", pages = "37--48", year = "2002", editor = "Iliano Cervesato", month = jul, } @Article{appel04jfp, author = "Andrew W. Appel and Amy P. Felty", title = "Dependent types ensure partial correctness of theorem provers", journal = "J. Funct. Program.", volume = "14", number = "1", year = "2004", pages = "3--19", URL = "https://dx.doi.org/10.1017/S0956796803004921", } @Article{appel04tplp, title = "Polymorphic Lemmas and Definitions in $\lambda${Prolog} and {Twelf}", author = "Andrew W. Appel and Amy P. Felty", journal = TPLP, year = "2004", number = "1-2", volume = "4", pages = "1--39", doi = "10.1017/S1471068403001698", } @InProceedings{appel99ccs, author = "Andrew W. Appel and Edward W. Felten", title = "Proof-carrying authentication", booktitle = "Proceedings of the 6th ACM Conference on Computer and Communications Security", year = "1999", pages = "52--62", organization = "ACM", } @InProceedings{appel99iclp, author = "Andrew W. Appel and Amy P. Felty", title = "Lightweight Lemmas in {Lambda} {Prolog}", booktitle = "16th International Conference on Logic Programming", pages = "411--425", year = "1999", month = nov, publisher = "MIT Press", } @Article{apt82jacm, author = "K. R. Apt and {M. H. van} Emden", title = "Contributions to the theory of logic programming", journal = jacm, volume = "29", number = "3", year = "1982", pages = "841--862", } @Article{apt94jlp, author = "K. R. Apt and R. Bol", title = "Logic programming and negation: a survey", journal = "Journal of Logic Programming", year = "1994", volume = "19-20", pages = "9--71", } @Article{apt94jlpb, author = "K. R. Apt and K. Doets", title = "A New Definition of {SLDNF}-Resolution", journal = "The Journal of Logic Programming", year = "1994", month = feb, volume = "18", number = "2", pages = "177--190", } @Article{arai00apal, author = "Noriko H. Arai", title = "Relative efficiency of propositional proof systems: resolution vs. cut-free {LK}", journal = apal, volume = "104", number = "1-3", pages = "3--16", year = "2000", doi = "10.1016/S0168-0072(00)00005-1", URL = "https://www.sciencedirect.com/science/article/pii/S0168007200000051", } @Book{arbib75a, author = "Michael A. Arbib and Ernest G. Manes", title = "{Arrows, Structures, and Functors: The Categorical Imperative}", publisher = "Academic Press", address = "New York", year = "1975", } @InProceedings{armand11cpp, author = "Micha{\"{e}}l Armand and Germain Faure and Benjamin Gr\'{e}goire and Chantal Keller and Laurent Th\'{e}ry and Benjamin Werner", title = "A modular integration of {SAT}/{SMT} solvers to {Coq} through proof witnesses", editor = "J.-P. Jouannaud and Z. Shao", series = lncs, volume = "7086", URL = "https://hal.inria.fr/docs/00/63/91/30/PDF/cpp11.pdf", booktitle = "Certified Programs and Proofs (CPP 2011)", pages = "135--150", year = "2011", } @Misc{armknecht15iacr, author = "Frederik Armknecht and Colin Boyd and Christopher Carr and Kristian Gj{\o}steen and Angela J{\"a}schke and Christian A. Reuter and Martin Strand", title = "A Guide to Fully Homomorphic Encryption", howpublished = "Cryptology ePrint Archive, Report 2015/1192", year = "2015", URL = "https://eprint.iacr.org/2015/1192", } @Article{aronsson90ngc, author = "M. Aronsson and L.-H. Eriksson and A. G{\"a}redal and L. Haln{\"a}s and P. Olin", title = "{GCLA}: a definitional approach to logic programming", journal = "New Generation Computing", year = "1990", volume = "4", pages = "381--404", } @Article{aschieri19mscs, title = "Expansion trees with cut", volume = "29", doi = "10.1017/S0960129519000069", number = "8", journal = "Mathematical Structures in Computer Science", publisher = "Cambridge University Press", author = "Federico Aschieri and Stefan Hetzl and Daniel Weller", year = "2019", pages = "1009--1029", } @Article{asperti03amai, title = "Mathematical Knowledge Management in {HELM}", author = "Andrea Asperti and Luca Padovani and Claudio Sacerdoti Coen and Ferruccio Guidi and Irene Schena", journal = "Ann. Math. Artif. Intell", year = "2003", number = "1-3", volume = "38", pages = "27--46", } @InCollection{asperti06tpp, title = "Crafting a proof assistant", author = "Andrea Asperti and Claudio Sacerdoti Coen and Enrico Tassi and Stefano Zacchiroli", booktitle = "Types for Proofs and Programs", pages = "18--32", year = "2006", publisher = "Springer", } @Article{asperti09sadhana, author = "A. Asperti and W. Ricciotti and C. Sacerdoti Coen and E. Tassi", title = "A compact kernel for the calculus of inductive constructions", journal = "S\={a}dhan\={a}", year = "2009", volume = "34", pages = "71--144", } @InProceedings{asperti09tphol, author = "Andrea Asperti and Wilmer Ricciotti and Claudio Sacerdoti Coen and Enrico Tassi", title = "Hints in unification", booktitle = "International Conference on Theorem Proving in Higher Order Logics", year = "2009", pages = "84--98", publisher = "Springer, Berlin, Heidelberg", } @InProceedings{asperti12aisc, title = "Proof, Message and Certificate", author = "Andrea Asperti", booktitle = "Intelligent Computer Mathematics - Proceedings of AISC, DML, and MKM 2012", publisher = pub-sv, year = "2012", volume = "7362", editor = "Johan Jeuring and John A. Campbell and Jacques Carette and Gabriel Dos Reis and Petr Sojka and Makarius Wenzel and Volker Sorge", pages = "17--31", series = lncs, doi = "10.1007/978-3-642-31374-5", } @InProceedings{asperti90popl, author = "A. Asperti and G.-L. Ferrari and R. Gorrieri", title = "Implicative formulae in the `proof as computations' analogy", booktitle = popl90, pages = "59--71", year = "1990", month = jan, publisher = "ACM", } @Book{asperti98cup, author = "A. Asperti and S. Guerrini", title = "The Optimal Implementation of Functional Programming Languages", pages = "340", publisher = "Cambridge Univ. Press", year = "1998", } @InProceedings{aspinall00tacas, author = "David Aspinall", title = "Proof General: {A} Generic Tool for Proof Development", booktitle = "Proceedings of TACAS 2000", pages = "38", year = "2000", number = "1785", series = lncs, } @InProceedings{aspinall02esop, author = "David Aspinall and Martin Hofmann", title = "Another Type System for In-Place Update", booktitle = "11th European Symposium on Programming (ESOP 2002)", series = lncs, volume = "2305", pages = "36--52", year = "2002", } @InProceedings{aspinall04cassis, author = "D. Aspinall and S. Gilmore and M. Hofmann and D. Sannella and I. Stark", title = "Mobile Resource Guarantees for Smart Devices", pages = "1--26", URL = "https://www.inf.ed.ac.uk/~stark/mrg-smart-devices.html", pdf = "https://www.inf.ed.ac.uk/~stark/mrg-smart-devices.pdf", editor = "G. Barthe and L. Burdy and M. Huisman and J.-L. Lanet and T. Muntean", booktitle = "Construction and Analysis of Safe, Secure and Interoperable Smart Devices: Proceedings of the International Workshop CASSIS~2004", publisher = PUB-SV, year = "2005", volume = "3362", series = lncs, } @PhdThesis{assaf15phd, author = "Ali Assaf", title = "A framework for defining computational higher-order logics", school = "\'Ecole Polytechnique", year = "2015", month = sep, } @InProceedings{assaf15pxtp, title = "Translating {HOL} to {Dedukti}", author = "Ali Assaf and Guillaume Burel", booktitle = "Proceedings of the Fourth Workshop on Proof eXchange for Theorem Proving, Px{TP} 2015, Berlin, Germany, August 2-3, 2015", year = "2015", volume = "186", editor = "Cezary Kaliszyk and Andrei Paskevich", pages = "74--88", series = "EPTCS", URL = "https://dx.doi.org/10.4204/EPTCS.186", } @InProceedings{assaf16types, title = "Expressing theories in the $\lambda$${\Pi}$-calculus modulo theory and in the {Dedukti} system", author = "Ali Assaf and Guillaume Burel and Raphal Cauderlier and David Delahaye and Gilles Dowek and Catherine Dubois and Fr{\'e}d{\'e}ric Gilbert and Pierre Halmagrand and Olivier Hermant and Ronan Saillard", booktitle = "TYPES: Types for Proofs and Programs", address = "Novi Sad, Serbia", year = "2016", } @Misc{assaf16unp, author = "Ali Assaf and Guillaume Burel and Rapha{\"e}l Cauderlier and David Delahaye and Gilles Dowek and Catherine Dubois and Fr\'ed\'eric Gilbert and Pierre Halmagrand and Olivier Hermant and Ronan Saillard", title = "Dedukti: a Logical Framework based on the $\lambda{\Pi}$-Calculus Modulo Theory", URL = "https://www.lsv.ens-cachan.fr/~dowek/Publi/expressing.pdf", year = "2016", } @Article{astesiano84, author = "E. Astesiano and G. Costa", title = "Distributive Semantics for Nondeterministic Typed $\lambda$-Calculi", journal = "Theoretical Computer Science", volume = "32", year = "1984", pages = "121--186", } @TechReport{attali94tr, author = "Isabelle Attali and Didier Parigot", title = "Integrating Natural Semantics and Attribute Grammars: the Minotaur System", institution = "INRIA", year = "1994", number = "2339", month = sep, } @Article{avellone15fi, author = "Alessandro Avellone and Camillo Fiorentini and Alberto Momigliano", title = "A Semantical Analysis of Focusing and Contraction in Intuitionistic Logic", journal = "Fundamenta Informaticae", volume = "140", number = "3-4", pages = "247--262", year = "2015", doi = "10.3233/FI-2015-1253", } @Article{avigad01jlap, title = "Algebraic proofs of cut elimination", author = "Jeremy Avigad", journal = jlap, year = "2001", number = "1-2", volume = "49", pages = "15--30", URL = "10.1016/S1567-8326(01)00009-1", } @Article{avigad03tocl, author = "Jeremy Avigad", title = "Eliminating Definitions and Skolem Functions in First-Order Logic", journal = "ACM Transactions on Computational Logic", volume = "4", pages = "402--415", year = "2003", } @Article{avigad04bsl, title = "Forcing in proof theory", author = "Jeremy Avigad", journal = "Bulletin of Symbolic Logic", year = "2004", number = "3", volume = "10", pages = "305--333", URL = "https://www.math.ucla.edu/~asl/bsl/1003/1003-001.ps", } @InCollection{avigad16sep, author = "Jeremy Avigad and Richard Zach", title = "The Epsilon Calculus", booktitle = "The Stanford Encyclopedia of Philosophy", editor = "Edward N. Zalta", howpublished = "\url{https://plato.stanford.edu/archives/sum2016/entries/epsilon-calculus/}", year = "2016", edition = "Summer 2016", publisher = "Metaphysics Research Lab, Stanford University", } @InCollection{avigad98handbook, author = "Jeremy Avigad and Solomon Feferman", title = "{G}{\"o}del's Functional (`Dialectica') Interpretation", booktitle = "Handbook of Proof Theory", publisher = "Elsevier Science Publishers", year = "1998", editor = "Samuel R. Buss", pages = "337--405", address = "Amsterdam", } @InProceedings{avron01ijcar, author = "Arnon Avron and Iddo Lev", title = "Canonical Propositional {Gentzen}-Type Systems", booktitle = "IJCAR 2001", pages = "529--544", year = "2001", editor = "R. Gor\'{e} and A. Leitsch and T. Nipkow", volume = "2083", series = lnai, publisher = "Springer", } @InProceedings{avron09tableaux, author = "Arnon Avron and Ori Lahav", title = "Canonical Constructive Systems", booktitle = tableaux09, pages = "62--76", year = "2009", editor = "Martin Giese and Arild Waller", number = "5607", series = lnai, } @TechReport{avron87, author = "Arnon Avron and Furio A. Honsell and Ian A. Mason", title = "Using Typed Lambda Calculus to Implement Formal Systems on a Machine", number = "ECS-LFCS-87-31", institution = "Laboratory for the Foundations of Computer Science, University of Edinburgh", month = jun, year = "1987", } @Article{avron91amai, author = "Arnon Avron", title = "Hypersequents, logical consequence and intermediate logics for concurrency.", journal = "Ann. Math. Artif. Intell.", volume = "4", year = "1991", pages = "225--248", } @Article{avron91ic, author = "Arnon Avron", title = "Simple Consequence Relation", journal = "Information and Computation", year = "1991", volume = "92", pages = "105--139", } @Article{avron92jar, author = "Arnon Avron and Furio Honsell and Ian A. Mason and Robert Pollack", title = "Using Typed Lambda Calculus to Implement Formal Systems on a Machine", journal = "Journal of Automated Reasoning", year = "1992", volume = "9", pages = "309--354", doi = "10.1007/BF00245294", } @InCollection{avron96elc, author = "Arnon Avron", title = "The method of hypersequents in the proof theory of propositional non-classical logics", booktitle = "Logic: from foundations to applications: European logic colloquium", year = "1996", pages = "1--32", publisher = "Clarendon Press", } @InProceedings{aydemir05tphols, title = "Mechanized Metatheory for the Masses: The {POPLmark} Challenge", author = "Brian E. Aydemir and Aaron Bohannon and Matthew Fairbairn and J. Nathan Foster and Benjamin C. Pierce and Peter Sewell and Dimitrios Vytiniotis and Geoffrey Washburn and Stephanie Weirich and Steve Zdancewic", year = "2005", publisher = "Springer", series = lncs, number = "3603", booktitle = "Theorem Proving in Higher Order Logics: 18th International Conference", pages = "50--65", doi = "10.1007/11541868_4", } @InProceedings{aydemir06lfmtp, author = "Brian Aydemir and Aaron Bohannon and Stephanie Weirich", title = "Nominal Reasoning Techniques in {Coq}", booktitle = "International Workshop on Logical Frameworks and Meta-Languages:Theory and Practice (LFMTP)", year = "2006", pages = "69--77", address = "Seattle, WA, USA", month = aug, } @Article{aydemir07entcs, title = "Nominal Reasoning Techniques in {Coq}: (Extended Abstract)", author = "Brian E. Aydemir and Aaron Bohannon and Stephanie Weirich", journal = "Electr. Notes Theor. Comput. Sci", year = "2007", number = "5", volume = "174", pages = "69--77", doi = "10.1016/j.entcs.2007.01.028", } @InProceedings{aydemir08popl, title = "Engineering Formal Metatheory", author = "Brian Aydemir and Arthur Chargu\'eraud and Benjamin C. Pierce and Randy Pollack and Stephanie Weirich", booktitle = popl08, publisher = "ACM", pages = "3--15", month = jan, year = "2008", } @TechReport{aydemir09tr, author = "Brian Aydemir and Stephan A. Zdancewic and Stephanie Weirich", title = "Abstracting syntax", institution = "University of Pennsylvania", year = "2009", number = "MS-CIS-09-06", } @InProceedings{azaiez16abz, title = "{Proving Determinacy of the PharOS Real-Time Operating System}", author = "Selma Azaiez and Damien Doligez and Matthieu Lemerre and Tomer Libal and Stephan Merz", URL = "https://hal.inria.fr/hal-01322335", booktitle = "{Abstract State Machines, Alloy, B, TLA, VDM, and Z - 5th International Conference, ABZ 2016}", address = "Linz, Austria", editor = "Michael J. Butler and Klaus-Dieter Schewe and Atif Mashkoor and Mikl{\'o}s Bir{\'o}", publisher = "Springer", series = lncs, volume = "9675", pages = "70--85", year = "2016", month = May, doi = "10.1007/978-3-319-33600-8\_4", pdf = "https://hal.inria.fr/hal-01322335/file/final.pdf", hal_id = "hal-01322335", hal_version = "v1", } @Article{baaz00jsc, author = "Matthias Baaz and Alexander Leitsch", title = "Cut-elimination and {R}edundancy-elimination by {R}esolution", journal = "Journal of Symbolic Computation", year = "2000", volume = "29", number = "2", pages = "149--176", } @Article{baaz03jlc, author = "Matthias Baaz and Agata Ciabattoni and Christian G. Ferm{\"u}ller", title = "Hypersequent Calculi for {G}{\"o}del Logics -- a Survey", journal = jlc, volume = "13", number = "6", year = "2003", pages = "835--861", } @Article{baaz11jsl, author = "Matthias Baaz and Stefan Hetzl", title = "On the non-confluence of cut-elimination", journal = jsl, year = "2011", volume = "76", number = "1", pages = "313--340", } @Article{baaz12jsl, author = "Matthias Baaz and Stefan Hetzl and Daniel Weller", title = "On the complexity of proof deskolemization", journal = jsl, year = "2012", doi = "10.2178/jsl/1333566645", volume = "77", number = "2", pages = "669--686", } @InProceedings{baaz15lics, author = "Matthias Baaz and Alexander Leitsch and Giselle Reis", title = "A Note on the Complexity of Classical and Intuitionistic Proofs", booktitle = "30th Annual {ACM/IEEE} Symposium on Logic in Computer Science, {LICS} 2015, Kyoto, Japan, July 6-10, 2015", pages = "657--666", year = "2015", URL = "https://dx.doi.org/10.1109/LICS.2015.66", doi = "10.1109/LICS.2015.66", } @Article{baaz94fi, author = "Matthias Baaz and Alexander Leitsch", title = "On Skolemization and Proof Complexity", journal = "Fundamenta Informaticae", volume = "20", pages = "353--379", number = "4", year = "1994", ISSN = "0169-2968", URL = "https://content.iospress.com/articles/fundamenta-informaticae/fi20-4-4", doi = "10.3233/FI-1994-2044", } @InCollection{bachmair01handbook, title = "Resolution Theorem Proving", author = "Leo Bachmair and Harald Ganzinger", chapter = "2", booktitle = "Handbook of Automated Reasoning", publisher = "Elsevier Science", address = "New York", editor = "A. Robinson and A. Voronkov", year = "2001", volume = "I", pages = "19--99", } @Article{bachmair94jlc, author = "Leo Bachmair and Harald Ganzinger", title = "Rewrite-Based Equational Theorem Proving with Selection and Simplification", journal = jlc, year = "1994", volume = "3", number = "4", } @InProceedings{backes10, title = "Analytic Tableaux for Higher-Order Logic with Choice", author = "Julian Backes and Chad E. Brown", year = "2010", address = "{Saarbr{\"u}cken, Germany}", booktitle = "Fifth International Joint Conference on Automated Reasoning (IJCAR 2010)", publisher = "Springer", note = "to appear", } @TechReport{baelde05stage, author = "David Baelde", title = "Logique lin\'eaire et alg\`ebre de processus", year = "2005", institution = "INRIA Futurs, LIX and ENS", URL = "https://www.lix.polytechnique.fr/parsifal/baelde05stage.ps", } @Manual{baelde06manual, title = "A User Guide to {Bedwyr}", author = "David Baelde and Andrew Gacek and Dale Miller and Gopalan Nadathur and Alwen Tiu", month = nov, pdf = "https://gforge.inria.fr/docman/view.php/367/705/userguide.pdf", year = "2006", } @InProceedings{baelde07cade, author = "David Baelde and Andrew Gacek and Dale Miller and Gopalan Nadathur and Alwen Tiu", title = "The {Bedwyr} system for model checking over syntactic expressions", booktitle = cade07, pages = "391--397", year = "2007", editor = "F. Pfenning", number = "4603", series = lnai, publisher = "Springer", address = "New York", URL = "https://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/cade2007.pdf", doi = "10.1007/978-3-540-73595-3_28", } @InProceedings{baelde07lpar, author = "David Baelde and Dale Miller", title = "Least and greatest fixed points in linear logic", booktitle = "International Conference on Logic for Programming and Automated Reasoning (LPAR)", editor = "N. Dershowitz and A. Voronkov", pages = "92--106", series = lncs, volume = "4790", year = "2007", doi = "10.1007/978-3-540-75560-9\_9", } @Unpublished{baelde07tr, author = "David Baelde and Dale Miller", title = "Least and greatest fixed points in linear logic: extended version", note = "Technical report, available from the first author's web page", month = apr, year = "2007", URL = "https://www.lix.polytechnique.fr/~dbaelde/productions/pool/mumall_draft_long.pdf", } % URL = "https://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/lpar07final.pdf", @InProceedings{baelde08jfla, author = "David Baelde and Samuel Mimram", title = "{De la webradio lambda \`a la $\lambda$-webradio}", booktitle = "Journ\'ees Francophones des Langages Applicatifs", editor = "Ensiie Cedric", year = "2008", location = "Etretat, France", pages = "47--61", publisher = "INRIA", ISBN = "2-7261-1295-1", pdf = "https://www.lix.polytechnique.fr/~dbaelde/productions/pool/jfla08.pdf", } @InProceedings{baelde08lfmtp, author = "David Baelde", title = "On the Expressivity of Minimal Generic Quantification", booktitle = lfmtp08, year = "2008", editor = "A. Abel and C. Urban", pages = "3--19", series = entcs, number = "228", doi = "10.1016/j.entcs.2008.12.113", } @PhdThesis{baelde08phd, author = "David Baelde", title = "A linear approach to the proof-theory of least and greatest fixed points", school = "Ecole Polytechnique", year = "2008", month = dec, URL = "https://arxiv.org/abs/0910.3383", } @TechReport{baelde08tr, author = "David Baelde", title = "On the Expressivity of Minimal Generic Quantification: Extended Version", institution = "INRIA/HAL", number = "inria-00284186", URL = "https://hal.inria.fr/inria-00284186", year = "2008", } @InProceedings{baelde09tableaux, author = "David Baelde", title = "On the proof theory of regular fixed points", booktitle = tableaux09, year = "2009", editor = "Martin Giese and Arild Waller", pages = "93--107", number = "5607", series = lnai, URL = "https://www.lix.polytechnique.fr/~dbaelde/productions/pool/baelde09tableaux.pdf", doi = "10.1007/978-3-642-02716-1_8", } @InProceedings{baelde10ijcar, author = "David Baelde and Dale Miller and Zachary Snow", title = "Focused Inductive Theorem Proving", booktitle = ijcar10, year = "2010", pages = "278--292", editor = "J. Giesl and R. H{\"a}hnle", series = lncs, number = "6173", doi = "10.1007/978-3-642-14203-1_24", } @InProceedings{baelde12lics, author = "David Baelde and Gopalan Nadathur", title = "Combining Deduction Modulo and Logics of Fixed-Point Definitions", booktitle = lics12, year = "2012", month = jun, pages = "105--114", location = "Dubrovnik, Croatia", publisher = "IEEE Computer Society Press", } % URL = "https://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/ijcar10.pdf", @Article{baelde12tocl, author = "David Baelde", title = "Least and greatest fixed points in linear logic", journal = tocl, month = apr, year = "2012", volume = "13", number = "1", doi = "10.1145/2071368.2071370", pages = "2:1--2:44", } @Article{baelde14jfr, author = "David Baelde and Kaustuv Chaudhuri and Andrew Gacek and Dale Miller and Gopalan Nadathur and Alwen Tiu and Yuting Wang", title = "Abella: {A} System for Reasoning about Relational Specifications", journal = "J. of Formalized Reasoning", year = "2014", volume = "7", number = "2", pages = "1--89", doi = "10.6092/issn.1972-5787/4650", } @InProceedings{baelde16csl, author = "David Baelde and Amina Doumane and Alexis Saurin", editor = "Jean{-}Marc Talbot and Laurent Regnier", title = "Infinitary Proof Theory: the Multiplicative Additive Case", booktitle = "25th {EACSL} Annual Conference on Computer Science Logic, {CSL} 2016, August 29 - September 1, 2016, Marseille, France", series = "LIPIcs", volume = "62", pages = "42:1--42:17", publisher = "Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik", year = "2016", URL = "https://doi.org/10.4230/LIPIcs.CSL.2016.42", doi = "10.4230/LIPIcs.CSL.2016.42", } @Article{baelde19mscs, title = "A special issue on structural proof theory, automated reasoning and computation in celebration of Dale Miller’s 60th birthday", volume = "29", doi = "10.1017/S0960129519000136", number = "8", journal = "Mathematical Structures in Computer Science", publisher = "Cambridge University Press", author = "David Baelde and Amy Felty and Gopalan Nadathur and Alexis Saurin", year = "2019", pages = "1007--1008", } @InProceedings{baelde22lics, author = "David Baelde and Amina Doumane and Denis Kuperberg and Alexis Saurin", editor = "Christel Baier and Dana Fisman", title = "Bouncing Threads for Circular and Non-Wellfounded Proofs: Towards Compositionality with Circular Proofs", booktitle = "{LICS} '22: 37th Annual {ACM/IEEE} Symposium on Logic in Computer Science, Haifa, Israel, August 2 - 5, 2022", pages = "63:1--63:13", publisher = "{ACM}", year = "2022", doi = "10.1145/3531130.3533375", } @Book{baier08book, title = "Principles of model checking", author = "Christel Baier and Joost-Pieter Katoen", publisher = "MIT Press", year = "2008", } @InProceedings{baillot04lics, author = "Patrick Baillot and Kazushige Terui", title = "Light Types for Polynomial Time Computation in Lambda-Calculus", booktitle = lics04, pages = "266--275", year = "2004", } @Article{baillot15ic, author = "Patrick Baillot", title = "On the expressivity of elementary linear logic: Characterizing Ptime and an exponential time hierarchy", journal = "Information and Compututation", volume = "241", pages = "3--31", year = "2015", doi = "10.1016/j.ic.2014.10.005", } @InProceedings{baillot16cls, author = "Patrick Baillot and Anupam Das", title = "{Free-Cut Elimination in Linear Logic and an Application to a Feasible Arithmetic}", booktitle = "25th EACSL Annual Conference on Computer Science Logic (CSL 2016)", pages = "40:1--40:18", series = "Leibniz International Proceedings in Informatics (LIPIcs)", year = "2016", volume = "62", editor = "Jean-Marc Talbot and Laurent Regnier", publisher = "Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik", address = "Dagstuhl, Germany", URL = "https://drops.dagstuhl.de/opus/volltexte/2016/6580", doi = "10.4230/LIPIcs.CSL.2016.40", } @Article{bainbridge90, author = "E. S. Bainbridge and Peter J. Freyd and Andre Scedrov and Philip J. Scott", title = "Functorial Polymorphism", journal = "Theoretical Computer Science", volume = "70", year = "1990", pages = "35--64", } @Article{balabonski23lmcs, title = "{A strong call-by-need calculus}", author = "Thibaut Balabonski and Antoine Lanco and Guillaume Melquiond", URL = "https://lmcs.episciences.org/11115", doi = "10.46298/lmcs-19(1:21)2023", journal = "{Logical Methods in Computer Science}", volume = "19", number = "1", year = "2023", month = Mar, } @Article{balbin91jlp, author = "I. Balbin and G. S. Port and K. Ramamohanarao and K. Meenakshi", title = "Efficient Bottom-{UP} Computation of Queries on Stratified Databases", volume = "11", number = "3 \& 4", month = oct # "/" # nov, pages = "295--344", journal = "Journal of Logic Programming", year = "1991", } @InProceedings{baldoni93ilps, author = "Matteo Baldoni and Laura Giordano and Alberto Martelli", title = "A Multimodal Logic to Define Modules in Logic Programming", booktitle = "Proceeding of the 1993 International Logic Programming Symposium", editor = "Dale Miller", month = oct, year = "1993", } @InProceedings{ball04ifm, title = "{SLAM} and Static Driver Verifier: Technology Transfer of Formal Methods inside {Microsoft}", author = "Thomas Ball and Byron Cook and Vladimir Levin and Sriram K. Rajamani", booktitle = "Proc.\ Integrated Formal Methods, 4th International Conference, {IFM} 2004, Canterbury, {UK}", publisher = pub-sv, year = "2004", volume = "2999", editor = "E. A. Boiten and J. Derrick and G. Smith", pages = "1--20", series = lncs, } @Article{banatre88fgcs, author = "J-P. Ban\^{a}tre and A. Coutant and D. Le M\'etayer", title = "A parallel machine for multiset transformation and its programming style", journal = "Future Generation Computer Systems", year = "1988", volume = "4", number = "2", pages = "133--145", } @Article{banatre93cacm, author = "Jean-Pierre Ban\^atre and Daniel Le M\'etayer", title = "{Programming by Multiset Transformation}", journal = "Communications of the ACM", year = "1993", volume = "36", number = "1", month = jan, pages = "98--111", } @InProceedings{banatre96cp, author = "Jean-Pierre Ban\^atre and Daniel Le M\'etayer", title = "Gamma and the chemical reaction model: ten years after", booktitle = "Coordination programming: {Mechanisms}, models and semantics", year = "1996", pages = "3--41", publisher = "World Scientific Publishing, IC Press", } @PhdThesis{banbara02phd, author = "Mutsunori Banbara", title = "Design and Implementation of Linear Logic Programming Languages", school = "Kobe University", year = "2002", month = sep, } @TechReport{barber96tr, author = "Andrew Barber and Gordon Plotkin", title = "Dual Intuitionistic Linear Logic", institution = "University of Edinburgh", year = "1996", number = "ECS-LFCS-96-347", } @InProceedings{barbosa17cade, author = "Haniel Barbosa and Jasmin Christian Blanchette and Pascal Fontaine", title = "Scalable Fine-Grained Proofs for Formula Processing", booktitle = "26th International Conference on Automated Deduction (CADE)", pages = "398--412", year = "2017", doi = "10.1007/978-3-319-63046-5\_25", editor = "Leonardo de Moura", series = lncs, volume = "10395", publisher = "Springer", } @InProceedings{barbuti87tapsoft, author = "R. Barbuti and P. Mancarella and D. Pedreschi and F. Turini", title = "Intensional Negation of Logic Programs: Examples and Implementation Techniques", year = "1987", pages = "96--110", booktitle = "Proc. of the TAPSOFT '87", publisher = pub-sv, series = lncs, number = "250", } @Article{barendregt02jar, author = "Henk Barendregt and Erik Barendsen", title = "Autarkic Computations in Formal Proofs", journal = jar, year = "2002", volume = "28", number = "3", pages = "321--336", doi = "10.1023/A:1015761529444", } @Article{barendregt05tars, author = "H. Barendregt and F. Wiedijk", title = "The Challenge of Computer Mathematics", journal = "Transactions A of the Royal Society", year = "2005", volume = "363", number = "1835", pages = "2351--2375", month = oct, } @Book{barendregt13book, author = "Henk Barendregt and Wil Dekkers and Richard Statman", title = "Lambda Calculus with Types", publisher = "Cambridge University Press", year = "2013", series = "Perspectives in Logic", } @Book{barendregt84, author = "Henk Barendregt", title = "The Lambda Calculus: Its Syntax and Semantics", edition = "revised", publisher = "Elsevier", address = "New York", volume = "103", series = "Studies in Logic and the Foundations of Mathematics", year = "1984", } @Book{barendregt84book, author = "Henk P. Barendregt", publisher = "North Holland", title = "The Lambda Calculus", year = "1984", } @Article{barendregt91jfp, author = "Henk P. Barendregt", title = "Introduction to generalized type systems", journal = "Journal of Functional Programming", year = "1991", volume = "1", number = "2", pages = "125--154", month = apr, } @Article{barendregt97bsl, author = "Henk Barendregt", title = "The impact of the lambda calculus in logic and computer science", journal = "Bulletin of Symbolic Logic", year = "1997", volume = "3", number = "2", pages = "181--215", } @InCollection{barendregt97handbook, author = "Henk Barendregt", title = "Lambda calculus with types", booktitle = "Handbook of Logic in Computer Science", publisher = "Oxford University Press", address = "Oxford, England", year = "1992", editor = "S. Abramsky and Dov M. Gabbay and T. S. E. Maibaum", volume = "2", pages = "117--309", } @Article{barr91mscs, title = "$\star$-{A}utonomous categories and linear logic", author = "M. Barr", journal = "Mathemathical Structures in Computer Science", year = "1991", volume = "1", number = "2", pages = "159--178", } @InCollection{basin93le, author = "David A. Basin and Robert L. Constable", title = "Metalogical Frameworks", editor = "G\'{e}rard Huet and Gordon D. Plotkin", booktitle = "Logical Environments", publisher = "Cambridge University Press", year = "1993", pages = "1--29", } % URL = "https://doi.org/10.1007/978-3-319-63046-5\_25", @InProceedings{basold19esop, author = "Henning Basold and Ekaterina Komendantskaya and Yue Li", editor = "Lu{\'{\i}}s Caires", title = "Coinduction in Uniform: Foundations for Corecursive Proof Search with {Horn} Clauses", booktitle = "28th European Symposium on Programming, {ESOP} 2019", series = lncs, volume = "11423", pages = "783--813", publisher = "Springer", month = apr, year = "2019", doi = "10.1007/978-3-030-17184-1\_28", } @InProceedings{basu01iclp, author = "Samik Basu and Madhavan Mukund and C. R. Ramakrishnan and I. V. Ramakrishnan and Rakesh M. Verma", title = "Local and Symbolic Bisimulation Using Tabled Constraint Logic Programming", booktitle = "International Conference on Logic Programming ({ICLP})", address = "Paphos, Cyprus", month = nov, series = lncs, volume = "2237", publisher = "Springer", pages = "166--180", year = "2001", } @Article{bates85, author = "Joseph L. Bates and Robert L. Constable", title = "Proofs as Programs", journal = "{ACM} Transactions on Programming Languages and Systems", month = jan, year = "1985", volume = "7", number = "1", pages = "113--136", } @InProceedings{battell16lfmtp, author = "Chelsea Battell and Amy P. Felty", editor = "Gilles Dowek and Daniel R. Licata and Sandra Alves", title = "The Logic of Hereditary Harrop Formulas as a Specification Logic for Hybrid", booktitle = "Workshop on Logical Frameworks and Meta-Languages: Theory and Practice, {LFMTP}", pages = "3:1--3:10", publisher = "{ACM}", year = "2016", doi = "10.1145/2966268.2966271", } @PhdThesis{baudot00phd, author = "R\'{e}mi Baudot", title = "Programmation Logique: Non commutativit\'{e} et Polarisation", school = "Universit\'{e} Paris 13, Laboratoire d'informatique de Paris Nord (L.I.P.N.)", year = "2000", month = dec, } @PhdThesis{bauer03phd, title = "Access Control For The Web Via", author = "Ljudevit Bauer", year = "2003", month = sep, school = "Princeton University", URL = "https://www.ece.cmu.edu/~lbauer/papers/thesis.pdf", } @InProceedings{baumgartner00cade, author = "Peter Baumgartner", title = "{FDPLL} -- {A} First-Order Davis-Putnam-Logeman-Loveland Procedure", pages = "200--219", booktitle = cade00, editor = "David McAllester", year = "2000", volume = "1831", series = lnai, publisher = "Springer", URL = "https://www.uni-koblenz.de/~peter/FDPLL/FDPLLshort.ps", } @InProceedings{beauguier11lfmtp, author = "Maxime Beauquier and Carsten Sch{\"u}rmann", title = "A Bigraph Relational Model", booktitle = lfmtp11, editor = "Herman Geuvers and Gopalan Nadathur", year = "2011", pages = "14--28", doi = "10.4204/EPTCS.71.2", series = eptcs, volume = "71", } @Article{beckert95jar, title = "{leanTAP}: Lean Tableau-based Deduction", author = "Bernhard Beckert and Joachim Posegga", journal = "Journal of Automated Reasoning", pages = "339--358", month = dec, year = "1995", volume = "15", number = "3", } @Article{beeri91jlp, author = "Catriel Beeri and Raghu Ramakrishnan", title = "On the Power of Magic", journal = "Journal of Logic Programming", volume = "10", number = "1/2/3{\&}4", year = "1991", pages = "255--299", } @Book{beeson85, author = "Michael Beeson", title = "Foundations of Constructive Mathematics", publisher = "Springer", year = "1985", } @Misc{beffara13intro, title = "Introduction to linear logic", author = "Emmanuel Beffara", publisher = "HAL CCSD", year = "2013", month = aug, abstract = "This manuscript is the lecture notes for the course of the same title I gave at the Summer school on linear logic and geometry of interaction that took place in Torino in August 2013. The aim of this course is to give a broad introduction to linear logic, covering enough ground to present many of the ideas and techniques of the field, while staying at a (hopefully) accessible level for beginners. For this reason, most technical development is carried out in the simple multiplicative fragment, with only hints at generalizations. As prerequisites, some knowledge of classical sequent calculus and some knowledge of the {$\lambda$}-calculus is useful.", URL = "https://hal.archives-ouvertes.fr/cel-01144229", } @Article{bellantoni92cc, author = "Stephen Bellantoni and Stephen Cook", title = "A New Recursion-Theoretic Characterization of the Polytime Functions", journal = "Computational Complexity", year = "1992", volume = "2", pages = "97--110", } @Article{bellin94tcs, author = "Gianluigi Bellin and Philip J. Scott", title = "On the Pi-calculus and linear logic", journal = "Theoretical Computer Science", year = "1994", volume = "135", pages = "11--65", } @Article{belnap82, author = "Nuel D. Belna{p, Jr.}", title = "Display Logic", journal = jpl, year = "1982", volume = "11", pages = "375--417", } @Misc{benet14ipfs, title = "{IPFS}-content addressed, versioned, {P2P} file system", author = "Juan Benet", journal = "arXiv preprint arXiv:1407.3561", year = "2014", doi = "10.48550/arxiv.1407.3561", } @InProceedings{bengtson07fossacs, author = "Jesper Bengtson and Joachim Parrow", title = "Formalising the $\pi$-Calculus Using Nominal Logic", booktitle = "Proceedings of FOSSACS 2007", year = "2007", publisher = "Springer", series = lncs, volume = "4423", pages = "63--77", } % URL = "https://arxiv.org/abs/1407.3561", @Article{bengtson09lmcs, author = "Jesper Bengtson and Joachim Parrow", title = "Formalising the $\pi$-Calculus Using Nominal Logic", journal = lmcs, year = "2009", volume = "5", number = "2", pages = "1--36", URL = "https://www.lmcs-online.org/ojs/viewarticle.php?id=515", doi = "10.2168/LMCS-5(2:16)2009", } @InCollection{benl98ad, author = "H. Benl and U. Berger and H. Schwichtenberg and M. Seisenberger and W. Zuber", title = "Proof theory at work: Program development in the Minlog system", booktitle = "Automated Deduction", publisher = "Kluwer", year = "1998", editor = "W. Bibel and P. H. Schmitt", volume = "II", } @TechReport{benthem93tr, author = "J. van Benthem and J. A. Bergstra", title = "Logic of transition systems", institution = "University of Amsterdam", year = "1993", type = "ILLC Prepublication Series for Computation and Complexity Theory", number = "CT-93-03", } @InProceedings{benton94csl, author = "Nick Benton", title = "A Mixed Linear and Non-Linear Logic: Proofs, Terms and Models", booktitle = csl94, pages = "121--135", year = "1994", editor = "Leszek Pacholski and Jerzy Tiuryn", volume = "933", series = lncs, address = "Kazimerz, Poland", month = sep, publisher = pub-sv, URL = "https://research.microsoft.com/en-us/um/people/nick/cslpaper.ps", } @TechReport{benton94tr, author = "Nick Benton", title = "A Mixed Linear and Non-Linear Logic: Proofs, Terms and Models", institution = "University of Cambridge Computer Laboratory", year = "1994", number = "UCAM-CL-TR-352", month = oct, URL = "https://research.microsoft.com/en-us/um/people/nick/mixed3.ps", } @Article{benzmueller02synthese, author = "Christoph Benzm{\"u}ller", title = "Comparing Approaches to Resolution based Higher-Order Theorem Proving", journal = "Synthese, An International Journal for Epistemology, Methodology and Philosophy of Science, Kluwer", year = "2002", note = "To appear", } @Unpublished{benzmueller02unp, author = "Christoph Benzm{\"u}ller and Chad E. Brown and Michael Kohlhase", title = "Semantic Techniques for Higher-Order Cut-Elimination", note = "manuscript, https://www.ags.uni-sb.de/\verb+~+chris/papers/R23.pdf", year = "2002", } @TechReport{benzmueller03tr, author = "Christoph Benzm{\"u}ller and and Chad E. Brown and Michael Kohlhase", title = "Higher-Order Semantics and Extensionality", year = "2003", institution = "Department of Mathematical Sciences, Carnegie Mellon University", type = "Research Report", number = "03-001", } @Article{benzmueller04jsl, author = "Christoph Benzm{\"u}ller and Chad Brown and Michael Kohlhase", title = "Higher-Order Semantics and Extensionality", journal = "Journal of Symbolic Logic", year = "2004", volume = "69", number = "4", pages = "1027--1088", } @TechReport{benzmueller04tr, author = "Christoph Benzm{\"u}ller and Chad E. Brown and Michael Kohlhase", title = "Semantic Techniques for Higher-Order Cut-Elimination", institution = "Saarland University, Saarbr{\"u}cken, Germany", year = "2004", type = "SEKI Technical Report", number = "SR-2004-07", note = "Available at: \url{https://www.ags.uni-sb.de/~chris/papers/R37.pdf}", } @Article{benzmueller09lmcs, author = "C. Benzm{\"u}ller and C. E. Brown and M. Kohlhase", title = "Cut-Simulation and Impredicativity", journal = "Logical Methods in Computer Science", year = "2009", volume = "5", number = "1", pages = "1--21", doi = "10.2168/LMCS-5(1:6)2009", } @InCollection{benzmueller14lc, author = "Christoph Benzm{\"u}ller and Dale Miller", title = "Automation of Higher-Order Logic", booktitle = "Computational Logic", publisher = "North Holland", year = "2014", editor = "J. Siekmann", volume = "9", pages = "215--254", series = "Handbook of the History of Logic", ISBN = "978-0-444-51624-4", doi = "10.1016/B978-0-444-51624-4.50005-8", } @InCollection{benzmueller19sep, author = "Christoph Benzm{\" u}ller and Peter Andrews", title = "{Church’s Type Theory}", booktitle = "The {Stanford} Encyclopedia of Philosophy", editor = "Edward N. Zalta", howpublished = "\url{https://plato.stanford.edu/archives/sum2019/entries/type-theory-church/}", year = "2019", edition = "Summer 2019", publisher = "Metaphysics Research Lab, Stanford University", } @TechReport{benzmueller97tr, author = "Christoph Benzm{\"u}ller", title = "A Calculus and a System Architecture for Extensional Higher-Order Resolution", institution = "Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh,USA", year = "1997", month = jun, type = "Research Report", number = "97-198", } @TechReport{benzmueller97tra, author = "Christoph Benzm{\"u}ller and Michael Kohlhase", title = "Model Existence for Higher-Order Logic", institution = "Saarland University", year = "1997", type = "SEKI-Report", number = "SR-97-09", } @TechReport{benzmueller97trb, author = "Christoph Benzm{\"u}ller and Michael Kohlhase", title = "Resolution for {Henkin} Models", institution = "Universit{\"a}t des Saarlandes", year = "1997", type = "SEKI-Report", number = "SR-97-10", } @InProceedings{benzmueller98cadea, author = "Christoph Benzm{\"u}ller and Michael Kohlhase", title = "Extensional Higher Order Resolution", pages = "56--72", booktitle = cade98, year = "1998", } @InProceedings{benzmueller98cadeb, author = "Christoph Benzm{\"u}ller and Michael Kohlhase", title = "{LEO} -- a Higher Order Theorem Prover", pages = "139--144", booktitle = cade98, year = "1998", } @InProceedings{benzmueller99cade, author = "Christoph Benzm{\"u}ller", title = "Extensional Higher-Order Paramodulation and {RUE}-Resolution", year = "1999", booktitle = "Proceedings of the 16th International {C}onference on {A}utomated {D}eduction", editor = "Harald Ganzinger", publisher = "Springer", address = "Trento, Italy", series = lnai, number = "1632", URL = "https://www.ags.uni-sb.de/\textasciitilde chris/papers/cade99.ps.gz", pages = "399--413", } @PhdThesis{benzmueller99phd, author = "Christoph Benzm{\"u}ller", title = "Equality and Extensionality in Automated Higher-Order Theorem Proving", school = "Saarland University", year = "1999", URL = "https://www.ags.uni-sb.de/\textasciitilde chris/papers/diss.ps.gz", } @InCollection{benzmuller08thf0, title = "{THF0}--the core of the {TPTP} language for higher-order logic", author = "Christoph Benzm{\"u}ller and Florian Rabe and Geoff Sutcliffe", booktitle = "Automated Reasoning", pages = "491--506", year = "2008", publisher = "Springer", } @InProceedings{benzmuller16ki, title = "An object-logic explanation for the inconsistency in {G}{\"o}del’s ontological theory", author = "Christoph Benzm{\"u}ller and B Woltzenlogel Paleo", booktitle = "KI 2016: Advances in Artificial Intelligence", pages = "244--250", series = lncs, number = "10505", publisher = "Springer", year = "2016", } @InProceedings{berardi05galop, title = "Games with 1-backtracking", author = "Stefano Berardi and Thierry Coquand and Susumu Hayashi", booktitle = "Games for Logic and Programming Languages ({GALOP} 2005)", year = "2005", editor = "Dan R. Ghica and Guy McCusker", pages = "210--225", } @Article{berger06sl, title = "Program Extraction from Normalization Proofs", author = "Ulrich Berger and Stefan Berghofer and Pierre Letouzey and Helmut Schwichtenberg", journal = "Studia Logica", year = "2006", number = "1", volume = "82", pages = "25--49", URL = "https://dx.doi.org/10.1007/s11225-006-6604-5", } @InProceedings{berger11calco, author = "Ulrich Berger and Kenji Miyamoto and Helmut Schwichtenberg and Monika Seisenberger", editor = "Andrea Corradini and Bartek Klin and Corina C{\^{\i}}rstea", title = "Minlog - {A} Tool for Program Extraction Supporting Algebras and Coalgebras", booktitle = "Algebra and Coalgebra in Computer Science - 4th International Conference, {CALCO} 2011, Winchester, UK, August 30 - September 2, 2011. Proceedings", series = "Lecture Notes in Computer Science", volume = "6859", pages = "393--399", publisher = "Springer", year = "2011", doi = "10.1007/978-3-642-22944-2\_29", } @TechReport{bernadet11blong, author = "Alexis Bernadet and {St\'ephane} Lengrand", title = "Filter models: non-idempotent intersection types, orthogonality and polymorphism - Long version", institution = "Laboratoire d'informatique de l'{\'e}cole polytechnique - LIX, CNRS-Ecole Polytechnique-INRIA", year = "2011", month = jun, number = "hal-00600070", URL = "https://hal.archives-ouvertes.fr/hal-00600070/en/", } @InProceedings{bernadet11csl, author = "Alexis Bernadet and {St\'ephane} Lengrand", title = "Filter models: non-idempotent intersection types, orthogonality and polymorphism", booktitle = "Proceedings of the 20th Annual conference of the European Association for Computer Science Logic (CSL'11)", editor = "Marc Bezem", month = sep, year = "2011", place = "Bergen, Norway", publisher = lci, series = lipics, } @InProceedings{bernadet11fossacs, author = "Alexis Bernadet and {St\'ephane} Lengrand", title = "Complexity of strongly normalising $\lambda$-terms via non-idempotent intersection types", booktitle = "Proceedings of the 14th international conference on Foundations of Software Science and Computation Structures (FOSSACS'11)", editor = "Martin Hofmann", publisher = "Springer", series = lncs, volume = "6604", month = mar, year = "2011", place = "Saarbruecken, Germany", } @Unpublished{bernadet13a, author = "Alexis Bernadet and {St\'ephane} Graham-Lengrand", title = "A big-step operational semantics via non-idempotent intersection types", year = "2013", month = apr, note = "Submitted", } @Article{bernadet13lmcs, author = "Alexis Bernadet and {St\'ephane} Graham-Lengrand", title = "Non-idempotent intersection types and strong normalisation", year = "2013", journal = lmcs, volume = "9", number = "4", doi = "10.2168/LMCS-9(4:3)2013", URL = "https://arxiv.org/abs/1310.1622", } @Article{bernays45jsl, title = "Review of ``Untersuchungen zum Pr{\"a}dikatenkalkul'' by Oiva Ketonen", author = "Paul Bernays", journal = "Journal of Symbolic Logic", volume = "10", number = "4", year = "1945", } @InCollection{bernays68, author = "P. Bernays", title = "On the original {Gentzen} consistency proof for number theory", booktitle = "Intuitionism and Proof Theory", editor = "Kino and Myhill and Vesley", year = "1968", } @Article{bernerslee01sa, author = "Tim Berners-Lee and James Hendler and Ora Lassila", title = "The Semantic Web", journal = "Scientific American Magazine", year = "2001", month = may, } @TechReport{bernerslee98semantic, author = "Tim Berners-Lee", title = "Semantic {Web} road map", institution = "\uppercase{W}3\uppercase{C} Design Issues", URL = "https://www.w3.org/DesignIssues/Semantic.html", year = "1998", } @InProceedings{bernstein98lics, author = "Karen L. Bernstein", title = "A Congruence Theorem for Structured Operational Semantics of Higher-Order Languages", booktitle = lics98, editor = "John Mitchell", year = "1998", publisher = "IEEE", month = jun, pages = "153--163", } @InProceedings{berry90popl, author = "G. Berry and G. Boudol", title = "The Chemical Abstract Machine", booktitle = popl90, pages = "81--94", year = "1990", publisher = "ACM", } @Article{berry90tcs, author = "G. Berry and G. Boudol", title = "The Chemical Abstract Machine", year = "1992", journal = "Theoretical Computer Science", volume = "96", pages = "217--248", } @Book{bertot04book, author = "Yves Bertot and Pierre Cast\'eran", title = "Interactive Theorem Proving and Program Development. Coq'Art: The Calculus of Inductive Constructions", series = "Texts in Theoretical Computer Science", year = "2004", publisher = "Springer", URL = "https://www.labri.fr/publications/l3a/2004/BC04", } @InProceedings{bertot08entcs, title = "Inductive and Coinductive Components of Corecursive Functions in Coq", author = "Yves Bertot and Ekaterina Komendantskaya", number = "5", booktitle = "Proceedings of the Ninth Workshop on Coalgebraic Methods in Computer Science, CMCS 2008, Budapest, Hungary, April 4-6, 2008", publisher = "Elsevier", year = "2008", volume = "203", booktitle = "CMCS", editor = "Jir{\'i} Ad{\'a}mek and Clemens Kupke", pages = "25--47", series = "Electronic Notes in Theoretical Computer Science", } @InProceedings{best96concur, author = "Eike Best and Catuscia Palamidessi", title = "Linear Constraint Systems as High-level Nets", booktitle = "Proc. of CONCUR 96", editor = "U.~Montanari and V.~Sassone", volume = "1119", series = lncs, year = "1996", publisher = "Springer", pages = "498--513", } @InProceedings{best97coor, author = "Eike Best and Frank S. de Boer and Catuscia Palamidessi", title = "Partial Order and {SOS} Semantics for Linear Constraint Programs", booktitle = "Proc. of Coordination 97", editor = "D. Garlan and D. Le M\'etayer", volume = "1282", series = lncs, year = "1997", publisher = "Springer", pages = "256--273", } @InProceedings{best97coordination, author = "E. Best and F. S. de Boer and C. Palamidessi", title = "{Partial Order and SOS Semantics for Linear Constraint Programs}", booktitle = "Proc. of Coordination 97", editor = "D. Garlan and D. Le M\'etayer", volume = "1282", series = lncs, pages = "256--273", publisher = "Springer", year = "1997", } @Book{beth59book, author = "E. W. Beth", title = "The Foundations of Mathematics", publisher = "North Holland, Amsterdam", year = "1959", note = "Also published by Harper \& Row, New York (1966)", } @InProceedings{bezem01csl, author = "Marc Bezem", title = "An Improved Extensionality Criterion for Higher-Order Logic Programs", booktitle = "CSL: 15th Workshop on Computer Science Logic", editor = "Laurent Fribourg", series = lncs, number = "2142", pages = "203--216", publisher = "Springer-Verlag", year = "2001", } @Article{bibel81, author = "Wolfgang Bibel", title = "Matrices with Connections", journal = jacm, volume = "28", year = "1981", pages = "633--645", } @Book{bibel82, author = "Wolfgang Bibel", title = "Automated Theorem Proving", publisher = "Friedr. Vieweg \& Sohn", address = "Braunschweig/Wiesbaden", year = "1982", } @InBook{bibel82lc, author = "W. W. Bibel", title = "Computationally Improved Versions of {Herbrand's} Theorem", publisher = "North-Holland", year = "1982", edition = "Logic Colloquium '81", pages = "11--28", } @Article{bibel86ngc, author = "W.~Bibel", title = "A deductive solution for plan generation", journal = "New Generation Computing", year = "1986", volume = "4", pages = "115--132", } @Book{bibel87book, author = "W. ~Bibel", title = "Automated Theorem Proving", publisher = "Vieweg Verlag, Braunschweig", year = "1987", edition = "second edition", } @Book{bibel98book, key = "Bibel", title = "Automated Deduction -- {A} Basis for Applications", booktitle = "Automated Deduction -- A Basis for Applications", publisher = "Kluwer", year = "1998", editor = "Wolfgang Bibel and Peter Schmitt", } @Article{bierman00sl, author = "G. M. Bierman and Valeria de Paiva", title = "On an Intuitionistic Modal Logic", journal = "Studia Logica", year = "2000", volume = "65", number = "3", pages = "383--416", } @PhdThesis{bierman94phd, author = "G. Bierman", title = "On Intuitionistic Linear Logic", school = "Computing Laboratory, University of Cambridge", year = "1994", } % DM Found not doi for this thesis or associated tech report @TechReport{bierman98tr, author = "G. M. Bierman", title = "Multiple modalities", institution = "University of Cambridge Computer Laboratory", year = "1998", number = "455", month = dec, } @Book{bimbo15book, author = "Katalin Bimb{\'{o}}", title = "Proof Theory: Sequent Calculi and Related Formalisms", publisher = "CRC Press", year = "2015", } @Article{bimbo15tcs, author = "Katalin Bimb{\'{o}}", title = "The decidability of the intensional fragment of classical linear logic", journal = "Theor. Comput. Sci.", volume = "597", pages = "1--17", year = "2015", URL = "https://dx.doi.org/10.1016/j.tcs.2015.06.019", doi = "10.1016/j.tcs.2015.06.019", } @InCollection{bimbo22essays, author = "Katalin Bimb\'{o} and J. Michael Dunn", title = "Modalities in lattice-{R}", booktitle = "Relevance Logics and other Tools for Reasoning. Essays in Honor of J. Michael Dunn", publisher = "College Publications", year = "2022", pages = "89--127", address = "London UK", } @Book{bird88, author = "Richard Bird and Philip Wadler", title = "Introduction to Functional Programming", publisher = "Prentice Hall", year = "1988", } @Article{birkhoff35cps, author = "G. Birkhoff", title = "On the structure of abstract algebras", journal = "Proceedings of the Cambridge Philosophical Society", year = "1935", volume = "31", pages = "310--326", } @Article{bistarelli05jcs, title = "Relating multiset rewriting and process algebras for security protocol analysis", author = "Stefano Bistarelli and Iliano Cervesato and Gabriele Lenzini and Fabio Martinelli", journal = "Journal of Computer Security", year = "2005", number = "1", volume = "13", pages = "3--47", } @Book{bjorner, editor = "D. Bj{\o}rner and A. Ershov and N. Jones", title = "Proceedings of the {IFIP} Workshop on Partial Evaluation and Mixed Computation", publisher = "North-Holland", year = "1988", } @Misc{blanc16lsc, author = "Horace Blanc and Beniamino Accattoli", title = "Relating $\pi$-calculus and $\lambda$-calculus by means of the linear substitution calculus", howpublished = "Available at \url{https://github.com/abella-prover/abella/tree/master/examples/process-calculi/pic_lambda}", year = "2016", } @InProceedings{blanchet03ppdp, author = "Bruno Blanchet", title = "Automatic verification of cryptographic protocols: a logic programming approach", booktitle = "PPDP '03: Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming", year = "2003", pages = "1--3", location = "Uppsala, Sweden", editor = "Dale Miller", publisher = "ACM", address = "New York, NY, USA", } @InProceedings{blanco15iwil, author = "Roberto Blanco and Tomer Libal and Dale Miller", title = "Defining the meaning of {TPTP} formatted proofs", URL = "https://www.eprover.org/EVENTS/IWIL-2015.html", booktitle = "IWIL-2015. 11th International Workshop on the Implementation of Logics", editor = "Boris Konev and Stephan Schulz and Laurent Simon", series = "EPiC Series in Computing", volume = "40", pages = "78--90", year = "2016", publisher = "EasyChair", } @InProceedings{blanco15wof, author = "Roberto Blanco and Dale Miller", title = "Proof Outlines as Proof Certificates: a system description", year = "2015", URL = "https://www.eprover.org/EVENTS/IWIL-2015.html", month = nov, editor = "Iliano Cervesato and Carsten Sch{\"u}rmann", booktitle = "Proceedings First International Workshop on Focusing", series = "Electronic Proceedings in Theoretical Computer Science", volume = "197", publisher = "Open Publishing Association", pages = "7--14", doi = "10.4204/EPTCS.197.2", } @InProceedings{blanco17cade, author = "Roberto Blanco and Zakaria Chihani and Dale Miller", title = "Translating Between Implicit and Explicit Versions of Proof", booktitle = "Automated Deduction - {CADE} 26 - 26th International Conference on Automated Deduction, Gothenburg, Sweden, August 6-11, 2017, Proceedings", pages = "255--273", year = "2017", doi = "10.1007/978-3-319-63046-5\_16", editor = "Leonardo de Moura", series = lncs, volume = "10395", publisher = "Springer", } @InProceedings{blanco17lfmtp, author = "Roberto Blanco and Dale Miller and Alberto Momigliano", title = "Property-Based Testing via Proof Reconstruction", booktitle = "Work-in-Progress Proceedings of the Workshop on Logical Frameworks and Meta-Languages: Theory and Practice", pages = "17--22", year = "2017", URL = "https://www.dimi.uniud.it/la-ricerca/pubblicazioni/preprints/5.2017/", editor = "Marino Miculan and Florian Rabe", series = "Technical reports of DIMI, University of Udine", } @PhdThesis{blanco17phd, author = "Roberto Blanco", title = "Applications for Foundational Proof Certificates in theorem proving", school = "Universit{\'e} Paris-Saclay", year = "2017", month = dec, URL = "https://tel.archives-ouvertes.fr/tel-01743857", } @InProceedings{blanco19ppdp, author = "Roberto Blanco and Dale Miller and Alberto Momigliano", title = "Property-Based Testing via Proof Reconstruction", booktitle = "Principles and Practice of Programming Languages 2019 (PPDP '19)", year = "2019", editor = "E. Komendantskaya", month = oct, doi = "10.1145/3354166.3354170", } @TechReport{blanco20coq, author = "Roberto Blanco and Matteo Manighetti and Dale Miller", title = "{FPC}-Coq: Using {ELPI} to elaborate external proof evidence into Coq proofs", institution = "Inria", year = "2020", number = "hal-02974002", URL = "https://hal.inria.fr/hal-02974002", month = jul, note = "Presented at the Coq Workshop 2020", } @InCollection{blass87ctl, author = "A. Blass and Y. Gurevich", title = "Existential Fixed-Point Logic", booktitle = "Computation Theory and Logic", editor = "E. B{\"o}rger", publisher = "Springer", series = lncs, number = "270", year = "1987", pages = "20--36", } @Article{blass92apal, author = "Andreas Blass", title = "A game semantics for linear logic", journal = apal, volume = "56", year = "1992", pages = "183--220", note = "{Special Volume dedicated to the memory of John Myhill}", } @Article{blass97igpl, author = "Andreas Blass", title = "Some Semantical Aspects of Linear Logic.", journal = "Logic Journal of the IGPL", volume = "5", number = "4", year = "1997", } @Article{bledsoe71, author = "W. W. Bledsoe", title = "Splitting and Reduction Heuristics in Automatic Theorem Proving", journal = "Artificial Intelligence", volume = "2", year = "1971", pages = "55--77", } @Article{bledsoe74, author = "W. W. Bledsoe and Peter Bruell", title = "A Man-Machine Theorem-Proving System", journal = "Artificial Intelligence", volume = "5", year = "1974", pages = "51--72", } @Article{bledsoe77, author = "W. W. Bledsoe", title = "Non-resolution Theorem Proving", journal = "Artificial Intelligence", volume = "9", year = "1977", pages = "1--35", } @TechReport{bledsoe78, author = "W. W. Bledsoe and Mabry Tyson", title = "The {UT} Interactive Prover", number = "ATP-17A", institution = "University of Texas at Austin", month = jun, year = "1978", } @InCollection{bledsoe79, author = "W. W. Bledsoe", title = "A Maximal Method for Set Variables in Automatic Theorem-proving", booktitle = "Machine Intelligence 9", editor = "J. E. Hayes and Donald Michie and L. I. Mikulich", publisher = "John Wiley \&\ Sons", year = "1979", pages = "53--100", } @TechReport{bledsoe83, author = "W. W. Bledsoe", title = "The {UT} Prover", number = "ATP-17B", institution = "University of Texas at Austin", month = apr, year = "1983", } @Book{bledsoe84, editor = "W. W. Bledsoe and D. Loveland", title = "Automated Theorem Proving: After 25 Years", publisher = "American Math Society", volume = "19", series = "Contemporary Mathematics Series", year = "1984", } % URL = "https://doi.org/10.1007/978-3-319-63046-5\_16", @InProceedings{bledsoe86, author = "W. W. Bledsoe", title = "Some Thoughts on Proof Discovery", booktitle = "Third Annual IEEE Symposium on Logic Programming", address = "Salt Lake City, Utah", month = sep, year = "1986", pages = "2--10", note = "MCC Tech Report AI-208-86 June 1986", } @InProceedings{bloom88popl, author = "B. Bloom and S. Istrail and A. Meyer", title = "Bisimulation can't be traced", booktitle = "Proceedings of {POPL} 1988", year = "1988", publisher = "ACM", } @Article{bloom95jacm, author = "Bard Bloom and Sorin Istrail and Albert R. Meyer", title = "Bisimulation Can't be Traced", journal = "Journal of the {ACM}", volume = "42", number = "1", month = jan, year = "1995", pages = "232--268", note = "{Preliminary version appeared in {POPL} 1988: 229-239.}", } @Article{blossey06tcsb, author = "Ralf Blossey and Luca Cardelli and Andrew Phillips", title = "A Compositional Approach to the Stochastic Dynamics of Gene Networks", journal = "Transactions on Computational Systems Biology", volume = "IV", year = "2006", pages = "99--122", number = "3939", publisher = "Springer", editor = "Corrado Priami and Luca Cardelli and Stephen Emmott", ISBN = "3-540-33245-6", series = "Lecture Notes in Computer Science", } @Article{blum09lmcs, author = "William Blum and C.-H. Luke Ong", title = "The Safe Lambda Calculus", journal = lmcs, year = "2009", volume = "5", number = "1", pages = "1--38", URL = "https://lmcs-online.org/ojs/viewarticle.php?id=424", doi = "10.2168/LMCS-5(1:3)2009", } @PhdThesis{boehme11phd, author = "Sascha B{\"o}hme", title = "Proving Theorems of Higher-Order Logic with {SMT} Solvers", school = "Institut für Informatik, TU M{\"u}nchen", year = "2011", } @InProceedings{boehme11pxtp, author = "Sascha B{\"o}hme and Tjark Weber", title = "Designing Proof Formats: {A} User's Perspective", editor = "Pascal Fontaine and Aaron Stump", booktitle = "PxTP 2011: First International Workshop on Proof eXchange for Theorem Proving", pages = "27--32", month = aug, year = "2011", } @InProceedings{boer89iclp, author = "F. S. de Boer and J. N. Kok and C. Palamidessi and J. J. M. M. Rutten", title = "Semantic Models for a Version of {PARLOG}", pages = "621--636", editor = "G. Levi and M. Martelli", booktitle = "Sixth International Logic Programming Conference", address = "Lisbon, Portugal", publisher = "MIT Press", month = jun, year = "1989", } @InProceedings{boer90naclp, author = "Frank S. de Boer and Catuscia Palamidessi", title = "Concurrent Logic Programming: Asynchronism and Language Comparison", pages = "175--194", booktitle = "Proceedings of the 1990 North American Conference on Logic Programming", year = "1990", publisher = "MIT Press", } @InProceedings{boer91concur, author = "F. S. de~Boer and C.~Palamidessi", title = "{Embedding as a tool for language comparison: On the {CSP} hierarchy}", booktitle = "Proc. of CONCUR'91", series = lncs, publisher = "Springer", volume = "527", pages = "127--141", year = "1991", editor = "J. C. M. Baeten and J. F. Groote", } @InProceedings{boer91tapsoft, author = "F. S. de~Boer and C.~Palamidessi", title = "A fully abstract model for concurrent constraint programming", booktitle = "Proceedings of TAPSOFT/CAAP", editor = "S.~Abramsky and T. S. E. Maibaum", volume = "493", series = lncs, year = "1991", publisher = "Springer", pages = "296--319", } @InProceedings{boer92jicslp, author = "Frank S. de Boer and Catuscia Palamidessi", title = "A Process Algebra of Concurrent Constraint Programming", pages = "463--477", booktitle = "Proceedings of the Joint International Conference and Symposium on Logic Programming", publisher = "MIT Press", editor = "K. Apt", year = "1992", } @Article{boer94ic, author = "F. S. de Boer and C. Palamidessi", title = "{Embedding as a Tool for Language Comparison}", journal = "Information and Computation", volume = "108", number = "1", year = "1994", pages = "128--157", } @InProceedings{boer94popl, author = "F. S. de~Boer and M. Gabbrielli and E.~Marchiori and C. Palamidessi", title = "Proving concurrent constraint programs correct", booktitle = "Proceeding of the twentieth ACM Symposium on Principles of Programming Languages", year = "1994", publisher = "ACM", pages = "98--108", } @Article{boer95tcs, author = "F. S. de Boer and A. Di Pierro and C. Palamidessi", title = "Infinite computations in nondeterministic constraint programming", journal = "Theoretical Computer Science", volume = "151", number = "1", year = "1995", pages = "37--78", } @Article{boer97jlc, author = "F. S. de Boer and A. Di Pierro and C. Palamidessi", title = "An algebraic perspective of constraint logic programming", journal = jlc, volume = "7", number = "1", year = "1997", pages = "1--38", } @Article{boer97toplas, author = "F. S. de~Boer and M. Gabbrielli and E.~Marchiori and C. Palamidessi", title = "{Proving Concurrent Constraint Programs Correct}", journal = "ACM Transactions on Programming Languages and Systems", volume = "19", number = "5", pages = "685--725", year = "1997", } @PhdThesis{boespflug11phd, author = "Mathieu Boespflug", title = "Conception d'un noyau de v\'erification de preuves pour le $\lambda{\Pi}$-calcul modulo", school = "Ecole Polytechnique", year = "2011", } @InProceedings{boespflug12pxtpa, title = "CoqIn{E} : Translating the calculus of inductive constructions into the $\lambda{\Pi}$-calculus modulo", author = "Mathieu Boespflug and Guillaume Burel", year = "2012", booktitle = "Second International Workshop on Proof Exchange for Theorem Proving (PXTP 2012)", URL = "https://hal.archives-ouvertes.fr/hal-01126128", } @InProceedings{boespflug12pxtpb, author = "Mathieu Boespflug and Quentin Carbonneaux and Olivier Hermant", title = "The $\lambda{\Pi}$-calculus modulo as a universal proof language", booktitle = "Proceedings of PxTP2012: Proof Exchange for Theorem Proving", pages = "28--43", year = "2012", editor = "David Pichardie and Tjark Weber", } @Article{bohm85tcs, author = "C. Bohm and A. Berarducci", title = "Automatic synthesis of typed $\lambda$-programs on term algebras", journal = "Theoretical Computer Science", volume = "39", number = "2-3", pages = "135--153", month = aug, year = "1985", } @InCollection{bohme2010sledgehammer, title = "Sledgehammer: judgement day", author = "Sascha B{\"o}hme and Tobias Nipkow", booktitle = "Automated Reasoning", pages = "107--121", year = "2010", publisher = "Springer", } @Article{bojadziev86jlp, author = "Damjan Bojad\v{z}iev", title = "A Constructive View of {P}rolog", journal = "The Journal of Logic Programming", year = "1986", month = apr, volume = "3", number = "1", pages = "69--74", } @Article{bol91tcs, author = "R. N. Bol and K. R. Apt and J. W. Klop", title = "An analysis of loop checking mechanisms for logic programs", journal = "Theoretical Computer Science", volume = "86", number = "1", pages = "35--79", month = aug, year = "1991", } @InProceedings{bolignano93amast, author = "D. Bolignano and M. Debabi", title = "A coherent type inference system for a concurrent, functional and imperiative programming language", booktitle = "AMAST'93 Conference", publisher = "Springer", month = jun, year = "1993", } @Article{bollen91jar, author = "A. W. Bollen", title = "Relevant Logic Programming", journal = "Journal of Automated Reasoning", volume = "7", number = "4", year = "1991", month = dec, pages = "563--586", } @Article{bonacina11jar, author = "Maria Paola Bonacina and Christopher Lynch and Leonardo Mendon{\c{c}}a de Moura", title = "On Deciding Satisfiability by Theorem Proving with Speculative Inferences", journal = jar, volume = "47", number = "2", pages = "161--189", year = "2011", doi = "10.1007/s10817-010-9213-y", } @InProceedings{bonchi13popl, title = "Checking {NFA} equivalence with bisimulations up to congruence", author = "Filippo Bonchi and Damien Pous", booktitle = "ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL)", pages = "457--468", year = "2013", publisher = "ACM", } @InProceedings{bonner89naclp, author = "Anthony J. Bonner and L. Thorne McCarty and Kumar Vadaparty", title = "Expressing Database Queries with Intuitionistic Logic", booktitle = "Logic Programming: Proceeding of the North American Conference", year = "1989", pages = "831--850", } @Article{boolos87jpl, author = "George Boolos", title = "A curious inference", journal = "Journal of Philosophical Logic", year = "1987", volume = "16", pages = "1--12", } @Book{boolos98book, author = "George Boolos", title = "Logic, Logic, Logic", publisher = "Harvard University Press", year = "1998", } @InProceedings{boreale01icalp, author = "Michele Boreale", title = "Symbolic Trace Analysis of Cryptographic Protocols", booktitle = "Proceedings of ICALP 2001", pages = "667--681", year = "2001", volume = "2076", series = lncs, publisher = "Springer", } @InProceedings{boreale04aplas, author = "M. Boreale and M. Buscemi and U. Montanari", title = "{D}-Fusion: a Distinctive Fusion Calculus", booktitle = "Proc. of APLAS04", year = "2004", volume = "3302", pages = "296--310", series = lncs, publisher = "Springer", } @Article{boreale96ic, author = "Michele Boreale and Rocco De Nicola", title = "A Symbolic Semantics for the $\pi$-Calculus", journal = "Information and Computation", year = "1996", volume = "126", number = "1", pages = "34--52", month = apr, } @InProceedings{borger90csl, author = "Egon B{\"o}rger and Dean Rosenzweig", title = "From {Prolog} Algebras Towards {WAM} -- {A} Mathematical Study of Implementations", booktitle = "Computer Science Logic", series = lncs, publisher = "Springer", volume = "533", pages = "31--66", year = "1990", } @Article{borger95scp, author = "Egon B{\"{o}}rger and Dean Rosenzweig", title = "A Mathematical Definition of Full {Prolog}", journal = "Sci. Comput. Program.", volume = "24", number = "3", pages = "249--286", year = "1995", URL = "https://doi.org/10.1016/0167-6423(95)00006-E", doi = "10.1016/0167-6423(95)00006-E", } @InCollection{borgere95lpfmpa, author = "Egon B{\"{o}}rger and Dean Rosenzweig", editor = "Christoph Beierle and Lutz Pl{\"{u}}mer", title = "The {WAM} - {Definition} and Compiler Correctness", booktitle = "Logic Programming: Formal Methods and Practical Applications, Studies in Computer Science and Artificial Intelligence", pages = "20--90", publisher = "Elsevier Science B.V./North-Holland", year = "1995", } @InProceedings{borgstroem04concur, author = "J. Borgstr{\"o}m and S. Briais and U. Nestmann", title = "Symbolic Bisimulation in the Spi Calculus", booktitle = "Proceedings of CONCUR 2004", pages = "161--176", year = "2004", number = "3170", series = lncs, } @Article{borgstrom15tecs, author = "Johannes Borgstrom and Ram\={u}nas Gutkovas and Ioana Rodhe and Bj{\"{o}}rn Victor", title = "The Psi-Calculi Workbench: {A} Generic Tool for Applied Process Calculi", journal = "ACM Trans. Embed. Comput. Syst.", volume = "14", number = "1", month = jan, year = "2015", ISSN = "1539-9087", pages = "9:1--9:25", URL = "https://doi.acm.org/10.1145/2682570", doi = "10.1145/2682570", publisher = "ACM", address = "New York, NY, USA", } @TechReport{borras87, author = "Patrick Borras and Dominique Clement and Thierry Despeyroux and Janet Incerpi and Gilles Kahn and Bernard Lang and Val{\'{e}}rie Pascual", title = "{CENTAUR}: The system", type = "Research Report", number = "777", institution = "INRIA", address = "Rocquencourt, France", month = dec, year = "1987", } @InProceedings{borras88, author = "P. Borras and D. Cl\'ement and Th. Despeyroux and J. Incerpi and G. Kahn and B. Lang and V. Pascual", title = "{Centaur}: the system", booktitle = "Third Annual Symposium on Software Development Environments (SDE3)", pages = "14--24", year = "1988", address = "Boston", publisher = "ACM", } @InProceedings{boudard13lpar, title = "Polarizing Double Negation Translations", author = "M{\'e}lanie Boudard and Olivier Hermant", booktitle = "Logic for Programming, Artificial Intelligence, and Reasoning - 19th International Conference, LPAR-19, Stellenbosch, South Africa, December 14-19, 2013. Proceedings", pages = "182--197", year = "2013", editor = "Kenneth L. McMillan and Aart Middeldorp and Andrei Voronkov", number = "8312", series = lncs, URL = "https://arxiv.org/abs/1312.5420", } @TechReport{boudol92tr, author = "Gerard Boudol", title = "Asynchrony and the $\pi$-calculus", institution = "INRIA, Sophia-Antipolis", year = "1992", number = "1702", } @InProceedings{boulton98tphols, author = "Richard J. Boulton and Konrad Slind and Alan Bundy and Michael J. C. Gordon", title = "An Interface between Clam and {HOL}.", booktitle = "TPHOLs", year = "1998", pages = "87--104", } @InProceedings{boutin97tacs, title = "Using reflection to build efficient and certified decision procedures", author = "Samuel Boutin", booktitle = "International Symposium on Theoretical Aspects of Computer Software", pages = "515--529", year = "1997", organization = "Springer", } @InProceedings{bove09tphol, title = "A Brief Overview of {Agda} - {A} Functional Language with Dependent Types.", author = "Ana Bove and Peter Dybjer and Ulf Norell", booktitle = "TPHOLs", volume = "5674", pages = "73--78", year = "2009", organization = "Springer", } @Article{bowen76ndjfl, title = "An {Herbrand} theorem for prenex formulas of {LJ}", author = "Kenneth A. Bowen", journal = "Notre Dame Journal of Formal Logic", year = "1976", number = "2", volume = "17", } @InCollection{bowen82, author = "Kenneth A. Bowen and Robert A. Kowalski", title = "Amalgamating Language and Metalanguage in Logic Programming", booktitle = "Logic programming", editor = "K. L. Clark and S.-A. Tarnlund", publisher = "Academic Press", address = "New York", year = "1982", series = "APIC Studies in Data Processing", volume = "16", pages = "153--172", } @InCollection{bowen82mi, author = "Kenneth A. Bowen", title = "Programming with full first-order logic", booktitle = "Machine Intelligence 10", publisher = "Ellis Horwood and John Wiley", year = "1982", editor = "Hayes and Michie and Pao", pages = "421--440", } @InProceedings{bowen93sess, author = "J. P. Bowen", title = "Formal Methods in Safety-Critical Standards", booktitle = "Proc.\ 1993 Software Engineering Standards Symposium", publisher = "IEEE Computer Society Press", location = "Brighton, UK, 30 August -- 3 September", pages = "168--177", year = "1993", } @Book{boyer79, author = "Robert S. Boyer and J. Strother Moore", title = "A Computational Logic", publisher = "Academic Press", year = "1979", } @Article{brauener04jlc, author = "Torben Bra{\"u}ner", title = "Natural Deduction for Hybrid Logics", journal = jlc, year = "2004", volume = "14", pages = "329--353", number = "3", } @Article{brauener06jal, author = "Torben Bra{\"u}ner and Valeria de Paiva", title = "Intuitionistic hybrid logic", journal = "Journal of Applied Logic", year = "2006", volume = "4", pages = "231--255", } @InProceedings{brauner07lics, author = "Paul Brauner and Cl\'ement Houtmann and Claude Kirchner", title = "Principles of superdeduction", booktitle = lics07, pages = "41--50", year = "2007", } @Article{breazu88, author = "V. Breazu-Tannen and T. Coquand", title = "Extensional Models for Polymorphism", journal = "Theoretical Computer Science", volume = "59", year = "1988", } @Article{brewka11cacm, title = "Answer set programming at a glance", author = "Gerhard Brewka and Thomas Eiter and Miroslaw Truszczynski", journal = "Commun. ACM", year = "2011", number = "12", volume = "54", pages = "92--103", doi = "10.1145/2043174.2043195", } @Article{briais07tcs, author = "S{\'e}bastien Briais and Uwe Nestmann", title = "Open bisimulation, revisited", journal = "Theoretical Computer Science", volume = "386", number = "3", year = "2007", pages = "236--271", } @TechReport{brisset89, author = "Pascal Brisset", title = "Implementation d'un Langage de Programmation Logique d'Order Superieur avec {MALI}", institution = "{INRIA-Rennes}", number = "1119", month = nov, year = "1989", } @InProceedings{brisset91iclp, author = "Pascal Brisset and Olivier Ridoux", title = "Na{\"i}ve Reverse can be Linear", editor = "Koichi Furukawa", booktitle = "Eighth International Logic Programming Conference", address = "Paris, France", publisher = "MIT Press", month = jun, year = "1991", } @InProceedings{brisset92lpw, title = "The Architecture of an Implementation of {$\lambda$Prolog}: {Prolog/Mali}", author = "Pascal Brisset and Olivier Ridoux", booktitle = "Proceedings of the 1992 $\lambda$Prolog Workshop", editor = "Dale Miller", year = "1992", } @TechReport{brisset92tr, author = "P. Brisset and O. Ridoux", title = "The Compilation of $\lambda${Prolog} and its execution with {MALI}", institution = "IRISA", type = "Publication Interne", number = "687", year = "1992", } @InProceedings{brisset93iclp, author = "Pascal Brisset and Olivier Ridoux", title = "Continuations in $\lambda${P}rolog", booktitle = "Proceedings of the Tenth International Conference on Logic Programming", year = "1993", editor = "David S. Warren", publisher = "MIT Press", pages = "27--43", } @Article{brock-nannestad17mscs, author = "Taus Brock-Nannestad and Nicolas Guenot", title = "Multi-focused cut elimination", journal = "Mathematical Structures in Computer Science", year = "2017", doi = "10.1017/S0960129516000451", month = mar, } @TechReport{brock86, author = "Bishop Brock and Shaun Cooper and William Pierce", title = "Some Experiments with Analogy in Proof Discovery (Preliminary Report)", number = "AI-347-86", institution = "MCC", address = "Austin, Texas", month = oct, year = "1986", } @InProceedings{brocknanestad10lpar, author = "Taus Brock-Nannestad and Carsten Sch{\"u}rmann", title = "Focused Natural Deduction", booktitle = "LPAR 17", year = "2010", pages = "157--171", editor = "Christian Ferm{\"u}ller and Andrei Voronkov", volume = "6397", series = lncs, address = "Yogyakarta, Indonesia", publisher = "Springer", doi = "10.1007/978-3-642-16242-8\_12", } @InProceedings{brocknannestad12ijcar, author = "Taus Brock-Nannestad and Carsten Sch{\"{u}}rmann", title = "Truthful Monadic Abstractions", booktitle = "Proceedings of the 6th International Joint Conference on Automated Reasoning (IJCAR)", year = "2012", address = "Manchester, UK", pages = "97--110", doi = "10.1007/978-3-642-31365-3\_10", publisher = pub-sv, series = lncs, } @InProceedings{brocknannestad15linearity, author = "Taus Brock{-}Nannestad and Nicolas Guenot", title = "Cut Elimination in Multifocused Linear Logic", booktitle = "Proceedings Third International Workshop on Linearity, {LINEARITY} 2014, Vienna, Austria, 13th July, 2014.", pages = "24--33", year = "2015", editor = "Sandra Alves and Iliano Cervesato", series = "{EPTCS}", volume = "176", URL = "https://dx.doi.org/10.4204/EPTCS.176.3", doi = "10.4204/EPTCS.176.3", } @InProceedings{brocknannestad15mfps, author = "Taus Brock{-}Nannestad and Nicolas Guenot", title = "Focused Linear Logic and the $\lambda$-calculus", booktitle = "Proceedings of the Thirty-first Conference on the Mathematical Foundations of Programming Semantics, Nijmegen, The Netherlands, June 22--25, 2015", pages = "314--329", year = "2015", } @InProceedings{brocknannestad15ppdp, author = "Taus Brock{-}Nannestad and Nicolas Guenot and Daniel Gustafsson", title = "Computation in focused intuitionistic logic", booktitle = "Proceedings of the 17th International Symposium on Principles and Practice of Declarative Programming, Siena, Italy, July 14--16, 2015", pages = "43--54", year = "2015", editor = "Moreno Falaschi and Elvira Albert", publisher = "ACM", doi = "10.1145/2790449.2790528", } @InProceedings{brocknannestad15tableaux, author = "Taus Brock-Nannestad and Kaustuv Chaudhuri", title = "Disproving Using the Inverse Method by Iterated Refinement of Finite Approximations", booktitle = "Proceedings of the 24th Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX)", year = "2015", editor = "Hans de Nivelle", volume = "9323", series = lnai, month = sep, pages = "153--168", address = "Wroc{\l}aw, Poland", publisher = pub-sv, doi = "10.1007/978-3-319-24312-2\_11", URL = "https://chaudhuri.info/papers/draft15saturate.pdf", } %% URL = "https://doi.acm.org/10.1145/2790449.2790528", @Unpublished{brocknannestad16tr, title = "{An Intuitionistic Formula Hierarchy Based on High-School Identities}", author = "Taus Brock-Nannestad and Danko Ilik", URL = "https://hal.inria.fr/hal-01354181", note = "working paper or preprint", year = "2016", month = Aug, pdf = "https://hal.inria.fr/hal-01354181/file/high-school.pdf", hal_id = "hal-01354181", hal_version = "v1", } @Article{brogi91toplas, author = "A.~Brogi and P.~Ciancarini", title = "The concurrent language shared {Prolog}", journal = "ACM Transactions on Programming Languages and Systems", volume = "13", number = "1", pages = "99--123", year = "1991", } @InProceedings{brotherston05tableaux, author = "James Brotherston", title = "Cyclic Proofs for First-Order Logic with Inductive Definitions", booktitle = "Automated Reasoning with Analytic Tableaux and Related Methods: Proceedings of TABLEAUX 2005", editor = "B. Beckert", publisher = "Springer", pages = "78--92", series = lnai, volume = "3702", year = "2005", } @PhdThesis{brotherston06phd, author = "James Brotherston", title = "Sequent Calculus Proof Systems for Inductive Definitions", school = "University of Edinburgh", month = nov, year = "2006", } @InProceedings{brotherston07lics, author = "James Brotherston and Alex Simpson", title = "Complete Sequent Calculi for Induction and Infinite Descent", booktitle = lics07, year = "2007", pages = "51--62", } @Article{brotherston11jlc, author = "James Brotherston and Alex Simpson", title = "Sequent calculi for induction and infinite descent", journal = jlc, year = "2011", volume = "21", number = "6", pages = "1177--1216", month = dec, doi = "10.1093/logcom/exq052", } @InProceedings{brotherston12aplas, author = "James Brotherston and Nikos Gorogiannis and Rasmus Lerchedahl Petersen", title = "A Generic Cyclic Theorem Prover", booktitle = "APLAS", year = "2012", pages = "350--367", publisher = pub-sv, series = lncs, volume = "7705", doi = "10.1007/978-3-642-35182-2\_25", } @PhdThesis{brown04phd, author = "Chad E. Brown", title = "Set Comprehension in Church's Type Theory", school = "Department of Mathematical Sciences, Carnegie Mellon University", year = "2004", } @InCollection{brown12ar, title = "Satallax: An automatic higher-order prover", author = "Chad E Brown", booktitle = "Automated Reasoning", pages = "111--117", year = "2012", publisher = "Springer", } @InProceedings{brown90lics, author = "C. Brown and D. Gurr", title = "A categorical linear framework for Petri nets", booktitle = lics90, pages = "208--219", year = "1990", address = "Philadelphia, PA", month = jun, organization = "IEEE Computer Society Press", } @TechReport{brown91tr, author = "C. Brown and D. Gurr", title = "Relations and Non-commutative Linear Logic", year = "1991", institution = "University of {\AA}rhus", note = "Technical Report DAIMI PB-372", } @PhdThesis{bruennler10habil, author = "Kai Br{\"u}nnler", title = "Nested Sequents", school = "Universit{\"a}t Bern", type = "Habilitationsschrift", year = "2010", URL = "https://arxiv.org/abs/1004.1845v1", } @InProceedings{brunnler06aml, author = "Kai Br{\"u}nnler", booktitle = "Advances in Modal Logic", editor = "Guido Governatori and Ian Hodkinson and Yde Venema", URL = "https://www.aiml.net/volumes/volume6/Bruennler.ps", pages = "107--119", publisher = "College Publications", title = "Deep Sequent Systems for Modal Logic", volume = "6", year = "2006", } @InProceedings{brunnler09tableaux, author = "Kai Br{\"u}nnler and Lutz Stra{\ss}burger", title = "Modular Sequent Systems for Modal Logic", booktitle = tableaux09, year = "2009", pages = "152--166", editor = "Martin Giese and Arild Waller", number = "5607", series = lnai, publisher = "Springer", URL = "https://www.iam.unibe.ch/~kai/Papers/2009mssml.pdf", doi = "10.1007/978-3-642-02716-1\_12", } @InProceedings{bruscoli02iclp, author = "Paola Bruscoli", title = "A purely logical account of sequentiality in proof search", booktitle = "Logic Programming, 18th International Conference", pages = "302--316", year = "2002", editor = "Peter J. Stuckey", volume = "2401", series = lnai, publisher = "Springer", } @InProceedings{bruscoli03lpar, author = "Paola Bruscoli and Alessio Guglielmi", title = "On Structuring Proof Search for First Order Linear Logic", editor = "Moshe Y. Vardi and Andrei Voronkov", booktitle = "LPAR 2003", year = "2003", publisher = "Springer", series = lnai, volume = "2850", pages = "389--406", } @Article{bruscoli06tcs, author = "Paola Bruscoli and Alessio Guglielmi", title = "On structuring proof search for first order linear logic", journal = tcs, year = "2006", volume = "360", number = "1-3", pages = "42--76", doi = "10.1016/j.tcs.2005.11.047", } @Article{bruscoli09tocl, author = "Paola Bruscoli and Alessio Guglielmi", title = "On the proof complexity of deep inference", journal = tocl, volume = "10", number = "2", year = "2009", } @InProceedings{bruscoli10lpar, author = "Paola Bruscoli and Alessio Guglielmi and Tom Gundersen and Michel Parigot", title = "A Quasipolynomial Cut-Elimination Procedure in Deep Inference via Atomic Flows and Threshold Formulae", booktitle = "Proceedings of the 16th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2009)", year = "2010", editor = "Edmund Clarke and Andrei Voronkov", volume = "6355", series = lnai, address = "Dakar, Senegal", month = apr, publisher = "Springer", URL = "https://cs.bath.ac.uk/ag/p/QPNDI.pdf", } @InCollection{bruscoli96cp, author = "Paola Bruscoli and Alessio Guglielmi", title = "A Linear Logic View of {G}amma Style Computations as Proof Searches", editor = "Jean-Marc Andreoli and Chris Hankin and Daniel {Le M\'etayer}", booktitle = "Coordination Programming: {M}echanisms, Models and Semantics", publisher = "Imperial College Press", year = "1996", } @Article{bucciarelli00apal, title = "On phase semantics and denotational semantics in multiplicative--additive linear logic", author = "Antonio Bucciarelli and Thomas Ehrhard", journal = apal, volume = "102", number = "3", pages = "247--282", year = "2000", publisher = "Elsevier BV", } @Book{buchholz81book, author = "W. Buchholz and S. Feferman and W. Pohlers and W. Sieg", address = "Berlin", publisher = "Springer", series = "Lecture Notes in Mathematics", title = "Iterated Inductive Definitions and Subsystems of Analysis: Recent Proof-Theoretical Studies", volume = "897", year = "1981", } @Book{bucur68, author = "Ion Bucur and Aristide Deleanu", title = "Introduction to the Theory of Categories and Functors", publisher = "John Wiley $\&$ Sons Ltd", address = "London, New York, Sydney", year = "1968", } @Article{bugliesi00tcs, author = "Michele Bugliesi and Giorgio Delzanno and Luigi Liquori and Maurizio Martelli", title = "A Linear Logic Calculus of Objects", journal = "Journal of Logic and Computation", year = "2000", volume = "10", number = "1", pages = "77--109", } @Article{bugliesi94jlp, author = "M. Bugliesi and E. Lamma and P. Mello", title = "Modularity in Logic Programming", journal = "Journal of Logic Programming", year = "1994", volume = "19/20", pages = "443--502", doi = "10.1016/0743-1066(94)90032-9", } @InProceedings{bugliesi96jicslp, author = "Michele Bugliesi and Giorgio Delzanno and Luigi Liquori and Maurizio Martelli", title = "A Linear Logic Calculus of Objects", booktitle = "Proceedings of the {Joint International Conference and Symposium on Logic Programming}", editor = "M.\ Maher", publisher = "MIT Press", month = sep, year = "1996", } @Book{bundy83, author = "Alan Bundy", title = "The Computer Modelling of Mathematical Reasoning", publisher = "Academic Press", year = "1983", } @InProceedings{bundy87cade, author = "Alan Bundy", title = "The use of explicit plans to guide inductive proofs", booktitle = "Conf. on Automated Deduction (CADE 9)", year = "1987", pages = "111--120", } @TechReport{bundy92, author = "Alan Bundy and Andrew Stevens and Frank van Harmelen and Andrew Ireland and Alan Smail", title = "Rippling: {A} Heuristic for Guiding Inductive Proofs", institution = "Department of AI, University of Edinburgh", number = "DAI No.\ 567", month = feb, year = "1992", note = "Submitted to teh Artifical Intelligence Journal", } @Article{bundy93ai, author = "A. Bundy and A. Stevens and F. van Harmelen and A. Ireland and A. Smaill", title = "Rippling: {A} Heuristic for Guiding Inductive Proofs", journal = "Artificial Intelligence", pages = "185--253", volume = "62", number = "2", month = aug, year = "1993", doi = "10.1016/0004-3702(93)90079-Q", } @Article{buneman94sigmod, title = "Comprehension syntax", author = "Peter Buneman and Leonid Libkin and Dan Suciu and Val Tannen and Limsoon Wong", journal = "ACM Sigmod Record", volume = "23", number = "1", pages = "87--96", year = "1994", publisher = "ACM", } @InProceedings{burel07csl, author = "Guillaume Burel", title = "Unbounded Proof-Length Speed-Up in Deduction Modulo", booktitle = csl07, pages = "496--511", doi = "10.1007/978-3-540-74915-8\_37", editor = "J. Duparc and T. A. Henzinger", volume = "4646", series = lncs, publisher = pub-sv, year = "2007", } @InProceedings{burel08lics, title = "A First-Order Representation of Pure Type Systems Using Superdeduction", author = "Guillaume Burel", publisher = "IEEE Computer Society", year = "2008", booktitle = lics08, pages = "253--263", } @Article{burel11lmcs, title = "Efficiently Simulating Higher-Order Arithmetic by a First-Order Theory Modulo", author = "Guillaume Burel", journal = "Logical Methods in Computer Science", year = "2011", pages = "1--31", number = "1", volume = "7", } @InProceedings{burel13pxtp, author = "Guillaume Burel", title = "A Shallow Embedding of Resolution and Superposition Proofs into the $\lambda{\Pi}$-Calculus Modulo", booktitle = "Third International Workshop on Proof Exchange for Theorem Proving (PxTP 2013)", pages = "43--57", year = "2013", editor = "J. C. Blanchette and J. Urban", volume = "14", series = "EPiC Series", publisher = "EasyChair", } @Book{burns88occam2, title = "Programming in {OCCAM} 2", author = "Allan R Burns", year = "1988", publisher = "Addison-Wesley", } @Article{burroni86, author = "Albert Burroni", title = "{R}{\'e}cursivit{\'e} graphique (1{\`e}re partie) : Cat{\'e}gorie des fonctions r{\'e}cursives primitives formelles", journal = "Cah. Topologie G{\'e}om. Diff{\'e}r. Cat{\'e}goriques", year = "1986", number = "1", volume = "27", pages = "49--79", } @Article{burrows89osr, author = "Michael Burrows and Mart\'\i n Abadi and Roger Needham", title = "A logic of authentication", journal = "Operating Systems Review", pages = "1--13", year = "1989", volume = "23", number = "5", month = dec, } @TechReport{burstall86, author = "Rod Burstall", title = "{Research in Interactive Theorem Proving at Edinburgh University}", number = "ECS-LFCS-86-12", institution = "Laboratory for the Foundations of Computer Science, University of Edinburgh", month = oct, year = "1986", } @TechReport{burstall87, author = "Rod Burstall", title = "{Inductively Defined Functions in Functional Programming Languages}", number = "ECS-LFCS-87-25", institution = "Laboratory for the Foundations of Computer Science, University of Edinburgh", month = apr, year = "1987", } @InProceedings{burstall88, author = "R. Burstall and Furio Honsell", title = "A Natural Deduction Treatment of Operational Semantics", booktitle = "Proceedings of the 8th Conf. on Foundations of Software Technology and Theoretical Computer Science", publisher = pub-sv, series = lncs, number = "338", pages = "250--269", year = "1988", } @InProceedings{busch94tphols, author = "Holger Busch", title = "First-Order Automation for Higher-Order-Logic Theorem Proving", booktitle = "Proceedings of the 7th International Workshop on Higher Order Logic Theorem Proving and Its Applications", year = "1994", ISBN = "3-540-58450-1", pages = "97--112", publisher = "Springer-Verlag", address = "London, UK", } @Article{buss2003unpub, title = "The depth of intuitionistic cut free proofs", author = "S. R. Buss and R. Iemhoff", year = "2003", } @InProceedings{buss95lcc, author = "Samuel Buss", title = "On {Herbrand's} Theorem", booktitle = "Logic and Computational Complexity", pages = "195--209", year = "1995", series = lncs, number = "960", } @InCollection{buss98handbook, author = "Samuel R. Buss", title = "An Introduction to Proof Theory", booktitle = "Handbook of Proof Theory", publisher = "Elsevier Science Publishers", year = "1998", editor = "Samuel R. Buss", pages = "1--78", address = "Amsterdam", } @InProceedings{cabeza00cl, author = "Daniel Cabeza and Manuel V. Hermenegildo", title = "A New Module System for {Prolog}", booktitle = "Computational Logic - CL 2000", year = "2000", pages = "131--148", editor = "John Lloyd {\em et al.}", publisher = "Springer", series = lncs, volume = "1861", } @InProceedings{caires94iclp, author = "{Lu\'\i s} Caires and Luis Monteiro", title = "Higher-Order Polymorphic Unification for Logic Programming", booktitle = "Logic Programming, 11th International Conference, S.~Margherita Ligure, Italy", pages = "419--433", editor = "P. Van Hentenryck", year = "1994", publisher = "MIT Press", } @InProceedings{caldwell04tphols, title = "A Framework for Interactive Sharing and Deductive Searching in Distributed Heterogeneous Collections of Formalized Mathematics", author = "James L. Caldwell and Christoph Jechlitschek", booktitle = "Proceedings of the 17th International Conference in Theorem Proving in Higher Order Logics: TPHOL 2004", year = "2004", series = lncs, publisher = pub-sv, } @InProceedings{caleiro05gabbay, title = "Fibring Logics: Past, Present and Future", author = "Carlos Caleiro and Am{\'i}lcar Sernadas and Cristina Sernadas", booktitle = "We Will Show Them! Essays in Honour of Dov Gabbay, Volume One", publisher = "College Publications", year = "2005", editor = "Sergei N. Art{\"e}mov and Howard Barringer and Artur S. d'Avila Garcez and Lu{\'i}s C. Lamb and John Woods", pages = "363--388", } @InProceedings{capretta09lc, author = "Venanzio Capretta and Amy Felty", title = "Higher-order abstract syntax in type theory", booktitle = "Logic Colloquium 2006", editor = "S. Barry Cooper and Herman Geuvers and Anand Pillay and Jouko V{\"{a}}{\"{a}}n{\"{a}}nen", series = "Lecture Notes in Logic", volume = "32", publisher = "Cambridge University Press", pages = "65--90", year = "2009", } @InProceedings{carbone03sefm, title = "A Formal Model for Trust in Dynamic Networks", author = "Marco Carbone and Mogens Nielsen and Vladimiro Sassone", publisher = "IEEE Computer Society", year = "2003", booktitle = "SEFM", pages = "54", } @InProceedings{cardelli84, author = "L. Cardelli", title = "Compiling a Functional Language", booktitle = "1984 Symposium on LISP and Functional Programming", organization = "ACM", pages = "208--217", year = "1984", } @Article{cardelli85, author = "Luca Cardelli and Peter Wegner", title = "On Understanding Types, Data abstraction, and Polymorphism", journal = "ACM Computing Surveys", volume = "17", number = "4", month = dec, year = "1985", pages = "471--522", } @Article{cardelli87, author = "L. Cardelli", title = "Basic Polymorphic Typechecking", journal = "The Science of Programming", volume = "8", number = "2", pages = "147--172", year = "1987", } @Article{cardelli94ic, author = "Luca Cardelli and John C. Mitchell and Simone Martini and Andre Scedrov", title = "An Extension of {System F} with Subtyping", journal = "Information and Computation", volume = "109", year = "1994", pages = "4--56", number = "1--2", } @InProceedings{cardelli98, author = "L. Cardelli and A. Gordon", title = "Mobile ambients", booktitle = "FOSSACS'98", publisher = "Springer", series = lncs, year = "1998", volume = "1378", } @InProceedings{carette09icm, title = "A Review of Mathematical Knowledge Management", author = "Jacques Carette and William M. Farmer", booktitle = "Intelligent Computer Mathematics, 16th Symposium, Calculemus 2009, 8th International Conference, MKM 2009, Held as Part of CICM 2009, Grand Bend, Canada, July 6-12, 2009. Proceedings", publisher = "Springer", year = "2009", volume = "5625", editor = "Jacques Carette and Lucas Dixon and Claudio Sacerdoti Coen and Stephen M. Watt", pages = "233--246", series = lncs, } @Article{castellani89jacm, author = "Ilaria Castellani and Matthew Hennessy", title = "Distributed Bisimulations", journal = "Journal of the ACM", volume = "36", number = "4", pages = "887--911", year = "1989", } @PhdThesis{cauderlier16phd, title = "{Object-Oriented Mechanisms for Interoperability between Proof Systems}", author = "Rapha{\"e}l Cauderlier", URL = "https://hal.inria.fr/tel-01415945", school = "{Conservatoire National Des Arts et M{\'e}tiers, Paris}", year = "2016", month = Oct, pdf = "https://hal.inria.fr/tel-01415945/file/main.pdf", } @InProceedings{cellucci87, title = "Using full first order logic as a programming language", author = "Carlo Cellucci", booktitle = "Proceedings of the conference on `Logic and Computer Science: New Trends and Applications’", year = "1987", series = "Rendiconti del Seminario Matematico Universitae Politecnico di Torino. Fascicolo Speciale 1987", pages = "115--152", } @InProceedings{cerrito90lics, author = "Serenella Cerrito", title = "A Linear Semantics for Allowed Logic Programs", booktitle = lics90, address = "Philadelphia, Pennsylvania", editor = "John Mitchell", month = jun, year = "1990", organization = "IEEE Computer Society Press", pages = "219--227", } @InProceedings{cerrito92icslp, author = "S. Cerrito", title = "Herbrand Methods in Sequent Calculi: Unification in {LL}", booktitle = "Proceedings of the {Joint} International Conference and Symposium on Logic Programming", publisher = "MIT Press", address = "Washington, USA", editor = "Apt", ISBN = "0-262-51064-2", pages = "607--621", year = "1992", } @InCollection{cerrito92ilp, author = "Serenella Cerrito", title = "Negation and linear completion", booktitle = "Intensional Logic for Programming", publisher = "Clarendon Press", year = "1992", pages = "155--194", editor = "L. Fari{\~n}as del Cerro and M. Penttonen", } @Article{cerrito92jlp, author = "Serenella Cerrito", title = "A Linear Axiomatization of Negation as Failure", journal = "Journal of Logic Programming", month = jan, year = "1992", volume = "12", number = "1 \& 2", pages = "1--24", } @InProceedings{cerro96fcs, author = "Luis F. Del Cerro and Andreas Herzig", title = "Combining Classical and Intuitionistic Logic, or: intuitionistic implication as a conditional", booktitle = "Frontiers of Combining Systems: 1st International Workshop", pages = "93--102", year = "1996", publisher = "Kluwer Academic Publishers", } @InProceedings{cervesato00csfw, author = "Iliano Cervesato and Nancy A. Durgin and Patrick D. Lincoln and John C. Mitchell and Andre Scedrov", title = "Relating Strands and Multiset Rewriting for Security Protocol Analysis", booktitle = "13th IEEE Computer Security Foundations Workshop --- CSFW'00", year = "2000", pages = "35--51", editor = "P. Syverson", address = "Cambridge, UK", month = "3--5 " # jul, publisher = "IEEE Computer Society Press", } @InProceedings{cervesato00fmcs, author = "Iliano Cervesato and Nancy Durgin and Max Kanovich and Andre Scedrov", title = "Interpreting Strands in Linear Logic", booktitle = "2000 Workshop on Formal Methods and Computer Security - FMCS'00", year = "2000", editor = "H. Veith and N. Heintze and E. Clark", month = jul, } @Article{cervesato00tcs, author = "Iliano Cervesato and Joshua S. Hodas and Frank Pfenning", title = "Efficient resource management for linear logic proof search", journal = "Theoretical Computer Science", volume = "232", number = "1-2", year = "2000", pages = "133--163", } @InProceedings{cervesato01mmans, author = "Iliano Cervesato", title = "Typed {MSR}: Syntax and Examples", booktitle = "MMMACNS: International Workshop on Methods, Models and Architectures for Network Security", year = "2001", pages = "159--177", publisher = pub-sv, series = lncs, volume = "2052", } @Article{cervesato02ic, title = "{A Linear Logical Framework}", author = "Iliano Cervesato and Frank Pfenning", journal = "Information \& Computation", volume = "179", number = "1", pages = "19--75", year = "2002", month = nov, } @Article{cervesato03jlc, author = "Iliano Cervesato and Frank Pfenning", title = "A Linear Spine Calculus", journal = "Journal of Logic and Computation", volume = "13", number = "5", pages = "639--688", year = "2003", doi = "10.1093/logcom/13.5.639", } @TechReport{cervesato03tr, author = "Iliano Cervesato and Frank Pfenning and David Walker and Kevin Watkins", title = "A concurrent logical framework {II}: Examples and applications", institution = "Carnegie Mellon University", year = "2003", number = "CMU-CS-02-102", note = "Revised, May 2003", } @Article{cervesato07hosc, author = "Iliano Cervesato and Mark-Oliver Stehr", title = "Representing the {MSR} cryptoprotocol specification language in an extension of rewriting logic with dependent types", journal = "Higher-Order Symbolic Computation", year = "2007", volume = "20", pages = "3--35", doi = "10.1007/s10990-007-9003-3", } @Proceedings{cervesato15lfmtp, title = "Proceedings of the Tenth International Workshop on Logical Frameworks and Meta Languages: Theory and Practice ({LFMTP})", year = "2015", editor = "Iliano Cervesato and Kaustuv Chaudhuri", volume = "185", series = eptcs, address = "Berlin, Germany", month = aug, URL = "https://eptcs.web.cse.unsw.edu.au/content.cgi?LFMTP15", doi = "10.4204/EPTCS.185", } @InProceedings{cervesato96lics, title = "A Linear Logic Framework", author = "Iliano Cervesato and Frank Pfenning", pages = "264--275", booktitle = lics96, year = "1996", month = jul, address = "New Brunswick, New Jersey", publisher = "IEEE Computer Society Press", } @InProceedings{cervesato96welp, author = "Iliano Cervesato and Joshua Hodas and Frank Pfenning", title = "Efficient Resource Management for Linear Logic Proof Search", booktitle = welp96, editor = "Roy Dyckhoff and Heinrich Herre and Peter Schroeder-Heister", publisher = "Springer", series = lnai, year = "1996", address = "Leipzig, Germany", month = mar, pages = "28--30", } @InProceedings{cervesato98jicslp, author = "Iliano Cervesato", title = "Proof-Theoretic Foundation of Compilation in Logic Programming Languages", booktitle = "Proceedings of the 1998 Joint International Conference and Symposium on Logic Programming", editor = "Joxan Jaffar", pages = "115--129", year = "1998", } @InProceedings{cervesato99csfw, author = "Iliano Cervesato and Nancy A. Durgin and Patrick D. Lincoln and John C. Mitchell and Andre Scedrov", title = "A Meta-Notation for Protocol Analysis", pages = "55--69", booktitle = "Proceedings of the 12th IEEE Computer Security Foundations Workshop --- CSFW'99", year = "1999", editor = "R. Gorrieri", address = "Mordano, Italy", month = "28--30 " # jun, publisher = "IEEE Computer Society Press", } @InProceedings{chabrier05cmsb, author = "Nathalie Chabrier-Rivier and Fran\c{c}ois Fages and Sylvain Soliman", title = "The Biochemical Abstract Machine {BIOCHAM}", booktitle = "International Workshop on Computational Methods in Systems Biology (CMSB-2)", pages = "", year = "2004", publisher = "Springer", series = lncs, } @InProceedings{chadha01ccs, author = "R. Chadha and M. I. Kanovich and A. Scedrov", title = "Inductive methods and contract-signing protocols", booktitle = "Eighth ACM Conference on Computer and Communications Security", year = "2001", editor = "P. Samarati", month = nov, publisher = "ACM Press", } @PhdThesis{chakravarty97phd, author = "Manuel M. T. Chakravarty", title = "On the Massively Parallel Execution of Declarative Programs", school = "Technische Universit{\"a}t Berlin, Fachbereich Informatik", year = "1997", month = feb, } @InProceedings{chan88, author = "David Chan", title = "Constructive Negation Based on the completed database", booktitle = "Proceedings of the Fifth Logic Programming Symposium", pages = "111--125", publisher = "MIT Press", year = "1988", } @Article{chandra81jacm, author = "Ashok K. Chandra and Dexter C. Kozen and Larry J. Stockmeyer", title = "Alternation", journal = "Journal of the ACM", year = "1981", doi = "10.1145/322234.322243", volume = "28", number = "1", pages = "114--133", month = jan, } @Unpublished{chargueraud09ln, author = "Arthur Chargu{\'e}raud", title = "The Locally Nameless Representation", year = "2009", month = jul, URL = "https://arthur.chargueraud.org/research/2009/ln/", } @Article{chargueraud11jar, author = "Arthur Chargu{\'e}raud", title = "The Locally Nameless Representation", journal = "Journal of Automated Reasoning", publisher = pub-sv, volume = "49", pages = "363--408", doi = "10.1007/s10817-011-9225-2", year = "2011", month = may, } @InProceedings{chaudhuri05csl, title = "Focusing the Inverse Method for Linear Logic", author = "Kaustuv Chaudhuri and Frank Pfenning", year = "2005", editor = "C.-H. Luke Ong", booktitle = csl05, publisher = "Springer", series = lncs, volume = "3634", doi = "10.1007/11538363\_15", pages = "200--215", } @InProceedings{chaudhuri06ijcar, author = "Kaustuv Chaudhuri and Frank Pfenning and Greg Price", title = "A Logical Characterization of Forward and Backward Chaining in the Inverse Method", booktitle = ijcar06, pages = "97--111", year = "2006", editor = "U. Furbach and N. Shankar", number = "4130", series = lncs, month = aug, publisher = "Springer", } @PhdThesis{chaudhuri06phd, author = "Kaustuv Chaudhuri", title = "The Focused Inverse Method for Linear Logic", school = "Carnegie Mellon University", month = dec, year = "2006", note = "Technical report CMU-CS-06-162", pdf = "https://reports-archive.adm.cs.cmu.edu/anon/2006/CMU-CS-06-162.pdf", } @Article{chaudhuri08jar, author = "Kaustuv Chaudhuri and Frank Pfenning and Greg Price", title = "A Logical Characterization of Forward and Backward Chaining in the Inverse Method", journal = "J. of Automated Reasoning", year = "2008", volume = "40", number = "2-3", pages = "133--177", doi = "10.1007/s10817-007-9091-0", pdf = "https://www.springerlink.com/content/b335r17728862pm2/fulltext.pdf", } @InProceedings{chaudhuri08lpar, author = "Kaustuv Chaudhuri", title = "Focusing Strategies in the Sequent Calculus of Synthetic Connectives", booktitle = "LPAR: International Conference on Logic, Programming, Artificial Intelligence and Reasoning", year = "2008", editor = "Iliano Cervesato and Helmut Veith and Andrei Voronkov", month = nov, pages = "467--481", series = lncs, volume = "5330", publisher = "Springer", doi = "10.1007/978-3-540-89439-1_33", } @InProceedings{chaudhuri08tcs, author = "Kaustuv Chaudhuri and Dale Miller and Alexis Saurin", title = "Canonical Sequent Proofs via Multi-Focusing", booktitle = "Fifth International Conference on Theoretical Computer Science", publisher = pub-sv, year = "2008", volume = "273", series = "IFIP", editor = "G. Ausiello and J. Karhum{\"a}ki and G. Mauri and L. Ong", month = sep, pages = "383--396", doi = "10.1007/978-0-387-09680-3\_26", } %% URL = "https://chaudhuri.info/papers/lpar08synstra.pdf", @TechReport{chaudhuri09tr, title = "A Hybrid Linear Logic for Constrained Transition Systems with Applications to Molecular Biology", author = "Kaustuv Chaudhuri and Jo{\"e}lle Despeyroux", type = "Research Report", year = "2009", number = "inria-00402942", institution = "INRIA-HAL", URL = "https://hal.archives-ouvertes.fr/inria-00402942/en/", } @InProceedings{chaudhuri10csl, author = "Kaustuv Chaudhuri", title = "Classical and Intuitionistic Subexponential Logics are Equally Expressive", booktitle = csl10, year = "2010", month = aug, pages = "185--199", editor = "Anuj Dawar and Helmut Veith", volume = "6247", series = lncs, address = "Brno, Czech Republic", publisher = "Springer", URL = "https://hal.archives-ouvertes.fr/inria-00534865/en/", doi = "10.1007/978-3-642-15205-4\_17", } @InProceedings{chaudhuri10ictac, author = "Kaustuv Chaudhuri and Damien Doligez and Stephan Merz and Leslie Lamport", title = "The {TLA+} Proof System: Building a Heterogeneous Verification Platform", booktitle = "Proceedings of the 7th International Colloquium on Theoretical Aspects of Computing (ICTAC)", editor = "Ana Cavalcanti and David D{\'e}harbe and Marie-Claude Gaudel and Jim Woodcock", month = sep, year = "2010", pages = "44", address = "Natal, Rio Grande do Norte, Brazil", volume = "6256", series = lncs, publisher = "Springer", URL = "https://hal.archives-ouvertes.fr/inria-00521886/en/", doi = "10.1007/978-3-642-14808-8\_3", } @InProceedings{chaudhuri10ijcar, author = "Kaustuv Chaudhuri and Damien Doligez and Leslie Lamport and Stephan Merz", title = "Verifying Safety Properties With the {TLA}$^+$ Proof System", year = "2010", month = jul, booktitle = ijcar10, pages = "142--148", editor = "J{\"u}rgen Giesl and Reiner H{\"a}hnle", volume = "6173", series = lnai, address = "Edinburgh, UK", publisher = "Springer", URL = "https://hal.inria.fr/inria-00534821/en/", doi = "10.1007/978-3-642-14203-1\_12", } @InProceedings{chaudhuri10lpar, author = "Kaustuv Chaudhuri", title = "Magically Constraining the Inverse Method Using Dynamic Polarity Assignment", month = oct, year = "2010", booktitle = "Proceedings of the 17th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR)", pages = "202--216", editor = "Christian Ferm{\"u}ller and Andrei Voronkov", volume = "6397", series = lncs, address = "Yogyakarta, Indonesia", publisher = pub-sv, URL = "https://hal.archives-ouvertes.fr/inria-00535948/en/", doi = "10.1007/978-3-642-16242-8\_15", } @InProceedings{chaudhuri11csl, author = "Kaustuv Chaudhuri and Nicolas Guenot and Lutz Stra{\ss}burger", title = "{The Focused Calculus of Structures}", month = sep, year = "2011", URL = "https://drops.dagstuhl.de/opus/volltexte/2011/3229/pdf/16.pdf", booktitle = "Computer Science Logic: 20th Annual Conference of the EACSL", pages = "159--173", series = lipics, publisher = lci, doi = "10.4230/LIPIcs.CSL.2011.159", ISBN = "978-3-939897-32-3", ISSN = "1868-8969", } @InProceedings{chaudhuri12cpp, author = "Kaustuv Chaudhuri", title = "Compact Proof Certificates for Linear Logic", booktitle = "Proceedings of the Second Internatinal Conference on Certified Programs and Proofs (CPP)", editor = "Chris Hawblitzel and Dale Miller", year = "2012", month = dec, publisher = pub-sv, series = lncs, volume = "7679", pages = "208--223", address = "Kyoto, Japan", doi = "10.1007/978-3-642-35308-6\_17", hal_id = "hal-00760118", URL = "https://kaustuv.chaudhuri.info/papers/cpp12deepcert.pdf", } @InProceedings{chaudhuri12csl, author = "Kaustuv Chaudhuri and Stefan Hetzl and Dale Miller", title = "A Systematic Approach to Canonicity in the Classical Sequent Calculus", booktitle = csl12, year = "2012", month = sep, pages = "183--197", editor = "Patrick C{\'e}gielski and Arnaud Durand", publisher = lci, series = lipics, volume = "16", doi = "10.4230/LIPIcs.CSL.2012.183", ISBN = "978-3-939897-42-2", ISSN = "1868-8969", } @InProceedings{chaudhuri13itp, author = "Kaustuv Chaudhuri", title = "Subformula Linking as an Interaction Method", booktitle = "Proceedings of the 4th Conference on Interactive Theorem Proving (ITP)", year = "2013", month = jul, editor = "Sandrine Blazy and Christine Paulin-Mohring and David Pichardie", series = lncs, volume = "7998", pages = "386--401", publisher = pub-sv, URL = "https://chaudhuri.info/papers/itp13link.pdf", } @Misc{chaudhuri13types, author = "Kaustuv Chaudhuri and Jo{\"e}lle Despeyroux", title = "A Hybrid Linear Logic for Constrained Transition Systems", howpublished = "Collected Abstracts of the 19th Conference on Types for Proofs and Programs (TYPES)", year = "2013", month = apr, URL = "https://chaudhuri.info/papers/abst13hyll.pdf", } @Misc{chaudhuri13url, title = "{TLAPS}: the {TLA$^+$} proof system", author = "Kaustuv Chaudhuri and Denis Cousineau and Damien Doligez and Markus Kuppe and Leslie Lamport and Tomer Libal and Stephan Merz and Hern{\'a}n Vanzetto", year = "2013", note = "Available from \url{https://tla.msr-inria.inria.fr/tlaps/}", } @InProceedings{chaudhuri14csllics, author = "Kaustuv Chaudhuri and Nicolas Guenot", title = "Equality and Fixpoints in the Calculus of Structures", doi = "10.1145/2603088.2603140", URL = "https://chaudhuri.info/papers/csllics14eqfix.pdf", booktitle = "Proceedings 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})", year = "2014", editor = "Tom Henzinger and Dale Miller", } @InProceedings{chaudhuri14linearity, author = "Kaustuv Chaudhuri", title = "Undecidability of Multiplicative Subexponential Logic", booktitle = "3rd International Workshop on Linearity (LINEARITY)", year = "2014", editor = "Sandra Alves and Iliano Cervesato", month = jul, address = "Vienna, Austria", volume = "176", series = eptcs, pages = "1--8", URL = "https://eptcs.web.cse.unsw.edu.au/paper.cgi?LINEARITY2014.1", doi = "10.4204/EPTCS.176.1", } @InProceedings{chaudhuri15cpp, author = "Kaustuv Chaudhuri and Matteo Cimini and Dale Miller", title = "A Lightweight Formalization of the Metatheory of Bisimulation-Up-To", booktitle = "Proceedings of the 4th ACM-SIGPLAN Conference on Certified Programs and Proofs", doi = "10.1145/2676724.2693170", year = "2015", editor = "Xavier Leroy and Alwen Tiu", pages = "157--166", month = jan, address = "Mumbai, India", publisher = "ACM", URL = "https://hal.inria.fr/hal-01091524/document", } @InProceedings{chaudhuri15lpar, author = "Kaustuv Chaudhuri and Giselle Reis", title = "An adequate compositional encoding of bigraph structure in linear logic with subexponentials.", booktitle = "Logic for Programming, Artificial Intelligence, and Reasoning (LPAR)", year = "2015", editor = "Martin Davis and Ansgar Fehnker and Annabelle McIver and Andrei Voronkov", month = nov, publisher = pub-sv, series = lncs, volume = "9450", pages = "146--161", URL = "https://chaudhuri.info/papers/lpar15bigraphs.pdf", doi = "10.1007/978-3-662-48899-7\_11", } @InProceedings{chaudhuri16fossacs, author = "Kaustuv Chaudhuri and Sonia Marin and Lutz Stra{\ss}burger", title = "Focused and Synthetic Nested Sequents", booktitle = "Proceedings of the 19th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS)", year = "2016", editor = "Bart Jacobs and Christof L{\"o}ding", month = apr, URL = "https://chaudhuri.info/papers/draft15focnest.pdf", doi = "10.1007/978-3-662-49630-5\_23", series = lncs, volume = "9634", } @InProceedings{chaudhuri16fscd, title = "{Modular Focused Proof Systems for Intuitionistic Modal Logics}", author = "Kaustuv Chaudhuri and Sonia Marin and Lutz Stra{\ss}burger", URL = "https://hal.inria.fr/hal-01417603", booktitle = "{FSCD 2016 - 1st International Conference on Formal Structures for Computation and Deduction}", address = "Porto, Portugal", year = "2016", month = Jun, doi = "10.4230/LIPIcs.FSCD.2016.16", keywords = "intuitionistic modal logic ; focusing ; proof search ; cut elimination ; nested sequents", hal_id = "hal-01417603", hal_version = "v1", } @Article{chaudhuri16jlc, author = "Kaustuv Chaudhuri and Stefan Hetzl and Dale Miller", title = "A Multi-Focused Proof System Isomorphic to Expansion Proofs", journal = jlc, publisher = "Oxford University Press", year = "2016", volume = "26", number = "2", pages = "577--603", doi = "10.1093/logcom/exu030", } @InProceedings{chaudhuri16lsfa, author = "Kaustuv Chaudhuri and Leonardo Lima and Giselle Reis", title = "Formalized Meta-Theory of Sequent Calculi for Substructural Logics", booktitle = "Workshop on Logical and Semantic Frameworks, with Applications (LSFA)", year = "2016", note = "Post proceedings version to appear; Formalization \url{https://github.com/meta-logic/abella-reasoning}", } %% pdf = "https://hal.inria.fr/hal-00937056/PDF/lkfexp.pdf", %% URL = "https://hal.inria.fr/hal-00937056", @TechReport{chaudhuri16tr, title = "{Focused and Synthetic Nested Sequents (Extended Technical Report)}", author = "Kaustuv Chaudhuri and Sonia Marin and Lutz Stra{\ss}burger", URL = "https://hal.inria.fr/hal-01251722", type = "Research Report", institution = "{Inria}", year = "2016", month = Apr, pdf = "https://hal.inria.fr/hal-01251722/file/focused-nested.pdf", hal_id = "hal-01251722", hal_version = "v2", } @InProceedings{chaudhuri18lfmtp, title = "{Computation-as-deduction in Abella: work in progress}", author = "Kaustuv Chaudhuri and Ulysse G{\'e}rard and Dale Miller", URL = "https://hal.inria.fr/hal-01806154", booktitle = "{13th international Workshop on Logical Frameworks and Meta-Languages: Theory and Practice}", address = "Oxford, United Kingdom", year = "2018", month = Jul, pdf = "https://hal.inria.fr/hal-01806154/file/paper.pdf", hal_id = "hal-01806154", } @Article{chaudhuri18mscs, author = "Kaustuv Chaudhuri", title = "Encoding additives using multiplicatives and subexponentials", journal = mscs, volume = "28", number = "5", year = "2018", doi = "10.1017/S0960129516000293", URL = "https://chaudhuri.info/papers/draft15mallmsel.pdf", pages = "651--666", } @InProceedings{chaudhuri19cpp, author = "Kaustuv Chaudhuri and Matteo Manighetti and Dale Miller", title = "A Proof-Theoretic Approach to Certifying Skolemization", booktitle = "Proceedings of the 8th ACM SIGPLAN International Conference on Certified Programs and Proofs (CPP ’19)", year = "2019", pages = "78--90", month = jan, publisher = "ACM", doi = "10.1145/3293880.3294094", } @Article{chaudhuri19mscs, title = "Hybrid linear logic, revisited", volume = "29", doi = "10.1017/S0960129518000439", number = "8", journal = "Mathematical Structures in Computer Science", publisher = "Cambridge University Press", author = "Kaustuv Chaudhuri and Joëlle Despeyroux and Carlos Olarte and Elaine Pimentel", year = "2019", pages = "1151--1176", } @Book{chellas80, author = "Brian F. Chellas", title = "Modal Logic, an Introduction", publisher = "Cambridge University Press", address = "Cambridge", year = "1980", } @Article{chen93jlp, author = "Weidong Chen and Michael Kifer and David S. Warren", title = "{HILOG}: a foundation for higher-order logic programming", journal = jlp, volume = "15", number = "3", year = "1993", pages = "187--230", publisher = "Elsevier Science Inc.", address = "New York, NY, USA", } @Article{chen96jacm, author = "Weidong Chen and David S. Warren", title = "Tabled evaluation with delaying fo general logic programs", journal = jacm, pages = "20--74", year = "1996", number = "1", volume = "43", publisher = "ACM Press", } @InProceedings{cheney04icalp, author = "James Cheney", title = "The Complexity of Equivariant Unification", booktitle = "Proceedings of the 31st International Colloquium on Automata, Languages and Programming (ICALP)", series = lncs, volume = "3142", year = "2004", pages = "332--344", publisher = "Springer", } @InProceedings{cheney04iclp, author = "James Cheney and Christian Urban", title = "{A}lpha-{P}rolog: {A} Logic Programming Language with Names, Binding, and Alpha-Equivalence", year = "2004", booktitle = "Logic Programming, 20th International Conference", publisher = "Springer", volume = "3132", series = lncs, pages = "269--283", editor = "Bart Demoen and Vladimir Lifschitz", doi = "10.1007/978-3-540-27775-0_19", } @InProceedings{cheney05fossacs, title = "A Simpler Proof Theory for Nominal Logic", author = "James Cheney", booktitle = "8th International Conference on the Foundations of Software Science and Computational Structures (FOSSACS)", year = "2005", publisher = "Springer", series = lncs, volume = "3441", pages = "379--394", } @Article{cheney05sigact, title = "Logic column 14: Nominal logic and abstract syntax", author = "James Cheney", journal = "arXiv preprint cs/0511025", year = "2005", } @InProceedings{cheney05unif, author = "James Cheney", title = "Relating Higher-Order Pattern Unification and Nominal Unification", booktitle = "Proceedings of the 19th International Workshop on Unification, UNIF'05", pages = "104--119", year = "2005", editor = "Laurent Vigneron", } @Article{cheney08toplas, author = "James Cheney and Christian Urban", title = "Nominal logic programming", journal = "ACM Trans. Program. Lang. Syst.", volume = "30", number = "5", year = "2008", ISSN = "0164-0925", pages = "1--47", doi = "10.1145/1387673.1387675", publisher = "ACM", address = "New York, NY, USA", } @Article{cheney10jar, title = "Equivariant unification", author = "James Cheney", journal = jar, month = dec, year = "2010", volume = "45", number = "3", pages = "267--300", doi = "10.1007/s10817-009-9164-3", } @Article{cheney17tplp, title = "$\alpha${C}heck: {A} mechanized metatheory model checker", volume = "17", number = "3", journal = "Theory and Practice of Logic Programming", publisher = "Cambridge University Press", author = "James Cheney and Alberto Momigliano", year = "2017", pages = "311--352", doi = "10.1017/S1471068417000035", } @InProceedings{cheng91iclp, author = "Anthony S. K. Cheng and Peter J. Robinson and John Staples", title = "Higher Level Meta Programming in {Qu-Prolog} 3: 0", booktitle = "Logic Programming, Proceedings of the Eigth International Conference, Paris, France, June 24-28, 1991", pages = "285--298", year = "1991", editor = "Koichi Furukawa", publisher = "{MIT} Press", } @Article{chester76, author = "Daniel Chester", title = "The Translation of Formal Proofs into English", journal = "Artificial Intelligence", volume = "7", year = "1976", pages = "261--278", } @Article{chierchia88lp, author = "Gennaro Chierchia and Raymond Turner", title = "Semantics and Property Theory", journal = "Linguistics and Philosophy", year = "1988", volume = "11", pages = "261--302", } @InProceedings{chihani13cade, author = "Zakaria Chihani and Dale Miller and Fabien Renaud", title = "Foundational proof certificates in first-order logic", booktitle = "CADE 24: Conference on Automated Deduction 2013", year = "2013", editor = "Maria Paola Bonacina", series = lnai, number = "7898", pages = "162--177", doi = "10.1007/978-3-642-38574-2\_11", } @InProceedings{chihani13pxtp, author = "Zakaria Chihani and Dale Miller and Fabien Renaud", title = "Checking Foundational Proof Certificates for First-Order Logic (extended abstract)", booktitle = "Third International Workshop on Proof Exchange for Theorem Proving (PxTP 2013)", pages = "58--66", year = "2013", editor = "J. C. Blanchette and J. Urban", volume = "14", series = "EPiC Series", publisher = "EasyChair", } @PhdThesis{chihani15phd, author = "Zakaria Chihani", title = "Certification of First-order proofs in classical and intuitionistic logics", school = "Ecole Polytechnique", year = "2015", month = aug, } @InProceedings{chihani15tableaux, author = "Zakaria Chihani and Tomer Libal and Giselle Reis", title = "The proof certifier {Checkers}", year = "2015", pages = "201--210", booktitle = "Proceedings of the 24th Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX)", series = lncs, number = "9323", editor = "Hans De Nivelle", publisher = "Springer", doi = "10.1007/978-3-319-24312-2\_14", } @InProceedings{chihani16lfsa, title = "Proof Certificates for Equality Reasoning", author = "Zakaria Chihani and Dale Miller", booktitle = "Post-proceedings of LSFA 2015: 10th Workshop on Logical and Semantic Frameworks, with Applications. Natal, Brazil.", editor = "Mario Benevides and Ren\'e Thiemann", publisher = "Elsevier", series = entcs, number = "323", year = "2016", pages = "93--108", doi = "10.1016/j.entcs.2016.06.007", } @Misc{chihani16lprolog, author = "Zakaria Chihani and Dale Miller and Fabien Renaud", title = "Supporting $\lambda${Prolog} code", note = "\url{https://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/fpc-support.tar}", month = apr, year = "2016", } @TechReport{chihani16tr, title = "{Classical polarizations yield double-negation translations}", author = "Zakaria Chihani and Danko Ilik and Dale Miller", URL = "https://hal.inria.fr/hal-01354298", institution = "Inria Saclay", year = "2016", month = Aug, pdf = "https://hal.inria.fr/hal-01354298/file/main.pdf", hal_id = "hal-01354298", hal_version = "v1", } @Article{chihani17jar, author = "Zakaria Chihani and Dale Miller and Fabien Renaud", title = "A semantic framework for proof evidence", journal = jar, year = "2017", pages = "287--330", volume = "59", number = "3", doi = "10.1007/s10817-016-9380-6", } @Unpublished{chirimar.lazy, author = "Jawahar Chirimar", title = "What can continuations observe in the lazy $\lambda$-calculus?", month = dec, year = "1993", note = "Submitted", } @Unpublished{chirimar92notes, author = "Jawahar Chirimar", title = "A semantics for a fragment of intuitionistic linear logic", month = mar, year = "1992", note = "Handwritten notes", } @PhdThesis{chirimar95phd, author = "Jawahar Chirimar", title = "Proof Theoretic Approach to Specification Languages", school = "University of Pennsylvania", year = "1995", month = feb, URL = "https://www.lix.polytechnique.fr/Labo/Dale.Miller/chirimar/phd.ps", } @InProceedings{chlipala08icfp, title = "Parametric higher-order abstract syntax for mechanized semantics", author = "Adam Chlipala", booktitle = "Proceeding of the 13th {ACM} {SIGPLAN} international conference on Functional programming, {ICFP} 2008, Victoria, {BC}, Canada, September 20-28, 2008", publisher = "ACM", year = "2008", editor = "James Hook and Peter Thiemann", pages = "143--156", doi = "10.1145/1411204.1411226", } @InProceedings{chlipala10popl, author = "Adam Chlipala", title = "A Verified Compiler for an Impure Functional Language", booktitle = "Proceedings of POPL'10", year = "2010", publisher = "ACM", } @Book{chlipala13book, title = "Certified Programming with Dependent Types - {A} Pragmatic Introduction to the Coq Proof Assistant", author = "Adam Chlipala", publisher = "MIT Press", year = "2013", ISBN = "978-0-262-02665-9", URL = "https://mitpress.mit.edu/books/certified-programming-dependent-types", } @Article{chomsky56tit, author = "Noam Chomsky", title = "Three models for the description of language", journal = "{IRE} Transactions on Information Theory", volume = "2", number = "3", pages = "113--124", month = sep, year = "1956", URL = "https://dx.doi.org/10.1109/TIT.1956.1056813", doi = "10.1109/TIT.1956.1056813", } @InProceedings{chothia06forte, author = "Tom Chothia", title = "Analysing the {MUTE} Anonymous File-Sharing System Using the Pi-Calculus", booktitle = "Formal Techniques for Networked and Distributed Systems - FORTE 2006", series = "Lecture Notes in Computer Science", volume = "4229", pages = "115--130", year = "2006", editor = "Elie Najm and Jean-Fran\c{c}ois Pradat-Peyre and V{\'e}ronique Donzeau-Gouge", publisher = "Springer", } @Article{church32am, author = "Alonzo Church", title = "A Set of Postulates for the Foundation of Logic", journal = "Annals of Mathematics", volume = "33", number = "2", pages = "346--366", year = "1932", } @Article{church33am, author = "Alonzo Church", title = "A Set of Postulates for the Foundation of Logic (Second Paper)", journal = "Annals of Mathematics", volume = "34", number = "4", pages = "839--864", year = "1933", } @Article{church36ajm, author = "Alonzo Church", title = "An unsolvable problem of elementary number theory", journal = "American Journal of Mathematics", year = "1936", volume = "58", pages = "354--363", } @Article{church40, author = "Alonzo Church", title = "A Formulation of the {Simple} {Theory} of {Types}", journal = jsl, volume = "5", year = "1940", pages = "56--68", doi = "10.2307/2266170", } % URL = "https://dx.doi.org/10.1007/s10817-016-9380-6", @Book{church41, author = "Alonzo Church", title = "The Calculi of Lambda-Conversion", publisher = "Princeton University Press", year = "1941", } @Book{church56book, author = "Alonzo Church", publisher = "Princeton University Press", title = "Introduction to Mathematical Logic", volume = "1", year = "1956", } @Book{church85book, author = "Alonzo Church", title = "The Calculi of Lambda Conversion. ({AM}-6) (Annals of Mathematics Studies)", year = "1985", ISBN = "0-691-08394-0", publisher = "Princeton University Press", address = "Princeton, NJ, USA", } @Article{ciabattoni06sl, author = "Agata Ciabattoni and Kazushige Terui", title = "Towards a semantic characterization of cut-elimination", journal = "Studia Logica", volume = "82", number = "1", pages = "95--119", year = "2006", } @InProceedings{ciabattoni08lics, author = "Agata Ciabattoni and Nikolaos Galatos and Kazushige Terui", title = "From axioms to analytic rules in nonclassical logics", booktitle = lics08, pages = "229--240", year = "2008", publisher = "IEEE Computer Society Press", } @InProceedings{ciabattoni09csl, author = "Agata Ciabattoni and Lutz Stra{\ss}burger and Kazushige Terui", title = "Expanding the Realm of Systematic Proof Theory", year = "2009", pages = "163--178", doi = "10.1007/978-3-642-04027-6\_14", editor = "Erich Gr{\"a}del and Reinhard Kahle", booktitle = "Computer Science Logic, CSL'09", publisher = "Springer", series = "Lecture Notes in Computer Science", volume = "5771", } @Article{ciabattoni11au, author = "Agata Ciabattoni and Nikolaos Galatos and Kazushige Terui", title = "{MacNeille} completions of {FL}-algebras", journal = "Algebra Universalis", year = "2011", volume = "66", number = "4", pages = "405--420", doi = "10.1007/s00012-011-0160-1", } @Article{ciabattoni18tocl, author = "Agata Ciabattoni and Francesco A. Genco", title = "Hypersequents and Systems of Rules: Embeddings and Applications", journal = "{ACM} Trans. Comput. Log.", volume = "19", number = "2", pages = "11:1--11:27", year = "2018", doi = "10.1145/3180075", timestamp = "Wed, 21 Nov 2018 12:44:28 +0100", biburl = "https://dblp.org/rec/bib/journals/tocl/CiabattoniG18", bibsource = "dblp computer science bibliography, https://dblp.org", } @InProceedings{cimini20sle, author = "Matteo Cimini and Dale Miller and Jeremy G. Siek", title = "Extrinsically Typed Operational Semantics for Functional Languages", booktitle = "ACM SIGPLAN International Conference on Software Language Engineering (SLE)", year = "2020", pages = "108--125", editor = "Laurence Tratt and Juan de Lara", doi = "10.1145/3426425.3426936", month = nov, organization = "ACM SIGPLAN", publisher = "ACM", } @InProceedings{claessen03mcpae, author = "Koen Claessen and Niklas Sorensson", title = "New Techniques that Improve {MACE}-style Finite Model Finding", booktitle = "Proceedings of the CADE-19 Workshop: Model Computation - Principles, Algorithms, Applications", year = "2003", editor = "Peter Baumgartner and Christian Fermueller", address = "Miami, USA", } @InProceedings{clairambault09fossacs, title = "Least and Greatest Fixpoints in Game Semantics", author = "Pierre Clairambault", booktitle = "12th International Conference on the Foundations of Software Science and Computational Structures (FOSSACS)", publisher = "Springer", month = mar, year = "2009", volume = "5504", editor = "Luca de Alfaro", pages = "16--31", series = lncs, } @Book{clark76, author = "R. W. Clark", title = "The Life of Bertrand Russell", publisher = "Knopf", year = "1976", } @InCollection{clark78, author = "K. L. Clark", title = "Negation as failure", publisher = "Plenum Press, New York", year = "1978", editor = "J. Gallaire and J. Minker", booktitle = "Logic and Data Bases", pages = "293--322", doi = "10.1007/978-1-4684-3384-5_11", } @Book{clarke99book, author = "Edmund M. Clarke and Orna Grumberg and Doron A. Peled", title = "Model Checking", publisher = "The {MIT} Press", year = "1999", address = "Cambridge, Massachusetts", ISBN = "0-262-03270-8", } @Book{clavel07book, author = "Manuel Clavel and Francisco Dur\'{a}n and Steven Eker and Patrick Lincoln and Narciso Mart\'{\i}-Oliet and Jos\'{e} Meseguer and Carolyn Talcott", title = "All about Maude - a High-Performance Logical Framework: How to Specify, Program and Verify Systems in Rewriting Logic", year = "2007", ISBN = "3-540-71940-7", publisher = "Springer-Verlag", address = "Berlin, Heidelberg", } @Article{cleaveland90acta, author = "Rance Cleaveland", title = "Tableau-based model checking in the propositional mu-calculus", journal = "Acta Informatica", year = "1990", volume = "27", pages = "725--747", } @Article{cleaveland93toplas, title = "The Concurrency Workbench: {A} semantics-based tool for the verification of concurrent systems", author = "Rance Cleaveland and Joachim Parrow and Bernhard Steffen", journal = "ACM Transactions on Programming Languages and Systems (TOPLAS)", volume = "15", number = "1", pages = "36--72", year = "1993", publisher = "ACM", } @TechReport{clement85, author = "Dominique Cl{\'{e}}ment and Jo{\"{e}}lle Despeyroux and Thierry Despeyroux and Laurent Hasco{\"{e}}t and Gilles Kahn", title = "Natural Semantics on the Computer", type = "Research Report", number = "416", institution = "INRIA", address = "Rocquencourt, France", month = jun, year = "1985", } @TechReport{clement85tr, author = "Dominique Cl{\'{e}}ment and Jo{\'{e}}lle Despeyroux and Thierry Despeyroux and Laurent Hasco{\"{e}}t and Gilles Kahn", title = "Natural Semantics on the Computer", type = "Research Report", number = "416", institution = "INRIA", address = "Rocquencourt, France", month = jun, year = "1985", } @TechReport{clement86, author = "Dominique Cl{\'{e}}ment and Jo{\"{e}}lle Despeyroux and Thierry Despeyroux and Gilles Kahn", title = "A Simple Applicative Language: Mini-{ML}", type = "Research Report", number = "529", institution = "INRIA", address = "Rocquencourt, France", month = may, year = "1986", } @InProceedings{clement86aics, author = "D. Clement and J. Despeyroux and T. Despeyroux and L. Hascoet and G. Kahn", title = "Natural Semantics on the computer", booktitle = "K. Fuchi and M. Nivat, editors, proceedings of the France-Japan AI and CS Symposium, ICOT, Japan", pages = "49--89", note = "also Technical Memorandum PL-86-6 Information Processing Society of Japan and Rapport de recherche \#0416, INRIA", URL = "https://www.inria.fr/rrrt/rr-0416.html", year = "1986", } @Book{clocksin87, title = "Programming in {Prolog}, 3rd Edition", author = "W. F. Clocksin and Chris Mellish", publisher = "Springer", year = "1987", } @Book{clocksin94, author = "W. F. Clocksin and C. S. Mellish", title = "Programming in {Prolog}", publisher = "Springer", year = "1994", edition = "Fourth", } @Article{cockett01, author = "Robin Cockett", title = "Deforestation, program transformation, and cut-elimination", journal = entcs, volume = "1", year = "2001", } @Article{cockett02entcs, author = "J. Robin B. Cockett and Luigi Santocanale", title = "Induction, Coinduction, and Adjoints", journal = "Electr. Notes Theor. Comput. Sci.", volume = "69", year = "2002", } @Article{codish99jlp, author = "Michael Codish", title = "Efficient Goal Directed Bottom-up Evaluation of Logic Programs", journal = "Journal of Logic Programming", year = "1999", volume = "38", number = "3", pages = "354--370", } @InProceedings{coen04mkm, author = "Claudio Sacerdoti Coen", title = "Mathematical Libraries as Proof Assistant Environments", booktitle = "International Conference on Mathematical Knowledge Management (MKM), LNCS", volume = "3", year = "2004", } @Article{coen19mscs, title = "Implementing type theory in higher order constraint logic programming", volume = "29", doi = "10.1017/S0960129518000427", number = "8", journal = "Mathematical Structures in Computer Science", publisher = "Cambridge University Press", author = "Ferruccio Guidi and Claudio Sacerdoti Coen and Enrico Tassi", year = "2019", pages = "1125--1150", } @InProceedings{cohen20fscd, author = "Cyril Cohen and Kazuhiko Sakaguchi and Enrico Tassi", title = "Hierarchy Builder: Algebraic hierarchies Made Easy in Coq with Elpi (System Description)", booktitle = "{FSCD}", series = "LIPIcs", volume = "167", pages = "34:1--34:21", publisher = "Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik", year = "2020", doi = "10.4230/LIPIcs.FSCD.2020.34", } @Article{cohen90, author = "Jacques Cohen", title = "Constraint Logic Programming", journal = "Communications of the ACM", volume = "33", number = "7", year = "1990", } @Article{colby03tcs, author = "Christopher Colby and Karl Crary and Robert Harper and Peter Lee and Frank Pfenning", title = "Automated techniques for provably safe mobile code", journal = "Theoretical Computer Science", year = "2003", volume = "290", number = "2", pages = "1175--1199", } @InCollection{colmerauer82, title = "{P}rolog and Infinite Trees", author = "Alain Colmerauer", booktitle = "Logic Programming", editor = "Keith Clark and Sten-{\AA}ke T{\"a}rnlund", year = "1982", pages = "231--251", publisher = "Academic", } @Article{colmerauer93sigplan, author = "A. Colmerauer and P. Roussel", year = "1993", title = "The birth of {P}rolog", journal = "SIGPLAN Notices", volume = "28", number = "3", month = mar, pages = "37--52", } @InProceedings{community20lean, author = "{The mathlib Community}", title = "The {Lean} mathematical library", month = jan, year = "2020", doi = "10.1145/3372885.3373824", booktitle = "CPP 2020: Proceedings of the 9th ACM SIGPLAN International Conference on Certified Programs and Proofs", publisher = "ACM", pages = "367--381", } @InCollection{comon01handbook, title = "Inductionless Induction", author = "Hubert Comon", chapter = "14", booktitle = "Handbook of Automated Reasoning", publisher = "Elsevier Science", editor = "A. Robinson and A. Voronkov", year = "2001", volume = "I", pages = "913--962", } @InProceedings{comon17csf, title = "Formal Computational Unlinkability Proofs of {RFID} Protocols", author = "Hubert Comon and Adrien Koutsos", booktitle = "Computer Security Foundations Symposium (CSF), 2017 IEEE 30th", pages = "100--114", year = "2017", organization = "IEEE", } @Article{comon89jsc, author = "Hubert Comon and Pierre Lescanne", title = "Equational Problems and Disunification", journal = "Journal of Symbolic Computation", year = "1989", volume = "7", pages = "371--425", } @InProceedings{condoluci19ppdp, title = "Sharing equality is linear", author = "Andrea Condoluci and Beniamino Accattoli and Claudio Sacerdoti Coen", booktitle = "Proceedings of the 21st International Symposium on Principles and Practice of Declarative Programming", pages = "1--14", year = "2019", doi = "10.1145/3354166.3354174", } @Book{constable82, author = "Robert L. Constable and Scott Johnson and Carl Eichelaub", title = "Introduction to the {PL}/{CV2} Programming Logic", series = lncs, volume = "135", publisher = "Springer, New York", year = "1982", } @Article{constable83, author = "Robert L. Constable", title = "Programs as proofs", journal = "Information Processing Letters", volume = "16", number = "3", pages = "105--112", year = "1983", } @TechReport{constable86, author = "Robert L. Constable", title = "The Semantics of Evidence", institution = "Cornell Computer Science Department", address = "Ithaca, NY", type = "Technical Report", year = "1986", } @Book{constable86book, author = "Robert L. Constable and others", title = "Implementing Mathematics with the Nuprl Proof Development System", publisher = "Prentice-Hall", year = "1986", } @InCollection{constable90abs, author = "Robert L. Constable and Douglas J. Howe", title = "Nuprl as a General Logic", booktitle = "Logic and Computer Science", editor = "Piergiorgio Odifreddi", publisher = "Academic Press", pages = "77--90", year = "1990", } @InCollection{constable90ftai, author = "Robert L. Constable and Douglas J. Howe", title = "Implementing Metamathematics as an Approach to Automatic Theorem Proving", booktitle = "Formal Techniques in Artificial Intelligence", editor = "R. Banerji", publisher = "North-Holland", year = "1990", } @Book{conway71book, author = "John H. Conway", title = "Regular algebra and finite machines", publisher = "Chapman and Hall", year = "1971", } @Article{cook79jsl, author = "Stephen A. Cook and Robert A. Reckhow", title = "The Relative Efficiency of Propositional Proof Systems", journal = jsl, volume = "44", number = "1", year = "1979", pages = "36--50", } @Misc{coq-elpi20web, author = "Enrico Tassi", title = "Coq plugin embedding {ELPI}", howpublished = "\url{https://github.com/LPCIC/coq-elpi}", year = "2020", } @TechReport{coq02manual, author = "The Coq Development Team", institution = "INRIA", month = feb, number = "255", title = "{The Coq Proof Assistant Reference Manual Version\ 7.2}", year = "2002", note = "\url{https://coq.inria.fr/}.", } @InProceedings{coquand85, author = "Thierry Coquand and G{\'{e}}rard Huet", title = "Constructions: {A} Higher Order Proof System for Mechanizing Mathematics", booktitle = "EUROCAL85", pages = "151--184", publisher = "Springer", address = "Linz", volume = "203", series = lncs, year = "1985", } @InBook{coquand86, author = "Thierry Coquand", editor = "G. Cousineau and P. L. Curien and B. Robinet", title = "Sur l'analogie entre les propositions et les types", pages = "71--84", publisher = "Springer", volume = "242", series = lncs, year = "1986", note = "translation by Walt Hill", } @InProceedings{coquand88colog, author = "Thierry Coquand and Christine Paulin", title = "Inductively defined types", booktitle = "Conference on Computer Logic", year = "1988", pages = "50--66", series = lncs, volume = "417", publisher = "Springer", } @Article{coquand88ic, author = "Thierry Coquand and G{\'{e}}rard Huet", title = "The Calculus of Constructions", journal = "Information and Computation", volume = "76", number = "2/3", month = feb # "/" # mar, year = "1988", pages = "95--120", } @InProceedings{coquand90colog, author = "Th. Coquand and C. Paulin-Mohring", booktitle = "Proceedings of Colog'88", editor = "P. Martin-L{\"o}f and G. Mints", series = lncs, publisher = "Springer", title = "Inductively defined types", year = "1990", } @InCollection{coquand94types, author = "Thierry Coquand", title = "Infinite Objects in Type Theory", editor = "H. Barendregt and T. Nipkow", booktitle = "Selected Papers 1st Int.\ Workshop on Types for Proofs and Programs, TYPES'93, Nijmegen, The Netherlands, 24--28 May 1993", series = lncs, volume = "806", pages = "62--78", publisher = "Springer", address = "Berlin", year = "1994", } @Article{coquand95jsl, author = "Thierry Coquand", title = "A Semantics of Evidence for Classical Arithmetic", journal = jsl, year = "1995", volume = "60", number = "1", pages = "325--337", } @Book{cormen01book, author = "Thomas H. Cormen and Charles E. Leiserson and Ronald L. Rivest and Clifford Stein", month = sep, publisher = "MIT Press", title = "Introduction to Algorithms, Second Edition", year = "2001", } @Article{corsi07jsl, author = "Giovanna Corsi and Gabriele Tassi", title = "Intuitionistic Logic Freed of All Metarules", journal = "J. of Symbolic Logic", year = "2007", volume = "72", number = "4", pages = "1204--1218", } @InProceedings{cosmo98plilp, author = "Roberto {Di Cosmo} and Jean-Vincent Loddo and Stephane Nicolet", title = "A Game Semantics Foundation for Logic Programming (Extended Abstract)", booktitle = "Principles of Declarative Programming: 10th International Symposium PLILP'98", series = lncs, number = "1490", editor = "C. Palamidessi and H. Glaser and K. Meinke", year = "1998", pages = "355--373", } @InProceedings{cousineau07tlca, title = "Embedding Pure Type Systems in the Lambda-{Pi}-Calculus Modulo", author = "Denis Cousineau and Gilles Dowek", booktitle = "Typed Lambda Calculi and Applications, 8th International Conference, {TLCA} 2007, Paris, France, June 26-28, 2007, Proceedings", publisher = "Springer", year = "2007", volume = "4583", editor = "Simona Ronchi Della Rocca", pages = "102--117", series = lncs, } @Book{cousineau86, editor = "G. Cousineau and P. L. Curien and B. Robinet", title = "Combinators and Functional Programming", publisher = "Springer", volume = "242", series = lncs, year = "1986", } @Article{cousineau87, author = "G. Cousineau and P-L. Curien and M. Mauny", title = "The Categorical Abstract Machine", journal = "The Science of Programming", volume = "8", number = "2", pages = "173--202", year = "1987", } @InProceedings{cousot77popl, author = "Patrick Cousot and Radhia Cousot", title = "Abstract Interpretation: {A} Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints", booktitle = "POPL", pages = "238--252", year = "1977", publisher = "ACM", } @Book{covington94nlp, author = "Michael A. Covington", year = "1994", title = "Natural Language Processing for {Prolog} Programmers", publisher = "Prentice-Hall", address = "Englewood Cliffs, New Jersey", } @Misc{cpf.website, title = "Certification Problem Format", year = "2015", howpublished = "\url{https://cl-informatik.uibk.ac.at/software/cpf/}", key = "CPF", } @InProceedings{craciunescu02, author = "Sorin Craciunescu", title = "Proving the Equivalence of {CLP} Programs", booktitle = "International Conference on Logic Programming , Copenhagen, Denmark 2002 (ICLP 2002)", year = "2002", } @Article{craig57jsl, author = "William Craig", title = "Three uses of the {Herbrand-Gentzen} theorem in relating model theory and proof theory", journal = jsl, year = "1957", volume = "22", number = "3", pages = "269--285", } @Article{crary08tocl, title = "Foundational certified code in the {Twelf} metalogical framework", author = "Karl Crary and Susmit Sarkar", journal = tocl, year = "2008", number = "3", volume = "9", doi = "10.1145/1352582.1352584", } @InProceedings{cruanes13vmcai, author = "Simon Cruanes and Gr{\'{e}}goire Hamon and Sam Owre and Natarajan Shankar", editor = "Roberto Giacobazzi and Josh Berdine and Isabella Mastroeni", title = "Tool Integration with the Evidential Tool Bus", booktitle = "Verification, Model Checking, and Abstract Interpretation, 14th International Conference, {VMCAI} 2013", series = lncs, volume = "7737", pages = "275--294", publisher = "Springer", year = "2013", doi = "10.1007/978-3-642-35873-9\_18", } @InProceedings{cruz17tacas, title = "Efficient certified resolution proof checking", author = "Lu{\'\i}s Cruz-Filipe and Joao Marques-Silva and Peter Schneider-Kamp", booktitle = "TACAS 2017: Tools and Algorithms for the Construction and Analysis of Systems", pages = "118--135", year = "2017", organization = "Springer", } @InProceedings{curien00icfp, author = "Pierre-Louis Curien and Hugo Herbelin", title = "The duality of computation", booktitle = "ICFP '00: Proceedings of the fifth ACM SIGPLAN international conference on Functional programming", year = "2000", pages = "233--243", publisher = "ACM Press", address = "New York, NY, USA", doi = "10.1145/357766.351262", } @Article{curien03bsl, author = "P.-L. Curien", title = "Symmetry and interactivity in programming", journal = "Bull. Symbolic Logic", year = "2003", volume = "9", number = "2", pages = "169--180", } @Article{curien05am, title = "Introduction to linear logic and ludics, {Part I}", author = "Pierre-Louis Curien", year = "2005", month = jan, number = "5", volume = "34", journal = "Advances in Mathematics (China)", pages = "513--544", URL = "https://arxiv.org/abs/cs/0501035", } @InProceedings{curien05csl, title = "{L}-nets, strategies and proof-nets", author = "Pierre-Louis Curien and Claudia Faggian", year = "2005", booktitle = csl05, editor = "C.-H. Luke Ong", publisher = "Springer", series = lncs, volume = "3634", pages = "167--183", } @Article{curien06am, title = "Introduction to linear logic and ludics, {Part II}", author = "Pierre-Louis Curien", year = "2006", month = jan, number = "1", volume = "35", journal = "Advances in Mathematics (China)", pages = "1--44", URL = "https://arxiv.org/abs/cs/0501039", } @InProceedings{curien10tcs, author = "Pierre{-}Louis Curien and Guillaume Munch{-}Maccagnoni", editor = "Cristian S. Calude and Vladimiro Sassone", title = "The Duality of Computation under Focus", booktitle = "Theoretical Computer Science - 6th {IFIP} {TC} 1/WG 2.2 International Conference, {TCS} 2010, Held as Part of {WCC} 2010, Brisbane, Australia, September 20-23, 2010. Proceedings", series = "{IFIP} Advances in Information and Communication Technology", volume = "323", pages = "165--181", publisher = "Springer", year = "2010", URL = "https://doi.org/10.1007/978-3-642-15240-5\_13", doi = "10.1007/978-3-642-15240-5\_13", } @TechReport{curien90, author = "P.-L. Curien", title = "The $\lambda\rho$-calculus: An Abstract Framework for Environment Machines", institution = "LIENS--CNRS", year = "1990", } @Article{curien94taoop, author = "Pierre-Louis Curien and Giorgio Ghelli", title = "Coherence of subsumption, minimum typing and type-checking in {F}$\leq$", journal = "Theoretical aspects of object-oriented programming: types, semantics, and language design", year = "1994", ISBN = "0-262-07155-X", pages = "247--292", publisher = "MIT Press", address = "Cambridge, MA, USA", } @Article{curry34pnas, author = "H. B. Curry", title = "Functionality in Combinatory Logic", volume = "20", number = "11", pages = "584--590", year = "1934", doi = "10.1073/pnas.20.11.584", publisher = "National Academy of Sciences", URL = "https://www.pnas.org/content/20/11/584", journal = "Proceedings of the National Academy of Sciences", } @Article{curry42jsl, author = "Haskell Curry", title = "The inconsistency of certain formal logics", journal = "Journal of Symbolic Logic", year = "1942", volume = "7", pages = "115--117", } @Book{curry80, editor = "Jonathan P. Seldin and J. Roger Hindley", title = "To {H}. {B}. Curry: Essays in Combinatory Logic, Lambda Calculus, and Formalism", publisher = "Academic Press", address = "New York", year = "1980", } @InProceedings{curzi23lics, author = "Gianluca Curzi and Anupam Das", title = "Computational expressivity of (circular) proofs with fixed points", booktitle = lics23, year = "2023", pages = "1--13", doi = "10.1109/LICS56636.2023.10175772", } @Article{dagostino94jlc, author = "Marcello D'Agostino and Marco Mondadori", title = "The Taming of the Cut. {Classical} Refutations with Analytic Cut", journal = jlc, volume = "4", number = "3", year = "1994", pages = "285--319", } @Book{dagostino99handbook, editor = "Marcello D'Agostino and Dov M. Gabbay and Reiner H{\"a}hnle and Joeachim Posegga", title = "Handbook of Tableau Methods", publisher = pub-sv, year = "1999", doi = "10.1007/978-94-017-1754-0", } @Book{dahl89book, author = "V.~Dahl and H.~Abramson", title = "Logic Grammars", publisher = "Springer", year = "1989", } @Article{dahl89ci, author = "Veronica Dahl", title = "Discontinuous grammars", journal = "Computational Intelligence", year = "1989", volume = "5", pages = "161--179", } @Article{dahl90ngc, author = "Veronica Dahl and Fred Popowich", title = "Parsing and generation with static discontinuity grammars", journal = "New Generation Computing", year = "1990", volume = "8", pages = "245--274", } @InProceedings{dallago08csl, author = "Ugo Dal Lago and Olivier Laurent", title = "Quantitative Game Semantics for Linear Logic", booktitle = csl08, year = "2008", number = "5213", series = lncs, pages = "230--245", } @Article{dallago09tocl, author = "Ugo {Dal Lago}", title = "The geometry of linear higher-order recursion", journal = "{ACM} Trans. Comput. Log.", volume = "10", number = "2", pages = "8:1--8:38", year = "2009", doi = "10.1145/1462179.1462180", } @Article{dalrymple91lp, author = "Mary Dalrymple and Stuart M. Shieber and Fernando C. N. Pereira", title = "Ellipsis and Higher-Order Unification", journal = "Linguistics and Philosophy", volume = "14", pages = "399--452", year = "1991", } @InProceedings{dalrymple95clnlp, author = "M. Dalrymple and J. Lamping and F. Pereira and V. Saraswat", title = "Linear logic for meaning assembly", booktitle = "Proceedings of the Workshop on Computational Logic for Natural Language Processing", year = "1995", } @InProceedings{damas82, author = "Luis Damas and Robin Milner", title = "Principal Type Schemes for Functional Programs", booktitle = "Proceedings of the {ACM} Conference on Principles of Programming Languages", pages = "207--212", year = "1982", } @InProceedings{danos03bc, author = "Vincent Danos and Jean Krivine", title = "Formal molecular biology done in {CCS}", booktitle = "Proceedings of BIO-CONCUR'03", pages = "31--49", year = "2003", volume = "180", number = "3", publisher = "Elsevier ENTCS", } @Article{danos04tcs, author = "Vincent Danos and Cosimo Laneve", title = "Formal molecular biology", journal = "Theor. Comput. Sci.", volume = "325", number = "1", year = "2004", ISSN = "0304-3975", pages = "69--110", doi = "10.1016/j.tcs.2004.03.065", publisher = "Elsevier Science Publishers Ltd.", address = "Essex, UK", } @Article{danos89aml, author = "V. Danos and L. Regnier", title = "The Structure of Multiplicatives", journal = "Archive for Mathematical Logic", volume = "28", year = "1989", pages = "181--203", } @InProceedings{danos93kgc, author = "Vincent Danos and Jean-Baptiste Joinet and Harold Schellinx", title = "The Structure of Exponentials: Uncovering the Dynamics of Linear Logic Proofs", year = "1993", pages = "159--171", editor = "Georg Gottlob and Alexander Leitsch and Daniele Mundici", booktitle = "Kurt G{\"o}del Colloquium", publisher = "Springer", series = lncs, volume = "713", } @InCollection{danos93wll, title = "{LKT} and {LKQ}: sequent calculi for second order logic based upon dual linear decompositions of classical implication", author = "V. Danos and J.-B. Joinet and H. Schellinx", booktitle = "Advances in Linear Logic", year = "1995", editor = "J.-Y. Girard and Y. Lafont and L. Regnier", pages = "211--224", publisher = "Cambridge University Press", number = "222", series = "London Mathematical Society Lecture Note Series", doi = "10.1017/CBO9780511629150", } @Article{danos94aml, title = "On the linear decoration of intuitionistic derivations", author = "Jean-Baptiste Joinet and Vincent Danos and Harold Schellinx", journal = "Archive for Mathematical Logic", year = "1994", volume = "33", pages = "387--412", note = "Slightly revised and condensed version of the 1993 technical report with the same title.", } @InCollection{danos95wll, author = "Vincent Danos and Laurent Regnier", title = "Proof-nets and {H}ilbert space", booktitle = "Advances in Linear Logic", editor = "J.-Y. Girard and Y. Lafont and L. Regnier", year = "1995", pages = "307--328", publisher = "Cambridge University Press", note = "Proceedings of the Workshop on Linear Logic, Ithaca, New York, June 1993", } @Article{danos97jsl, author = "Vincent Danos and Jean-Baptiste Joinet and Harold Schellinx", title = "A New Deconstructive Logic: Linear Logic", journal = "Journal of Symbolic Logic", year = "1997", volume = "62", number = "3", pages = "755--807", doi = "10.2307/2275572", } @InProceedings{danvy00esop, author = "Olivier Danvy", title = "Formalizing Implementation Strategies for First-Class Continuations", booktitle = "ESOP 2000: 9th European Symposium on Programming", pages = "88--103", year = "2000", } @Article{danvy03tcs, author = "Olivier Danvy and Lasse R. Nielsen", title = "A first-order one-pass {CPS} transformation", journal = "Theoretical Computer Science", year = "2003", volume = "308", number = "1-3", pages = "239--257", } @InProceedings{darbari10ictac, author = "Ashish Darbari and Bernd Fischer and Joao Marques-Silva", title = "Industrial-strength certified {SAT} solving through verified {SAT} proof checking", booktitle = "Theoretical Aspects of Computing-ICTAC 2010", pages = "260--274", year = "2010", publisher = "Springer", } @InCollection{darlington71mi, author = "J. L. Darlington", title = "A Partial Mechanization of Second-Order Logic", booktitle = "Machine Intelligence 6", publisher = "American Elsevier", year = "1971", pages = "91--100", } @InProceedings{das14csllics, author = "Anupam Das", title = "Pigeonhole and related combinatorial principles in deep inference and monotone systems", doi = "10.1145/2603088.2603164", booktitle = "Proceedings 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})", year = "2014", editor = "Tom Henzinger and Dale Miller", } @InProceedings{das18csl, author = "Anupam Das and Damien Pous", URL = "https://doi.org/10.4230/LIPIcs.CSL.2018.19", doi = "10.4230/LIPIcs.CSL.2018.19", editor = "Dan R. Ghica and Achim Jung", title = "Non-Wellfounded Proof Theory For (Kleene+Action)(Algebras+Lattices)", booktitle = "27th {EACSL} Annual Conference on Computer Science Logic, {CSL} 2018, September 4-7, 2018, Birmingham, {UK}", series = "LIPIcs", volume = "119", pages = "19:1--19:18", publisher = "Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik", year = "2018", } @Article{das19lmcs, title = "On the logical complexity of cyclic arithmetic", author = "Anupam Das", journal = "Log. Methods Comput. Sci", year = "2020", number = "1", volume = "16", doi = "10.4230/LIPIcs.FSCD.2021.29", } @InProceedings{das22fscd, title = "Decision problems for linear logic with least and greatest fixed points", author = "Anupam Das and Abhishek De and Alexis Saurin", booktitle = "7th International Conference on Formal Structures for Computation and Deduction (FSCD 2022)", year = "2022", organization = "Schloss Dagstuhl-Leibniz-Zentrum f{\"u}r Informatik", doi = "10.4230/LIPIcs.FSCD.2022.20", } @TechReport{dasilva90, author = "F. da Silva", title = "Towards a Formal Framework for Evaluation of Operational Semantics Specifications", institution = "Edinburgh University", year = "1990", type = "LFCS Report", number = "ECS-LFCS-90-126", } @Article{david01jsl, title = "$\lambda\mu$-Calculus and {B}{\"o}hm's Theorem", author = "Ren{\'e} David and Walter Py", journal = "J. Symb. Log", year = "2001", number = "1", volume = "66", pages = "407--413", } @InProceedings{david81ijcai, author = "Martin Davis", title = "Obvious Logical Inferences", pages = "530--531", editor = "Ann Drinan", booktitle = "Proceedings of the 7th International Joint Conference on Artificial Intelligence ({IJCAI} '81)", month = aug, publisher = "William Kaufmann", address = "Los Altos, CA", year = "1991", } @InCollection{davis88utm, author = "Martin Davis", title = "Influences of Mathematical Logic on Computer Science", booktitle = "The Universal {T}uring Machine: A Half-Century Survey", publisher = "Oxford University Press", year = "1988", editor = "Rolf Herkin", pages = "315--326", address = "Oxford", } @InProceedings{de22fsttcs, author = "Abhishek De and Farzad Jafarrahmani and Alexis Saurin", editor = "Anuj Dawar and Venkatesan Guruswami", title = "Phase Semantics for Linear Logic with Least and Greatest Fixed Points", booktitle = "42nd {IARCS} Annual Conference on Foundations of Software Technology and Theoretical Computer Science, {FSTTCS} 2022, December 18-20, 2022, {IIT} Madras, Chennai, India", series = "LIPIcs", volume = "250", pages = "35:1--35:23", publisher = "Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik", year = "2022", doi = "10.4230/LIPICS.FSTTCS.2022.35", } @Article{debakker82, author = "J. deBakker and J. Zucker", title = "Processes and the Denotational Semantics of Concurrency", journal = "Information and Control", volume = "54", year = "1982", pages = "70--120", } @Misc{debian2024wiki, key = "Debian", title = "{Debian's SecureApt}", URL = "https://wiki.debian.org/SecureApt", accessdate = "2024-02-07", } @InProceedings{debruijn70, author = "N. G. de Bruijn", title = "The Mathematical language {\sc automath}, its usage, and some of its extensions", booktitle = "Symposium on Automatic Demonstration", organization = "Lecture Notes in Mathematics, 125", publisher = "Springer", pages = "29--61", year = "1970", } @Article{debruijn72, author = "Nicolaas Govert de Bruijn", title = "Lambda Calculus Notation with Nameless Dummies, a Tool for Automatic Formula Manipulation, with an Application to the {Church-Rosser} Theorem", journal = "Indagationes Mathematicae", volume = "34", number = "5", publisher = "Elsevier", year = "1972", pages = "381--392", doi = "10.1016/1385-7258(72)90034-0", } @Article{debruijn78, author = "N. G. de Bruijn", title = "Lambda Calculus Notation with Namefree Formulas Involving Symbols that Represent Reference Transforming Mappings", journal = "Indag. Math.", volume = "40", number = "3", year = "1979", pages = "348--356", } @InCollection{debruijn80, author = "N. G. de Bruijn", title = "A Survey of the Project {AUTOMATH}", editor = "J. P. Seldin and R. Hindley", booktitle = "To H. B. Curry: Essays in Combinatory Logic, Lambda Calculus, and Formalism", pages = "589--606", publisher = "Academic Press", address = "New York", year = "1980", } @InProceedings{debruijn91lf, author = "N. G. de Bruijn", title = "A Plea for Weaker Frameworks", editor = "G. Huet and G. Plotkin", pages = "40--67", booktitle = "Logical Frameworks", year = "1991", publisher = "Cambridge University Press", keywords = "Automath", } @InCollection{debruijn94slfm, author = "Nicolaas Govert de Bruijn", title = "Reflections on automath", booktitle = "Selected Papers on Automath", pages = "201--228", publisher = "North-Holland", year = "1994", editor = "R. P. Nederpelt and J. H. Geuvers and R. C. de Vrijer", volume = "133", series = "Studies in Logic and the Foundations of Mathematics", } @Article{dechampeaux86jcss, title = "About the Paterson-Wegman linear unification algorithm", author = "Dennis De Champeaux", journal = "Journal of Computer and System Sciences", volume = "32", number = "1", pages = "79--90", year = "1986", publisher = "Elsevier", } @Misc{dedukti.website, title = "The {D}edukti system", year = "2013", howpublished = "\url{https://deducteam.github.io/}", key = "Dedukti", } @Misc{defstand97, author = "U. K. {Ministry of Defence}", title = "{UK} Defence Standardization", URL = "https://www.dstan.mod.uk/", month = aug, year = "1997", note = "DefStan 00-55", } @InProceedings{degano89lics, author = "P.~Degano and J.~Meseguer and U.~Montanari", title = "Axiomatizing net computations and processes", booktitle = lics89, pages = "175--185", publisher = "IEEE", year = "1989", } @InCollection{degtyarov01handbook, author = "Anatoli Degtyarev and Andrei Voronkov", title = "The Inverse Method", booktitle = "Handbook of Automated Reasoning (in 2 volumes)", pages = "179--272", year = "2001", editor = "John Alan Robinson and Andrei Voronkov", publisher = "Elsevier and {MIT} Press", } @InProceedings{delaTour87, author = "Thierry Boy de la Tour and Ricardo Caferra", title = "Proof Analogy In Interactive Theorem Proving: {A} Method To Express And Use It Via Second Order Pattern Matching", booktitle = "Proceedings of the Sixth National Conference on Artificial Intelligence", pages = "95--99", organization = "AAAI", publisher = "Morgan Kaufmann", address = "Seattle, WA", month = jul, year = "1987", } @InProceedings{delande08lics, author = "Olivier Delande and Dale Miller", title = "A neutral approach to proof and refutation in {MALL}", booktitle = lics08, year = "2008", editor = "F. Pfenning", publisher = "IEEE Computer Society Press", doi = "10.1016/j.apal.2009.07.017", pages = "498--508", URL = "https://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/lics08b.pdf", } @Unpublished{delande08tr, author = "Olivier Delande and Dale Miller", title = "A neutral approach to proof and refutation in {MALL}: extended report", note = "Available via the authors web pages", year = "2008", } @PhdThesis{delande09phd, author = "Olivier Delande", title = "Symmetric Dialogue Games in the Proof Theory of Linear Logic", school = "Ecole Polytechnique", year = "2009", month = oct, URL = "https://www.lix.polytechnique.fr/~delande/thesis.xhtml", } @Article{delande10apal, author = "Olivier Delande and Dale Miller and Alexis Saurin", title = "Proof and refutation in {MALL} as a game", journal = apal, month = feb, year = "2010", pages = "654--672", volume = "161", number = "5", doi = "10.1016/j.apal.2009.07.017", pdf = "https://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/apal-games.pdf", } @Article{delzanno02entcs, title = "An Overview of {MSR}({C}): {A} {CLP}-based Framework for the Symbolic Verification of Parameterized Concurrent Systems", author = "Giorgio Delzanno", journal = "Electron. Notes Theor. Comput. Sci", year = "2002", volume = "76", pages = "65--82", doi = "10.1016/S1571-0661(04)80786-2", } @InProceedings{delzanno95ilps, author = "Giorgio Delzanno and Maurizio Martelli", title = "Objects in {Forum}", booktitle = "Proceedings of the {International Logic Programming Symposium}", year = "1995", } @PhdThesis{demarco99phd, author = "Mary DeMarco", school = "Wesleyan University", title = "Intuitionistic Semantics for Heriditarily Harrop Logic Programming", year = "1999", } @InProceedings{demaria14fmmb, author = "Elisabetta De Maria and Jo{\"{e}}lle Despeyroux and Amy P. Felty", editor = "Fran{\c{c}}ois Fages and Carla Piazza", title = "A Logical Framework for Systems Biology", booktitle = "International Conference on Formal Methods in Macro-Biology (FMMB)", series = lncs, volume = "8738", pages = "136--155", publisher = pub-sv, year = "2014", doi = "10.1007/978-3-319-10398-3\_10", } @Article{demillo79cacm, author = "Richard A. De Millo and Richard J. Lipton and Alan J. Perlis", title = "Social Processes and Proofs of Theorems and Programs", journal = "Communications of the Association of Computing Machinery", volume = "22", number = "5", month = may, year = "1979", pages = "271--280", } @Article{denecker01tocl, author = "Marc Denecker and Maurice Bruynooghe and Victor Marek", title = "Logic programming revisited: {Logic} programs as inductive definitions", journal = tocl, volume = "2", number = "4", pages = "623--654", month = oct, year = "2001", } @Article{denicola84, author = "R. de Nicola and M. Hennessy", title = "Testing Equivalences for Processes", journal = "Theoretical Computer Science", volume = "34", year = "1984", pages = "83--133", } @InProceedings{denivelle02csl, author = "Hans de Nivelle", title = "Extraction of Proofs from the Clausal Normal Form Transformation", booktitle = "CSL: 16th Workshop on Computer Science Logic", publisher = "Springer-Verlag", series = lncs, volume = "2471", pages = "584--598", year = "2002", } @Article{denivelle05ic, title = "Translation of resolution proofs into short first-order proofs without choice axioms", author = "Hans de Nivelle", journal = "Information and Computation", year = "2005", number = "1-2", volume = "199", pages = "24--54", } @InProceedings{denker98wfsp, author = "G. Denker and J. Meseguer and C. Talcott", title = "Protocol Specification and Analysis in {Maude}", booktitle = "Proc. of Workshop on Formal Methods and Security Protocols", year = "1998", editor = "N. Heintze and J. Wing", address = "Indianapolis, Indiana", month = jun, } @InProceedings{dennis97cade, author = "L. Dennis and A. Bundy and I. Green", title = "Using a Generalisation Critic to Find Bisimulations for Coinductive Proofs", pages = "276--290", editor = "William McCune", booktitle = cade97, month = jul, series = lnai, volume = "1249", publisher = "Springer", address = "Berlin", year = "1997", } @InProceedings{depaiva91al, author = "Valeria De~Paiva", title = "A {Dialectica} model of the {Lambek} calculus", booktitle = "8th Amsterdam Logic Colloquium", year = "1991", address = "Amsterdam", month = dec, } @InCollection{deplagne03cade, title = "Proof search and proof check for equational and inductive theorems", author = "Eric Deplagne and Claude Kirchner and H{\'e}lene Kirchner and Quang Huy Nguyen", booktitle = "CADE-19", pages = "297--316", year = "2003", publisher = "Springer", } @Article{dershowitz08bsl, title = "A Natural Axiomatization of Computability and Proof of Church's Thesis", author = "Nachum Dershowitz and Yuri Gurevich", journal = "Bulletin of Symbolic Logic", year = "2008", number = "3", volume = "14", pages = "299--350", URL = "https://www.math.ucla.edu/~asl/bsl/1403/1403-002.ps", } @Article{dershowitz79cacm, author = "Nachum Dershowitz and Zohar Manna", title = "Proving termination with multiset orderings", journal = "Communications of the ACM", year = "1979", volume = "22", number = "8", pages = "465--476", } @InProceedings{despeyroux00ifiptcs, author = "Jo{\"e}lle Despeyroux", title = "A Higher-order specification of the $\pi$-calculus", booktitle = "Proc. of the IFIP International Conference on Theoretical Computer Science, IFIP TCS'2000, Sendai, Japan, August 17-19, 2000.", pages = "425--439", month = aug, year = "2000", } @Article{despeyroux00jflp, author = "Jo{\"e}lle Despeyroux and Pierre Leleu", title = "Metatheoretic Results for a Modal lambda-Calculus", journal = "Journal of Functional and Logic Programming (JFLP)", volume = "2000", number = "1", publisher = "MIT Press", month = jan, year = "2000", } @Article{despeyroux01mscs, author = "Jo{\"e}lle Despeyroux and Pierre Leleu", title = "Recursion over Objects of Functional Type", journal = "Special issue of MSCS on `Modalities in Type Theory'", volume = "11", number = "4", month = aug, year = "2001", } @Article{despeyroux01tcs, author = "Jo{\"e}lle Despeyroux and Frank Pfenning and Carsten Schr{\"u}mann", title = "Primitive Recursion for Higher-Order Abstract Syntax", journal = "Theoretical Computer Science (TCS)", volume = "266", number = "1-2", pages = "1--57", month = sep, year = "2001", } @InProceedings{despeyroux14types, author = "Jo{\"e}lle Despeyroux and Kaustuv Chaudhuri", title = "A Hybrid Linear Logic for Constrained Transition Systems", booktitle = "Post Proceedings of Types for Proofs and Programs (TYPES 2013)", year = "2014", editor = "Aleksy Schubert and Ralph Matthes", series = lipics, volume = "26", pages = "150--168", doi = "10.4230/LIPIcs.TYPES.2013.150", URL = "https://hal.inria.fr/inria-00402942", } @InProceedings{despeyroux16cmsb, author = "Jo{\"{e}}lle Despeyroux", editor = "Ezio Bartocci and Pietro Li{\`{o}} and Nicola Paoletti", title = "(Mathematical) Logic for Systems Biology (Invited Paper)", booktitle = "Proceedings of CMSB", series = lncs, volume = "9859", pages = "3--12", publisher = pub-sv, year = "2016", doi = "10.1007/978-3-319-45177-0\_1", } @InProceedings{despeyroux16lsfa, author = "Jo{\"{e}}lle Despeyroux and Carlos Olarte and Elaine Pimentel", title = "Hybrid and Subexponential Linear Logics Technical Report", booktitle = "Proceedings of LSFA", year = "2016", URL = "https://arxiv.org/abs/1608.08779", series = "ENTCS", volume = "332", publisher = "Elsevier", } @Article{despeyroux16tr, author = "Jo{\"{e}}lle Despeyroux and Carlos Olarte and Elaine Pimentel", title = "Hybrid and Subexponential Linear Logics: Technical Report", year = "2016", note = "Available as \url{https://arxiv.org/abs/1608.08779}", } @InProceedings{despeyroux84, author = "Thierry Despeyroux", title = "Executable Specification of Static Semantics", booktitle = "Semantics of Data Types", publisher = "Springer", month = jun, year = "1984", series = lncs, volume = "173", } @InProceedings{despeyroux86lics, author = "Jo{\"e}lle Despeyroux", title = "Proof of Translation in Natural Semantics", booktitle = lics86, address = "Cambridge, Mass", month = jun, pages = "193--205", year = "1986", publisher = "IEEE", } @TechReport{despeyroux88tr, author = "Thierry Despeyroux", title = "{TYPOL}: {A} Formalism to Implement Natural Semantics", type = "Research Report", number = "94", institution = "INRIA", address = "Rocquencourt, France", month = mar, year = "1988", } @TechReport{despeyroux90tr, author = "Jo{\"e}lle Despeyroux", title = "Theo: an interactive proof development system. {U}ser's manual", institution = "INRIA", year = "1990", month = feb, number = "RT 116", URL = "https://hal.inria.fr/inria-00070050", } @Article{despeyroux92bit, author = "Jo{\"e}lle Despeyroux", journal = "The Scandinavian Journal on Computer Science and Numerical Analysis ({BIT}), special issue on `Programming Logic'", editor = "Pr. Carl-Erik Fr{\"o}berg", title = "Theo: an interactive proof development system", volume = "32", pages = "15--29", year = "1992", note = "Preliminary version available as INRIA Research Report no. 887, August 1988", } @InProceedings{despeyroux94lpar, author = "Jo{\"e}lle Despeyroux and Andre Hirschowitz", title = "Higher-order abstract syntax with induction in {Coq}", booktitle = "Fifth International Conference on Logic Programming and Automated Reasoning (LPAR)", pages = "159--173", month = jun, year = "1994", } @InProceedings{despeyroux95tlca, author = "Jo{\"{e}}lle Despeyroux and Amy Felty and Andre Hirschowitz", title = "Higher-order abstract syntax in {Coq}", booktitle = "Second International Conference on Typed Lambda Calculi and Applications", pages = "124--138", month = apr, year = "1995", publisher = "Springer", doi = "10.1007/BFb0014049", } @InProceedings{despeyroux97tlca, author = "Jo{\"{e}}lle Despeyroux and Frank Pfenning and Carsten Sch{\"u}rmann", title = "Primitive Recursion for Higher-Order Abstract Syntax", booktitle = "Third International Conference on Typed Lambda Calculi and Applications", month = apr, year = "1997", } @TechReport{despeyroux98lnotes, author = "Jo{\"{e}}lle Despeyroux", title = "{S}\'emantique {N}aturelle: {S}p\'ecfications et {P}reuves", institution = "INRIA", type = "Research Report", number = "RR-3359", month = feb, year = "1998", note = "Lecture notes for a graduate course in the DEA ``Math\'ematiques Discr\`etes et Fondements de l'Informatique'' (MDFI), Marseille, 1995-1999 (80 pages, in french)", URL = "ftp://zenon.inria.fr:/pub/rapports/RR-3359.ps", } @InProceedings{despeyroux98types, author = "Jo{\"{e}}lle Despeyroux and Pierre Leleu", title = "A modal $\lambda$-calcul with iteration and case constructs", booktitle = "proceedings of the annual Types for Proofs and Programs seminar", publisher = "Springer", series = lncs, volume = "1657", location = "Kloster Irsee, Deutschland, 27-31 March", month = mar, year = "1998", } @InProceedings{despeyroux99imla, author = "Jo{\"{e}}lle Despeyroux and Pierre Leleu", title = "Primitive recursion for higher-order abstract syntax with dependant types", booktitle = "Informal proceedings of the {FLoC}'99 {IMLA} Workshop on Intuitionistic Modal Logics and Applications", location = "trento, Italy", month = jun, year = "1999", } @InProceedings{deyoung16aplas, title = "Substructural proofs as automata", author = "Henry DeYoung and Frank Pfenning", booktitle = "Asian Symposium on Programming Languages and Systems", pages = "3--22", year = "2016", organization = "Springer", } @InProceedings{dias16icwe, title = "Distributed Web Applications with {IPFS}, Tutorial", author = "David Dias and Juan Benet", booktitle = "Web Engineering - 16th International Conference, ICWE 2016, Lugano, Switzerland, June 6-9, 2016. Proceedings", publisher = "Springer", year = "2016", series = lncs, volume = "9671", editor = "Alessandro Bozzon and Philippe Cudr{\'e}-Mauroux and Cesare Pautasso", pages = "616--619", } @InCollection{dicosmo06sep, author = "Roberto {Di Cosmo} and Dale Miller", title = "Linear Logic", booktitle = "The Stanford Encyclopedia of Philosophy", publisher = "Stanford University", editor = "Edward N. Zalta", URL = "https://plato.stanford.edu/archives/fall2006/entries/logic-linear/", year = "2006", } @InCollection{dicosmo19sep, author = "Roberto {Di Cosmo} and Dale Miller", title = "Linear Logic", booktitle = "The Stanford Encyclopedia of Philosophy", editor = "Edward N. Zalta", howpublished = "\url{https://plato.stanford.edu/archives/sum2019/entries/logic-linear/}", year = "2019", edition = "Summer 2019", publisher = "Metaphysics Research Lab, Stanford University", } @TechReport{dietzen88cmu, author = "Scott Dietzen", title = "The {Ergo} Approach to Syntax", institution = "Carnegie Mellon University", address = "Pittsburgh", type = "Ergo Report", number = "88-072", year = "1988", } @TechReport{dietzen89cmu, author = "Scott Dietzen and Frank Pfenning", title = "Explanation-Based Learning in Logic Programming", institution = "School of Computer Science, Carnegie Mellon University", address = "Pittsburgh, Pennsylvania", type = "Ergo Report", number = "89-086", month = nov, year = "1989", } @InProceedings{dietzen89wml, author = "Scott Dietzen and Frank Pfenning", title = "Higher-Order and Modal Logic as a Framework for Explanation-Based Generalization", booktitle = "Sixth International Workshop on Machine Learning", note = "Expanded version available as Technical Report CMU-CS-89-160, Carnegie Mellon University, Pittsburgh", month = jun, year = "1989", publisher = "Morgan Kaufmann Publishers", editor = "Alberto Maria Segre", address = "San Mateo, California", pages = "447--449", } @InProceedings{dietzen91ilps, author = "Scott Dietzen and Frank Pfenning", title = "A declarative alternative to assert in logic programming", booktitle = "Proceedings of the 1991 International Logic Programming Symposium", publisher = "MIT Press", pages = "372--386", year = "1991", } @Article{dietzen92ml, key = "Dietzen92", author = "Scott Dietzen and Frank Pfenning", title = "Higher-Order and Modal Logic as a Framework for Explanation-Based Generalization", journal = "Machine Learning", year = "1992", volume = "9", pages = "23--55", } @Book{dijkstra76book, author = "Edsger W. Dijkstra", title = "A Discipline of Programming", publisher = "Prentice-Hall", year = "1976", } @Book{doets96basic, author = "Kees Doets", title = "Basic Model Theory", publisher = "{CSLI} Publications", address = "Stanford, California", year = "1996", URL = "https://citeseer.ist.psu.edu/doets95basic.html", } @Article{dolev83tit, author = "D. Dolev and A. Yao", title = "On the security of public-key protocols", journal = "IEEE Transactions on Information Theory", year = "1983", volume = "2", number = "29", } @Article{donnelly07entcs, author = "Kevin Donnelly and Hongwei Xi", title = "A Formalization of Strong Normalization for Simply-Typed Lambda-Calculus and System {F}", journal = entcs, volume = "174", number = "5", year = "2007", ISSN = "1571-0661", pages = "109--125", publisher = "Elsevier Science Publishers B. V.", address = "Amsterdam, The Netherlands, The Netherlands", } @TechReport{donzeau-gouge80inria, title = "Programming Environments Based on Structured Editors: The {MENTOR} Experience", author = "Veronique Donzeau-Gouge and Gerard Huet and Gilles Kahn and Bernard Lang", abstract = "This note discusses the MENTOR program manipulation system, from the following points of view: the main design decisions made in MENTOR; the authors' experience with building and using a PASCAL programming environment based on MENTOR; and the authors' vision of a complete programming environment.", institution = "Inria", year = "1980", key = "inria-00076535", } @InCollection{donzeau-gouge84ipe, author = "V. Donzeau-Gouge and G. Huet and G. Kahn", title = "Programming environments based on structured editors: the {MENTOR} experience", editor = "D. R. Barstow and H. E. Shrobe and E. Sandewall", booktitle = "Interactive Programming Environments", publisher = "McGraw-Hill", year = "1984", } @Article{dosen90imb, author = "Kosta Do\v{s}en", title = "Modal Translations of Heyting and Peano Arithmetic", journal = "Publications de L'institut Math�atique (Beograd)", year = "1990", volume = "47", number = "61", pages = "13--23", } @TechReport{douceur11tr, author = "John R. Douceur and Jacob R. Lorch and Bryan Parno and James Mickens and Jonathan M. McCune", title = "Memoir: Formal Specs and Correctness Proofs", institution = "Microsoft Research", year = "2011", number = "MSR-TR-2011-19", address = feb, URL = "https://research.microsoft.com/apps/pubs/default.aspx?id=144962", } @Article{dougherty93tcs, author = "D. J. Dougherty", title = "Higher-Order Unification via Combinators", journal = "Theoretical Computer Science", volume = "114", number = "2", year = "1993", pages = "273--298", publisher = "Elsevier Science Publishers Ltd.", } @Article{dovier04tcs, author = "Agostino Dovier and Carla Piazza and Alberto Policriti", title = "An efficient algorithm for computing bisimulation equivalence", journal = "Theoretical Computer Science", year = "2004", volume = "311", number = "1-3", pages = "221--256", month = jan, } @Article{dowek00ic, author = "G. Dowek and T. Hardin and C. Kirchner", title = "Higher Order Unification via Explicit Substitutions", journal = "Information and Computation", volume = "157", number = "1-2", year = "2000", pages = "183--235", publisher = "Academic Press, Inc.", } @InCollection{dowek01handbook, title = "Higher-order unification and matching", author = "Gilles Dowek", chapter = "16", booktitle = "Handbook of Automated Reasoning", publisher = "Elsevier Science", address = "New York", editor = "A. Robinson and A. Voronkov", year = "2001", volume = "II", pages = "1009--1062", } @Article{dowek01mscs, author = "Gilles Dowek and Th{\'e}r{\`e}se Hardin and Claude Kirchner", title = "{HOL-$\lambda \sigma$} an intentional first-order expression of higher-order logic", journal = "Mathematical Structures in Computer Science", year = "2001", volume = "11", number = "1", pages = "1--25", } @Article{dowek03jar, title = "Theorem Proving Modulo", author = "Gilles Dowek and Th{\'e}r{\`e}se Hardin and Claude Kirchner", journal = jar, number = "1", volume = "31", pages = "31--72", publisher = "Kluwer Academic Publishers", year = "2003", } @Article{dowek03jsl, title = "Proof normalization modulo", author = "Gilles Dowek and Benjamin Werner", journal = "Journal of Symbolic Logic", volume = "68", year = "2003", number = "4", pages = "1289--1316", URL = "https://projecteuclid.org/euclid.jsl/1067620188", } @InProceedings{dowek05rta, author = "Gilles Dowek and Benjamin Werner", editor = "J{\"{u}}rgen Giesl", title = "Arithmetic as a Theory Modulo", booktitle = "Term Rewriting and Applications, 16th International Conference, {RTA} 2005, Nara, Japan, April 19-21, 2005, Proceedings", series = "Lecture Notes in Computer Science", volume = "3467", pages = "423--437", publisher = "Springer", year = "2005", URL = "https://doi.org/10.1007/978-3-540-32033-3\_31", doi = "10.1007/978-3-540-32033-3\_31", timestamp = "Wed, 25 Sep 2019 18:23:35 +0200", biburl = "https://dblp.org/rec/conf/rta/DowekW05.bib", bibsource = "dblp computer science bibliography, https://dblp.org", } @InProceedings{dowek05rta, author = "Gilles Dowek and Benjamin Werner", editor = "J{\"{u}}rgen Giesl", title = "Arithmetic as a Theory Modulo", booktitle = "Term Rewriting and Applications, 16th International Conference, {RTA} 2005, Nara, Japan, April 19-21, 2005, Proceedings", series = lncs, volume = "3467", pages = "423--437", publisher = "Springer", year = "2005", doi = "10.1007/978-3-540-32033-3\_31", } @Article{dowek06tcs, author = "Gilles Dowek and Ying Jiang", title = "Eigenvariables, Bracketing and the Decidability of Positive Minimal Predicate Logic", journal = "Theoretical Computer Science", volume = "360", number = "1-3", year = "2006", } @Book{dowek07book, author = "Gille Dowek", title = "Les m\'{e}tamorphoses du calcul : Une \'{e}tonnante histoire des math\'{e}matiques", publisher = "Le Ponnier", year = "2007", } @InCollection{dowek08andrews, author = "Gilles Dowek", title = "Skolemization in Simple Type Theory: the Logical and the Theoretical Points of View", booktitle = "Reasoning in Simple Type Theory: Festschrift in Honor of Peter B. Andrews on His 70th Birthday", publisher = "College Publications", editor = "Christoph Benzm{\"u}ller and Chad E. Brown and J{\"o}rg Siekmann and Richard Statman", year = "2008", series = "Studies in Logic", number = "17", pages = "244--255", } @Article{dowek12tocl, author = "Gilles Dowek and Murdoch J. Gabbay", title = "Permissive-nominal logic: First-order logic over nominal terms and sets", journal = tocl, year = "2012", doi = "10.1145/2287718.2287720", volume = "13", number = "3", } @Article{dowek17dag, author = "Gilles Dowek and Catherine Dubois and Brigitte Pientka and Florian Rabe", title = "{Universality of Proofs (Dagstuhl Seminar 16421)}", pages = "75--98", journal = "Dagstuhl Reports", ISSN = "2192-5283", year = "2017", volume = "6", number = "10", editor = "Gilles Dowek and Catherine Dubois and Brigitte Pientka and Florian Rabe", publisher = "Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik", address = "Dagstuhl, Germany", URL = "https://drops.dagstuhl.de/opus/volltexte/2017/6951", doi = "10.4230/DagRep.6.10.75", } @Misc{dowek19logipedia, title = "Logipedia: a multi-system encyclopedia of formal proofs", author = "Gilles Dowek and Fran{\c{c}}ois Thir{\'e}", howpublished = "\url{https://www.lsv.fr/~dowek/Publi/logipedia.pdf}", year = "2019", } @TechReport{dowek23logipedia, author = "Gilles Dowek and Fran{\c{c}}ois Thir{\'{e}}", title = "Logipedia: a multi-system encyclopedia of formal proofs", number = "abs/2305.00064", year = "2023", institution = "ArXiV", doi = "10.48550/ARXIV.2305.00064", } @InProceedings{dowek92lics, author = "Gilles Dowek", title = "Third Order Matching is Decidable", booktitle = lics92, address = "Santa Cruz, California", publisher = "IEEE Computer Society Press", pages = "2--10", month = jun, year = "1992", } @Article{dowek93jlc, author = "Gilles Dowek", title = "A complete proof synthesis method for the cube of type systems", journal = jlc, year = "1993", volume = "3", number = "3", pages = "287--315", } @TechReport{dowek93tr, author = "Gilles Dowek and Amy Felty and G\`erard Huet Hugo Herbelin and Chet Murthy and Catherine Parent and Christine Paulin-Mohring and Benjamin Werner", title = "The Coq proof assistant user's guide", institution = "INRIA, Rocquencourt, France", year = "1993", } @InProceedings{dowek95lics, author = "G. Dowek and Th. Hardin and C. Kirchner", title = "Higher-order unification via explicit substitutions", booktitle = lics95, year = "1995", editor = "D. Kozen", pages = "366--374", } @InProceedings{dowek96jicslp, author = "G. Dowek and Th. Hardin and C. Kirchner and F. Pfenning", title = "Higher-order unification via explicit substitutions: the case of higher-order patterns", booktitle = "Joint International Conference and Symposium on Logic Programming", year = "1996", pages = "259--273", editor = "M. Maher", } @Article{dowling84jlp, author = "W. F. Dowling and J. H. Gallier", title = "Linear-time Algorithms for Testing the Satisfiability of Propositional Horn Formulae", journal = "Journal of Logic Programming", year = "1984", number = "3", pages = "267--284", } @Book{dowty81, title = "Introduction to Montague Semantics", author = "D. Dowty and R. Wall and S. Peters", publisher = "D. Reidel Publishing Co.", address = "Boston", year = "1981", } @Book{dragalin79, author = "A. G. Dragalin", title = "Mathematical Intuitionism: Introduction to Proof Theory", publisher = "American Mathematical Society", address = "Providence, Rhode Island", volume = "67", series = "Translations of Mathematical Monographs", year = "1988", } @InProceedings{dragalin87a, author = "A. G. Dragalin", title = "A Completeness Theorem for Higher-Order Intuitionistic Logic: An Intuitionistic Proof", booktitle = "Mathematical Logic and its Applications: Proceedings of the Summer School in Sofia, Bulgaria", editor = "D. Skordev", year = "1987", } @Article{dreben63ams, author = "Burton Dreben and Peter Andrews and St\aa l Aanderaa", title = "False Lemmas in {Herbrand}", journal = "Bulletin of the American Mathematical Society", year = "1963", volume = "69", pages = "699--706", } @Book{dreben79, author = "Burton Dreben and Warren D. Goldfarb", title = "The Decision Problem: Solvable Classes of Quantificational Formulas", publisher = "Addison-Wesley Publishing Company", address = "Reading, MA", year = "1979", } @Article{duggan98tcs, title = "Unification with extended patterns", author = "Dominic Duggan", journal = "Theoretical Computer Science", volume = "206", number = "1", pages = "1--50", year = "1998", publisher = "Elsevier", } @Book{dummett77, author = "Michael Dummett", title = "Elements of Intuitionism", publisher = "Clarendon Press", address = "Oxford", year = "1977", } @InProceedings{dunchev15lpar, author = "Cvetan Dunchev and Ferruccio Guidi and Claudio Sacerdoti Coen and Enrico Tassi", title = "{ELPI:} Fast, Embeddable, $\lambda${Prolog} Interpreter", booktitle = "Logic for Programming, Artificial Intelligence, and Reasoning, {LPAR-20}", editor = "Martin Davis and Ansgar Fehnker and Annabelle McIver and Andrei Voronkov", publisher = pub-sv, series = lncs, volume = "9450", pages = "460--468", year = "2015", doi = "10.1007/978-3-662-48899-7\_32", } @InProceedings{dunchev16lfmtp, author = "Cvetan Dunchev and Claudio Sacerdoti Coen and Enrico Tassi", title = "Implementing {HOL} in an Higher Order Logic Programming Language", booktitle = "Proceedings of the Eleventh Workshop on Logical Frameworks and Meta-Languages: Theory and Practice, {LFMTP} 2016, Porto, Portugal, June 23, 2016", pages = "4:1--4:10", year = "2016", doi = "10.1145/2966268.2966272", editor = "Gilles Dowek and Daniel R. Licata and Sandra Alves", publisher = "{ACM}", } @Article{durgin04jcs, title = "Multiset rewriting and the complexity of bounded security protocols", author = "Nancy A. Durgin and Patrick Lincoln and John C. Mitchell and Andre Scedrov", journal = "J. Computer Security", year = "2004", number = "2", volume = "12", pages = "247--311", doi = "10.3233/JCS-2004-12203", } @InCollection{durgin99csd, author = "N. A. Durgin and J. C. Mitchell", title = "Analysis of Security Protocols", booktitle = "Calculational System Design", editor = "M. Broy and R. Steinbruggen", publisher = "IOS Press", pages = "369--395", year = "1999", } @Article{dwork14fttcs, author = "Cynthia Dwork and Aaron Roth", title = "The Algorithmic Foundations of Differential Privacy.", journal = "Foundations and Trends in Theoretical Computer Science", volume = "9", number = "3-4", pages = "211--407", year = "2014", } @Article{dyckhoff00jsl, author = "Roy Dyckhoff and Sara Negri", title = "Admissibility of Structural Rules for Contraction-Free Systems of Intuitionistic Logic", journal = jsl, year = "2000", volume = "65", number = "4", pages = "1499--1518", } @InProceedings{dyckhoff06cie, author = "R. Dyckhoff and S. Lengrand", title = "{LJQ}: a strongly focused calculus for intuitionistic logic", booktitle = "Computability in Europe 2006", pages = "173--185", year = "2006", editor = "A. Beckmann and \emph{et al.}", volume = "3988", series = lncs, publisher = "Springer", } @Article{dyckhoff07jlc, author = "Roy Dyckhoff and Stephane Lengrand", title = "Call-by-Value $\lambda$-calculus and {LJQ}", journal = jlc, year = "2007", volume = "17", number = "6", pages = "1109--1134", doi = "10.1093/logcom/exm037", } @Article{dyckhoff12aml, author = "Roy Dyckhoff and Sara Negri", title = "Proof analysis in intermediate logics", year = "2012", journal = "Archive for Mathematical Logic", volume = "51", number = "1-2", doi = "10.1007/s00153-011-0254-7", URL = "https://dx.doi.org/10.1007/s00153-011-0254-7", publisher = "Springer-Verlag", pages = "71--92", } @Article{dyckhoff15bsl, title = "Geometrisation of first-order logic", author = "Roy Dyckhoff and Sara Negri", journal = "The Bulletin of Symbolic Logic", volume = "21", number = "02", pages = "123--163", year = "2015", publisher = "Cambridge Univ Press", } @Article{dyckhoff18jsl, author = "Roy Dyckhoff", title = "Contraction-Free Sequent Calculi for Intuitionistic Logic: {A} Correction", journal = jsl, year = "2018", volume = "83", pages = "1680--1682", month = dec, } @InProceedings{dyckhoff88plt, author = "Roy Dyckhoff", title = "Implementing a simple proof assistant", booktitle = "Workshop on Programming for Logic Teaching", pages = "49--59", year = "1988", } @Article{dyckhoff92jsl, author = "Roy Dyckhoff", title = "Contraction-free sequent calculi for intuitionistic logic", month = sep, year = "1992", volume = "57", number = "3", pages = "795--807", journal = jsl, doi = "10.2307/2275431", } @Article{dyckhoff98sl, title = "Cut-Elimination and a Permutation-Free Sequent Calculus for Intuitionistic Logic", author = "Roy Dyckhoff and Luis Pinto", journal = "Studia Logica", year = "1998", number = "1", volume = "60", pages = "107--118", } @Article{earley70cacm, author = "J. Earley", title = "An efficient context-free parsing algorithm", journal = "Communications of the ACM", year = "1970", pages = "94--102", month = feb, volume = "13", number = "2", } @InProceedings{ebner16ijcar, title = "System Description: {GAPT} 2.0", author = "Gabriel Ebner and Stefan Hetzl and Giselle Reis and Martin Riener and Simon Wolfsteiner and Sebastian Zivota", booktitle = "Proceedings of the 8th International Joint Conference on Automated Reasoning, {IJCAR} 2016", publisher = "Springer", year = "2016", volume = "9706", editor = "Nicola Olivetti and Ashish Tiwari", ISBN = "978-3-319-40228-4", pages = "293--301", series = lncs, doi = "10.1007/978-3-319-40229-1", } @Article{egly99complexity, author = "Uwe Egly and Stephan Schmitt", title = "On Intuitionistic Proof Transformations, Their Complexity, and Application to Constructive Program Synthesis", journal = "Fundam. Inf.", volume = "39", number = "1-2", month = jul, year = "1999", ISSN = "0169-2968", pages = "59--83", } @Article{ehrhard12tcs, author = "Thomas Ehrhard", title = "The Scott model of linear logic is the extensional collapse of its relational model", journal = "Theoretical Computer Science", year = "2012", volume = "424", number = "23", pages = "20--45", month = mar, doi = "10.1016/j.tcs.2011.11.027", } @InProceedings{ehrhard21lics, title = "Categorical models of Linear Logic with fixed points of formulas", author = "Thomas Ehrhard and Farzad Jafarrahmani", publisher = "IEEE", year = "2021", month = jun, pages = "1--13", booktitle = "36th ACM/IEEE Symposium on Logic in Computer Science (LICS 2021), Jun 2021, Rome, Italy", doi = "10.1109/LICS52264.2021.9470664", } @Article{ehrhard93mscs, author = "Thomas Ehrhard", title = "Hypercoherences: {A} Strongly Stable Model of Linear Logic", journal = "Mathematical Structures in Computer Science", year = "1993", volume = "3", number = "4", pages = "365--385", } @Unpublished{elliott89elp, author = "Conal Elliott and Frank Pfenning", title = "{eLP, a Common Lisp Implementation of $\lambda$Prolog}", month = may, year = "1989", note = "Implemented as part of the CMU ERGO project", } @InProceedings{elliott89rta, author = "Conal Elliott", title = "Higher-Order Unification with Dependent Types", booktitle = "Rewriting Techniques and Applications", series = lncs, publisher = "Springer", volume = "355", month = apr, year = "1989", pages = "121--136", } @InCollection{elliott91semi, author = "Conal Elliott and Frank Pfenning", title = "A Semi-Functional Implementation of a Higher-Order Logic Programming Language", booktitle = "Topics in Advanced Language Implementation", editor = "Peter Lee", publisher = "MIT Press", year = "1991", pages = "289--325", } @Article{emden76jacm, author = "{Maarten H. van} Emden and Robert A. Kowalski", title = "The Semantics of Predicate Logic as a Programming Language", journal = jacm, year = "1976", volume = "23", number = "4", pages = "733--742", } @Article{emden86jlp, author = "{Maarten H. van} Emden", title = "Quantitative Deduction and its Fixpoint Theory", journal = "J. of Logic Programming", volume = "3", number = "1", year = "1986", pages = "37--53", } @InProceedings{emerson08bmc, title = "The Beginning of Model Checking: {A} Personal Perspective", author = "E. Allen Emerson", booktitle = "25 Years of Model Checking - History, Achievements, Perspectives", publisher = "Springer", year = "2008", volume = "5000", editor = "Orna Grumberg and Helmut Veith", ISBN = "978-3-540-69849-4", pages = "27--45", series = "Lecture Notes in Computer Science", URL = "https://dx.doi.org/10.1007/978-3-540-69850-0\_2", doi = "10.1007/978-3-540-69850-0\_2", } @Book{emerson60book, author = "Ralph Waldo Emerson", title = "The Conduct of Life", publisher = "Smith, Elder", year = "1860", edition = "2nd", } @InCollection{emerson80icalp, author = "E. A. Emerson and E. M. Clarke", title = "Characterizing correctness properties of parallel programs using fixpoints", booktitle = "Proceedings of the 7th International Colloquium on Automata, Languages and Programming, ICALP'80 (Noordwijkerhout, NL, July 14-18, 1980)", pages = "169--181", year = "1980", volume = "85", series = lncs, editor = "J. W. de Bakker and J. van Leeuwen", publisher = pub-sv, } @InCollection{enderton12sep, author = "Herbert B. Enderton", title = "Second-order and Higher-order Logic", booktitle = "The Stanford Encyclopedia of Philosophy", editor = "Edward N. Zalta", howpublished = "\url{https://plato.stanford.edu/archives/fall2012/entries/logic-higher-order/}", publisher = "Stanford University", year = "2012", edition = "Fall 2012", } @Book{enderton72book, author = "H. Enderton", title = "A Mathematical Introduction to Logic", publisher = "Academic Press, New York", year = "1972", } @InProceedings{endrullis13itp, author = "J{\"o}rg Endrullis and Dimitry Hendriks and Martin Bodin", title = "Circular Coinduction in {Coq} Using Bisimulation-Up-To Techniques", booktitle = "ITP", year = "2013", editor = "Sandrine Blazy and Christine Paulin-Mohring and David Pichardie", volume = "7998", series = lncs, pages = "354--369", month = jul, address = "Rennes", publisher = pub-sv, } @InProceedings{engberg90caap, author = "U. Engberg and G. Winskel", title = "Petri nets and models of linear logic", booktitle = "CAAP'90", series = lncs, volume = "431", year = "1990", publisher = "Springer", editor = "A. Arnold", pages = "147--161", } @Article{englander15lfsa, title = "Yet Another Bijection Between Sequent Calculus and Natural Deduction", author = "Cecilia Englander and Gilles Dowek and Edward Hermann Haeusler", journal = "Electronic Notes in Theoretical Computer Science", volume = "312", pages = "107--124", doi = "10.1016/j.entcs.2015.04.007", year = "2015", publisher = "Elsevier", } @InProceedings{eriksson91elp, author = "Lars-Henrik Eriksson", title = "A finitary version of the calculus of partial inductive definitions", booktitle = "Proceedings of the Second International Workshop on Extensions to Logic Programming", editor = "L.-H. Eriksson and L. Halln{\"{a}}s and P. Schroeder-Heister", pages = "89--134", publisher = "Springer", series = lnai, volume = "596", year = "1991", } @InProceedings{eriksson94cade, author = "Lars-Henrik Eriksson", title = "Pi: an interactive derivation editor for the calculus of partial inductive definitions", editor = "A. Bundy", booktitle = "Proceedings of the Twelfth International Conference on Automated Deduction", publisher = "Springer", series = lnai, volume = "814", month = jun, year = "1994", pages = "821--825", } @InProceedings{ershov77, author = "A. Ershov and V. Itkin", title = "Correctness of Mixed Computation in Algol-like Programs", booktitle = "Proceedings of the Sixth Symposium on the Mathematical Foundations of Computer Science", publisher = "Springer", series = lncs, volume = "53", year = "1977", } @Article{ershov82, author = "A. Ershov", title = "Mixed Computation: Potential Applications and Problems for Study", journal = "Theoretical Computer Science", volume = "18", year = "1982", pages = "41--67", } @Article{esparza11ipl, author = "Javier Esparza and Pierre Ganty and Stefan Kiefer and Michael Luttenberger", title = "Parikh’s Theorem: {A} simple and direct automaton construction", journal = "Information Processing Letters", year = "2011", volume = "111", number = "12", pages = "614--619", month = jun, } @Article{esparza94eatcs, title = "Decidability Issues for Petri Nets - a survey", author = "Javier Esparza and Mogens Nielsen", journal = "Bulletin of the EATCS", year = "1994", volume = "52", pages = "244--262", } % URL = "https://doi.org/10.1007/978-3-540-73228-0\_10", @InProceedings{espiritosanto07tlca, author = "Jos{\'{e}} {Esp{\'{\i}}rito Santo}", editor = "Simona Ronchi Della Rocca", title = "Completing Herbelin's Programme", booktitle = "Typed Lambda Calculi and Applications, 8th International Conference, {TLCA} 2007, Paris, France, June 26-28, 2007, Proceedings", series = lncs, volume = "4583", pages = "118--132", publisher = "Springer", year = "2007", doi = "10.1007/978-3-540-73228-0\_10", } @Article{espiritosanto13mscs, author = "Jos\'{e} {Esp\'{i}rito Santo} and Ralph Matthes and Koji Nakazawa and Lu\'{i}s Pinto", title = "Monadic translation of classical sequent calculus", journal = "Mathematical Structures in Computer Science", volume = "23", number = "06", month = dec, year = "2013", ISSN = "1469-8072", pages = "1111--1162", doi = "10.4204/EPTCS.126.3", } @InProceedings{espiritosanto16lsfa, author = "Jos{\'{e}} {Esp{\'{\i}}rito Santo}", editor = "Vivek Nigam and M{\'{a}}rio Florido", title = "The Polarized {\(\lambda\)}-calculus", booktitle = "11th Workshop on Logical and Semantic Frameworks with Applications, {LSFA} 2016, Porto, Portugal, January 1, 2016", series = "Electronic Notes in Theoretical Computer Science", volume = "332", pages = "149--168", publisher = "Elsevier", year = "2016", URL = "https://doi.org/10.1016/j.entcs.2017.04.010", doi = "10.1016/j.entcs.2017.04.010", } @Article{fabrega99jcs, author = "F. Javier Thayer Fabrega and C. Herzog and Joshua D. Guttman", title = "Strand spaces: Proving security protocols correct", journal = "Journal of Computer Security", year = "1999", volume = "7", number = "2,3", pages = "191--230", } @Article{fages01ic, author = "Fran\c{c}ois Fages and Paul Ruet and Sylvain Soliman", title = "Linear Concurrent Constraint Programming: Operational and Phase Semantics.", journal = "Information and Computation", volume = "165", number = "1", year = "2001", pages = "14--41", } @InProceedings{fages98lics, author = "Fran\c{c}ois Fages and Paul Ruet and Sylvain Soliman", title = "Phase semantics and verification of concurrent constraint programs", booktitle = lics98, editor = "Vaughan Pratt", year = "1998", publisher = "IEEE", month = jul, } @InProceedings{faggian02csl, author = "Claudia Faggian and Martin Hyland", title = "Designs, Disputes and Strategies", booktitle = "Computer Science Logic", series = lncs, publisher = pub-sv, volume = "2471", year = "2002", pages = "713--748", } @InProceedings{faggian05lics, author = "Claudia Faggian and Fran\c{c}ois Maurel", title = "Ludics nets, a game model of concurrent interaction", booktitle = lics05, year = "2005", pages = "376--385", publisher = "IEEE Computer Society", } @Article{fairtlough97ic, author = "M. Fairtlough and M. V. Mendler", title = "Propositional Lax Logic", journal = "Information and Computation", year = "1997", volume = "137", number = "1", pages = "1--33", month = aug, } @Article{falaschi84ic, author = "G. Levi M. Falaschi and C. Palamidessi", title = "A Synchronization Logic: Axiomatics and Formal Semantics of Generalized Horn Clauses", journal = "Information and Control", year = "1984", volume = "60", number = "1-3", pages = "36--69", month = jan, } @InProceedings{falaschi93lics, title = "Compositional Analysis for Concurrent Constraint Programming", author = "Moreno Falaschi and Maurizio Gabbrielli and Kim Marriott and Catuscia Palamidessi", pages = "210--221", booktitle = lics93, publisher = "IEEE", editor = "M. Vardi", month = jun, year = "1993", } @Article{falaschi97ic, author = "Moreno Falaschi and Maurizio Gabbrielli and Kim Marriott and Catuscia Palamidessi", title = "{C}onstraint {L}ogic {P}rogramming with {D}ynamic {S}cheduling: {A} {S}emantics {B}ased on {C}losure {O}perators", journal = "Information and {C}omputation", year = "1997", volume = "137", number = "1", pages = "41--67", } @Article{falaschi97tcs, author = "M. Falaschi and M. Gabbrielli and K. Marriott and C. Palamidessi", title = "Confluence in Concurrent Constraint Programming", journal = "Theoretical Computer Science", year = "1997", volume = "183", number = "2", pages = "281--315", } @InProceedings{farber16paar, title = "No Choice: Reconstruction of First-order {ATP} Proofs without Skolem Functions", author = "Michael F{\"a}rber and Cezary Kaliszyk", booktitle = "Proceedings of the 5th Workshop on Practical Aspects of Automated Reasoning (PAAR)", publisher = "CEUR-WS.org", year = "2016", volume = "1635", editor = "Pascal Fontaine and Stephan Schulz 0001 and Josef Urban", pages = "24--31", series = "CEUR Workshop Proceedings", } @InProceedings{farber22cpp, title = "Safe, fast, concurrent proof checking for the lambda-pi calculus modulo rewriting", author = "Michael F{\"a}rber", booktitle = "Proceedings of the 11th ACM SIGPLAN International Conference on Certified Programs and Proofs", pages = "225--238", year = "2022", doi = "10.1145/3497775.3503683", } @Book{farmer23book, author = "William M. Farmer", title = "Simple Type Theory: {A} Practical Logic for Expressing and Reasoning About Mathematical Ideas", publisher = "Springer Nature", year = "2023", } @Article{farmer92amai, title = "The {Kreisel} Length-of-Proof Problem", author = "William M. Farmer", journal = "Ann. Math. Artif. Intell", year = "1992", number = "1-3", volume = "6", pages = "27--55", } @TechReport{farooque11tr, title = "{A sequent calculus with procedure calls}", author = "Mahfuza Farooque and St{\'e}phane Lengrand", institution = "Laboratoire d'informatique de l'{\'e}cole polytechnique - LIX, CNRS-Ecole Polytechnique-INRIA", year = "2011", month = dec, URL = "https://hal.archives-ouvertes.fr/hal-00690577", } @TechReport{farooque12tr, URL = "https://hal.archives-ouvertes.fr/hal-00690044", title = "{Two simulations about DPLL(T)}", author = "Mahfuza Farooque and St{\'e}phane Lengrand and Assia Mahboubi", institution = "Laboratoire d'informatique de l'{\'e}cole polytechnique - LIX, CNRS-Ecole Polytechnique-INRIA", year = "2012", month = mar, } @TechReport{farooque12trb, URL = "https://hal.inria.fr/hal-00690392", title = "{Simulating the DPLL(T) procedure in a sequent calculus with focusing}", author = "Mahfuza Farooque and St{\'e}phane Lengrand and Assia Mahboubi", institution = "Laboratoire d'informatique de l'{\'e}cole polytechnique - LIX, CNRS-Ecole Polytechnique-INRIA", year = "2012", month = mar, } @InProceedings{farooque13lfmtp, author = "Mahfuza Farooque and {St\'ephane} Graham-Lengrand and Assia Mahboubi", title = "A bisimulation between {DPLL(T)} and a proof-search strategy for the focused sequent calculus", booktitle = "Proceedings of the 2013 ACM SIGPLAN Workshop on Logical Frameworks~\& Meta-Languages: Theory~\& Practice, LFMTP'13", pages = "3--13", year = "2013", editor = "Alberto Momigliano and Brigitte Pientka and Randy Pollack", month = sep, publisher = "ACM", URL = "https://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/lfmtp13.pdf", } @PhdThesis{farooque13phd, author = "Mahfuza Farooque", title = "Automated reasoning techniques in sequent calculus", school = "Ecole Polytechnique", year = "2013", type = "Ph.D. Thesis", } @TechReport{farooque13tr, title = "Sequent calculi with procedure calls", author = "Mahfuza Farooque and St{\'e}phane Graham-Lengrand", year = "2013", month = jan, institution = "Laboratoire d'informatique de l'{\'e}cole polytechnique - LIX, CNRS-Ecole Polytechnique-INRIA", URL = "https://hal.archives-ouvertes.fr/hal-00779199", } @Book{feferman86goedel, author = "Solomon Feferman and John W. Dawson and Stephen C. Kleene and Gregory H. Moore and Robert M. Solovay and Jean van Heijenoort", title = "Kurt {\"G}odel: Collected Works. Vol. 1: Publications 1929-1936", publisher = "Oxford University Press", year = "1986", pages = "459", } @InProceedings{felleisen88popl, author = "Mattias Felleisen", title = "The theory and practice of first-class prompts", booktitle = popl88, year = "1988", location = "San Diego, California, United States", pages = "180--190", URL = "https://doi.acm.org/10.1145/73560.73576", doi = "10.1145/73560.73576", publisher = "ACM", address = "New York, NY, USA", } @Article{felleisen92tcs, author = "Matthias Felleisen and Robert Hieb", title = "The Revised Report on the Syntactic Theories of Sequential Control and State", journal = "Theoretical Computer Science", year = "1992", volume = "103", pages = "235--271", } @Article{felscher85, author = "Walter Flescher", title = "Dialogues, Strategies and Intuitionistic Provability", journal = "Annals of Mathematical Logic", year = "1985", volume = "28", pages = "217--254", } @Article{felty00tcs, author = "Amy Felty", title = "The Calculus of Constructions as a Framework for Proof Search with Set Variable Instantiation", journal = "Theoretical Computer Science", year = "2000", volume = "232", number = "1-2", pages = "187--229", month = feb, } @InProceedings{felty02tphol, author = "Amy P. Felty", title = "Two-Level Meta-reasoning in Coq.", booktitle = "Theorem Proving in Higher Order Logics, 15th International Conference", year = "2002", pages = "198--213", editor = "Victor Carre{\~n}o and C{\'e}sar Mu{\~n}oz and Sofi{\`e}ne Tashar", publisher = "Springer", series = lncs, volume = "2410", } @InProceedings{felty09ppdp, author = "Amy Felty and Alberto Momigliano", title = "Reasoning with Hypothetical Judgments and Open Terms in {H}ybrid", booktitle = ppdp09, pages = "83--92", year = "2009", } @Article{felty12jar, author = "Amy Felty and Alberto Momigliano", title = "Hybrid: {A} Definitional Two-Level Approach to Reasoning with Higher-Order Abstract Syntax", journal = jar, pages = "43--105", volume = "48", year = "2012", } @TechReport{felty15arxiv, author = "Amy P. Felty and Alberto Momigliano and Brigitte Pientka", title = "The Next 700 Challenge Problems for Reasoning with Higher-Order Abstract Syntax Representations: Part 1--{A} Common Infrastructure for Benchmarks", institution = "Arxiv", number = "1503.06095", year = "2015", URL = "https://arxiv.org/abs/1503.06095", } @Article{felty15jar, author = "Amy P. Felty and Alberto Momigliano and Brigitte Pientka", title = "The Next 700 Challenge Problems for Reasoning with Higher-Order Abstract Syntax Representations: Part 2--{A} Survey", journal = jar, year = "2015", volume = "55", number = "4", pages = "307--372", doi = "10.1007/s10817-015-9327-3", } @Article{felty17mscs, author = "Amy P. Felty and Alberto Momigliano and Brigitte Pientka", title = "Benchmarks for reasoning with syntax trees containing binders and contexts of assumptions", journal = "Mathematical Structures in Computer Science", year = "2017", doi = "10.1017/S0960129517000093", pages = "1507--1540", } @MastersThesis{felty86, author = "Amy Felty", title = "Using Extended Tactics to do Proof Transformations", school = "University of Pennsylvania", month = dec, year = "1986", note = "Technical Report MS-CIS-86-89", } @Unpublished{felty87, author = "Amy Felty and Dale Miller", title = "Proof Explanation and Revision", year = "1987", note = "Draft", } @Unpublished{felty87a, author = "Amy Felty", title = "Implementing Theorem Provers in Logic Programming", month = nov, year = "1987", note = "Dissertation Proposal, University of Pennsylvania, Technical Report MS-CIS-87-109", } @InProceedings{felty88cade, author = "Amy Felty and Dale Miller", title = "Specifying theorem provers in a higher-order logic programming language", editor = "Ewing Lusk and Ross Overbeck", booktitle = "{Ninth International Conference on Automated Deduction}", address = "Argonne, IL", publisher = "Springer", pages = "61--80", month = may, year = "1988", series = lncs, number = "310", doi = "10.1007/BFb0012823", } @PhdThesis{felty89phd, author = "Amy Felty", title = "Specifying and Implementing Theorem Provers in a Higher-Order Logic Programming Language", school = "University of Pennsylvania", month = aug, year = "1989", } @Unpublished{felty89wlpl, author = "Amy Felty and Dale Miller", title = "A Meta Language for Type Checking and Inference: An Extended Abstract", year = "1989", note = "Presented at the 1989 Workshop on Programming Logic, {B\aa lstad}, Sweden", } @InProceedings{felty90cade, author = "Amy Felty and Dale Miller", title = "Encoding a Dependent-Type $\lambda$-Calculus in a Logic Programming Language", booktitle = "Proceedings of the 1990 Conference on Automated Deduction", publisher = pub-sv, series = lnai, volume = "449", pages = "221--235", editor = "Mark Stickel", year = "1990", } @InProceedings{felty91elp, author = "Amy Felty", editor = "Peter Schroeder-Heister", title = "A Logic Program for Transforming Sequent Proofs to Natural Deduction Proofs", booktitle = "{Extensions of Logic Programming: International Workshop, T\"ubingen}", publisher = "Springer", series = lnai, volume = "475", pages = "157--178", year = "1991", } @InProceedings{felty91lf, author = "Amy Felty", title = "Transforming Specifications in a Dependent-Type Lambda Calculus to Specifications in an Intuitionistic Logic", booktitle = "Logical Frameworks", editor = "G\'{e}rard Huet and Gordon D. Plotkin", publisher = "Cambridge University Press", year = "1991", } @InProceedings{felty91welp, author = "Amy Felty", title = "A Logic Programming Approach to Implementing Higher-Order Term Rewriting", booktitle = welp91, editor = "Lars-Henrik Eriksson and Lars Halln{\"{a}}s and Peter Schroeder-Heister", volume = "596", series = lnai, pages = "135--161", publisher = "Springer", year = "1992", } @InProceedings{felty92lpw, author = "Amy Felty", title = "Defining object-level parsers in $\lambda${Prolog}", booktitle = "Proceedings of the Workshop on the $\lambda${Prolog} Programming Language", note = "Department of Computer and Information Science, University of Pennsylvania, Technical Report MS-CIS-92-86", year = "1992", } @Unpublished{felty92welp, author = "Amy Felty", title = "Higher-Order Conditional Rewriting in the {$L_\lambda$} Logic Programming Language", year = "1992", month = feb, note = "Preprint of talks given at the Third International Workshop on Extensions to Logic Programming", URL = "https://www.site.uottawa.ca/~afelty/dist/welp92a.ps", } @Article{felty93jar, author = "Amy Felty", title = "Implementing Tactics and Tacticals in a Higher-Order Logic Programming Language", journal = "Journal of Automated Reasoning", volume = "11", number = "1", year = "1993", month = aug, pages = "43--81", doi = "10.1007/BF00881900", } @InProceedings{felty93lics, title = "Encoding the Calculus of Constructions in a Higher-Order Logic", author = "Amy Felty", pages = "233--244", booktitle = lics93, publisher = "IEEE", editor = "M. Vardi", month = jun, year = "1993", doi = "10.1109/LICS.1993.287584", } @InProceedings{fermuller2001resolution, title = "Resolution decision procedures", author = "Christian G Ferm{\"u}ller and Alexander Leitsch and Ullrich Hustadt and Tanel Tammet", booktitle = "Handbook of automated reasoning", pages = "1791--1849", year = "2001", organization = "Elsevier Science Publishers BV", } @InProceedings{fernandez98lics, author = "Maribel Fernandez and Ian Mackie", title = "Coinductive techniques for operational equivalence of interaction nets", booktitle = lics98, editor = "Vaughan Pratt", year = "1998", organization = "IEEE", month = jul, } @Article{ferrari12jar, author = "Mauro Ferrari and Camillo Fiorentini and Guido Fiorino", title = "Contraction-Free Linear Depth Sequent Calculi for Intuitionistic Propositional Logic with the Subformula Property and Minimal Depth Counter-Models", journal = jar, year = "2012", volume = "51", number = "2", pages = "129--149", doi = "10.1007/s10817-012-9252-7", } @InProceedings{ferreira10clc, author = "Gilda Ferreira and Paulo Oliva", title = "On Various Negative Translations", booktitle = "Proceedings of the Third International Workshop on Classical Logic and Computation", year = "2010", pages = "21--33", series = eptcs, volume = "47", } @Article{ferreira12journal, title = "On the relation between various negative translations", author = "Gilda Ferreira and Paulo Oliva", journal = "Logic, Construction, Computation, Ontos-Verlag Mathematical Logic Series", volume = "3", pages = "227--258", number = "23", year = "2012", } @InProceedings{ferreira17esop, title = "Programs Using Syntax with First-Class Binders", author = "Francisco Ferreira and Brigitte Pientka", booktitle = "Proceedings of the 26th European Symposium on Programming, ESOP 2017, Uppsala, Sweden", publisher = "Springer", month = apr, year = "2017", volume = "10201", editor = "Hongseok Yang", ISBN = "978-3-662-54433-4; 978-3-662-54434-1", pages = "504--529", series = "Lecture Notes in Computer Science", } @InProceedings{fettig96rta, author = "R. Fettig and B. L{\"o}chner", title = "Unification of Higher-Order Patterns in a Simply Typed Lambda-Calculus with Finite Products and Terminal Type", booktitle = "Proceedings of the Seventh International Conference on Rewriting Techniques and Apllications", volume = "1103", pages = "347--361", year = "1996", } @InCollection{fidler21sep, author = "Fiona Fidler and John Wilcox", title = "{Reproducibility of Scientific Results}", booktitle = "The {Stanford} Encyclopedia of Philosophy", editor = "Edward N. Zalta", howpublished = "\href{https://plato.stanford.edu/archives/sum2021/entries/scientific-reproducibility/}{URL}", year = "2021", edition = "{S}ummer 2021", publisher = "Metaphysics Research Lab, Stanford University", } @Book{fiedman18book, author = "Daniel P. Friedman and William E. Byrd and Oleg Kiselyov and Jason Hemann", title = "The Reasoned Schemer, Second Edition", publisher = "The MIT Press", year = "2018", } @InProceedings{filliatre13esop, title = "Why3 - Where Programs Meet Provers", author = "Jean-Christophe Filli{\^a}tre and Andrei Paskevich", booktitle = "Proceedings of the 22nd European Symposium on Programming, ESOP 2013, Rome, Italy", publisher = "Springer", year = "2013", volume = "7792", editor = "Matthias Felleisen and Philippa Gardner", pages = "125--128", series = "Lecture Notes in Computer Science", } @PhdThesis{filliatre99phd, author = "Jean-Christophe Filli\^atre", title = "Proof of imperative programs in Type Theory", school = "L'Universit\'e de Paris-Sud", year = "1999", month = jul, } @Article{finkelstein03tcs, author = "Stacy E. Finkelstein and Peter J. Freyd and James Lipton", title = "A new framework for declarative programming", journal = "Theor. Comput. Sci.", volume = "300", number = "1-3", pages = "91--160", year = "2003", URL = "https://doi.org/10.1016/S0304-3975(01)00308-5", doi = "10.1016/S0304-3975(01)00308-5", } @InProceedings{finkelstein94csl, author = "Stacy E. Finkelstein and Peter J. Freyd and James Lipton", editor = "Leszek Pacholski and Jerzy Tiuryn", title = "Logic Programming in Tau Categories", booktitle = "Computer Science Logic, 8th International Workshop, {CSL} '94, Kazimierz, Poland, September 25-30, 1994, Selected Papers", series = "Lecture Notes in Computer Science", volume = "933", pages = "249--263", publisher = "Springer", year = "1994", URL = "https://doi.org/10.1007/BFb0022261", doi = "10.1007/BFb0022261", } @InProceedings{fiore01csfw, author = "M. P. Fiore and M. Abadi", title = "Computing Symbolic Models for Verifying Cryptographic Protocols", booktitle = "14th Computer Security Foundations Workshop (CSFW-14)", pages = "160--173", year = "2001", publisher = "IEEE, Computer Society Press", URL = "https://www.cl.cam.ac.uk/~mpf23/papers/Concurrency/symbmod.ps.gz", } @Article{fiore96ic, title = "A Coinduction Principle for Recursive Data Types Based on Bisimulation", author = "Marcelo P. Fiore", pages = "186--198", journal = "Information and Computation", month = jun, year = "1996", volume = "127", number = "2", } @InProceedings{fiore99lics, author = "M. P. Fiore and G. D. Plotkin and D. Turi", title = "Abstract syntax and variable binding", booktitle = lics99, pages = "193--202", year = "1999", doi = "10.1109/LICS.1999.782615", publisher = "IEEE Computer Society Press", } @Article{fischer72sigplan, author = "Michael J. Fischer", title = "{Lambda} calculus schemata", journal = "ACM SIG{\-}PLAN Notices", volume = "7", number = "1", pages = "104--109", month = jan, year = "1972", } @Book{fitting02book, author = "Melvin Fitting", title = "Types, Tableaus, and {G}{\"o}del's God", publisher = "Kluwer", year = "2002", } @Book{fitting69ilmtf, author = "Melvin C. Fitting", title = "Intuitionistic Logic Model Theory and Forcing", publisher = "North-Holland", year = "1969", } @Book{fitting83, author = "Melvin Fitting", title = "Proof Methods for Modal and Intuitionistic Logics", publisher = "D. Reidel, Dordrecht, The Netherlands", year = "1983", } @InProceedings{fitting87ismis, title = "Resolution for Intuitionistic Logic", author = "Melvin Fitting", year = "1987", booktitle = "Proc.\ International Symposium of Methodologies for Intelligent Systems ISMIS'87", pages = "400--407", } @Article{fitting87jlp, author = "Melvin Fitting", title = "Enumeration Operators and Modular Logic Programming", volume = "4", number = "1", year = "1987", month = mar, pages = "11--22", journal = "Journal of Logic Programming", } @Book{fitting87oup, author = "Melvin Fitting", title = "Computability theory, semantics, and logic programming", publisher = "Oxford University Press", year = "1987", } @Book{fitting90book, title = "First-Order Logic and Automated Theorem Proving", author = "Melvin Fitting", publisher = "Springer", year = "1990", } @Book{fitting90sv, author = "Melvin Fitting", title = "First-order Logic and Automated Theorem Proving", publisher = "Springer", year = "1990", } @Article{fitting93jar, author = "Melvin Fitting", title = "Tableaus for Logic Programming", journal = "Journal of Automated Reasoning", volume = "13", number = "2", pages = "175--188", year = "1994", } @Book{fitting96book, author = "Melvin Fitting", title = "First-Order Logic and Automated Theorem Proving, second edition", publisher = "Springer", year = "1996", series = "Graduate Texts in Computer Science", ISBN = "0-387-94593-8", } @Article{fitting98jlc, author = "Melvin Fitting", title = "{leanTAP} Revisited", journal = jlc, year = "1998", volume = "8", number = "1", pages = "33--47", } @Article{flanagan93sigplan, author = "Cormac Flanagan and Amr Sabry and Bruce F. Duba and Matthias Felleisen", title = "The essence of compiling with continuations", journal = "ACM SIG{\-}PLAN Notices", volume = "28", number = "6", ISBN = "0-89791-598-4", pages = "237--247", year = "1993", doi = "10.1145/155090.155113", } @Article{fluckiger17pacmpl, title = "{Correctness of Speculative Optimizations with Dynamic Deoptimization}", author = "Olivier Fl{\"u}ckiger and Gabriel Scherer and Ming-Ho Yee and Aviral Goel and Amal Ahmed and Jan Vitek", URL = "https://hal.inria.fr/hal-01646765", journal = "{Proceedings of the ACM on Programming Languages (PACMPL)}", publisher = "{ACM}", year = "2017", pdf = "https://hal.inria.fr/hal-01646765/file/sourir.pdf", } @Article{fokkink96ic, title = "{Ntyft/ntyxt Rules Reduce to Ntree Rules}", author = "W. J. Fokkink and R. J. van Glabbeek", journal = "Information and Computation", volume = "126", number = "1", pages = "1--10", year = "1996", } @TechReport{fokkink97sos, author = "Wan Fokkink and Chris Verhoef", title = "An {SOS} Message: Conservative Extension in Higher-Order Positive/Negative Conditional Term Rewriting", institution = "University of Amsterdam.", year = "1997", number = "P9715", } @InProceedings{fontaine06tacas, title = "Expressiveness + Automation + Soundness: Towards Combining {SMT} Solvers and Interactive Proof Assistants", author = "Pascal Fontaine and Jean-Yves Marion and Stephan Merz and Leonor Prensa Nieto and Alwen Fernanto Tiu", booktitle = "TACAS: Tools and Algorithms for the Construction and Analysis of Systems", publisher = "Springer", year = "2006", volume = "3920", editor = "H. Hermanns and J. Palsberg", pages = "167--181", series = lncs, doi = "10.1007/11691372\_11", } @InProceedings{fontana05lics, author = "Walter Fontana", title = "Logic and Systems Biology", booktitle = lics05, year = "2005", editor = "Prakash Panangaden", month = jun, pages = "344--344", location = "Chicago, USA", note = "Invited Talk", publisher = "IEEE Computer Society Press", } @InProceedings{forster19cpp, author = "Y. Forster and D. Larchey-Wendling", title = "Certified undecidability of intuitionistic linear logic via binary stack machines and Minsky machines", booktitle = "Proceedings of the 8th ACM SIGPLAN International Conference on Certified Programs and Proofs (CPP ’19)", year = "2019", pages = "1--14", publisher = "ACM", } @Article{forster19jfp, author = "Yannick Forster and Ohad Kammar and Sam Lindley and Matija Pretnar", title = "On the expressive power of user-defined effects: effect handlers, monadic reflection, delimited control", journal = "Journal of Functional Programming", year = "2019", volume = "29", URL = "https://homepages.inf.ed.ac.uk/slindley/papers/effmondel-jfp.pdf", } @Article{fortune83, author = "S. Fortune and D. Leivant and M. O'Donell", title = "The Expressiveness of Simple and Second-Order Type Structures", journal = "Journal of the ACM", volume = "30", year = "1983", pages = "151--185", } @InProceedings{fournet96popl, title = "The reflexive {CHAM} and the join-calculus", author = "C{\'e}dric Fournet and Georges Gonthier", pages = "372--385", booktitle = "Conference Record of {POPL} '96: The $23^{\mathrm{rd}}$ ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages", month = jan, year = "1996", address = "St.\ Petersburg Beach, Florida", publisher = "ACM", } @TechReport{fradet89, author = "P. Fradet and D. Le M\`etayer", title = "Compilation of Functional Languages by Program Transformation", institution = "INRIA-Rennes", year = "1989", number = "1040", } @InProceedings{fredman84focs, author = "Michael L. Fredman and Robert Endre Tarjan", title = "Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms", booktitle = "25th Annual Symposium on Foundations of Computer Science", year = "1984", pages = "338--346", } @Book{frege79, author = "Gottlob Frege", title = "Begriffsschrift, eine der arithmetischen nachgebildete Formelsprache des reinen Denkens", publisher = "Halle", note = "Translated in \cite{vanheijenoort67book}", year = "1879", } @InCollection{frege86, author = "G. Frege", title = "Begriffsschrift, eine der arithmetischen nachgebildete Formelsprache des reinen Denkens (gekuerzter Nachdruck)", year = "1986", booktitle = "Logik-Texte: Kommentierte Auswahl zur Geschichte der Modernen Logik (vierte Auflage)", editor = "K. Berka and L. Kreiser", publisher = "Akademie-Verlag", address = "Berlin", pages = "82--107", } @Book{frege93, author = "Gottlob Frege", title = "Grundgesetze der Arithmetik (Band {I})", year = "1893", } @InProceedings{friedman75icm, author = "Harvey Friedman", booktitle = "Proceedings of the International Congress of Mathematicians (Vancouver, B. C., 1974), Vol. 1", pages = "235--242", publisher = "Canad. Math. Congress, Montreal, Que.", title = "Some systems of second order arithmetic and their use", year = "1975", } @InCollection{friedman78hol, author = "Harvey M. Friedman", title = "Classically and Intuitionistically Provably Recursive Functions", editor = "G. H. M{\"u}ller and Dana S. Scott", booktitle = "Higher Order Set Theory", publisher = "Springer Verlag", address = "Berlin", year = "1978", pages = "21--27", doi = "10.1007/BFb0103100", } @Article{futamura71, author = "Y. Futamura", title = "Partial Evaluation of Computation Process -- an Approach to a Compiler-compiler", journal = "Computer, Systems, Controls", volume = "2", number = "5", year = "1971", pages = "45--50", } @InProceedings{futamura87, author = "Y. Futamura and K. Nogi", title = "Generalized Partial Computation", booktitle = "Proceedings of the IFIP Workshop on Partial Evaluation and Mixed Computation", editor = "D. Bj{\o}rner and A. P. Ershov and N. D. Jones", publisher = "North-Holland", year = "1987", } @InProceedings{futamura88, author = "Y. Futamura", title = "Program Evaluation and Generalized Partial Computation", booktitle = "Proceedings of International Conference on Fifth Generation Computer Systems", year = "1988", } @Book{gabbay00gdpt, author = "Dov M. Gabbay and Nicola Olivetti", title = "Goal-Directed Proof Theory", publisher = "Kluwer Academic Publishers", year = "2000", volume = "21", series = "Applied Logic Series", month = aug, } @PhdThesis{gabbay00phd, author = "Murdoch J. Gabbay", title = "{A Theory of Inductive Definitions with $\alpha$-Equivalence}", school = "Cambridge University, UK", year = "2000", } @Article{gabbay01fac, author = "M. J. Gabbay and A. M. Pitts", title = "A New Approach to Abstract Syntax with Variable Binding", journal = "Formal Aspects of Computing", year = "2001", volume = "13", pages = "341--363", } @InProceedings{gabbay02mlg, author = "Murdoch Gabbay", title = "{Nominal Sets, Equivariance Reasoning, and Variable Binding}", booktitle = "Proceedings of the 36th MLG Meeting", year = "2002", editor = "Nobu-Yuki Suzuki and Misao Nagayama", month = dec, note = "Kinosaki, Japan", } @InProceedings{gabbay02tphols, author = "Murdoch J. Gabbay", title = "Automating {F}raenkel-{M}ostowski Syntax", booktitle = "TPHOLs, 15th International Conference on Theorem Proving in Higher Order Logics", year = "2002", month = aug, } @InProceedings{gabbay03icfp, author = "M. R. Shinwell and A. M. Pitts and M. J. Gabbay", title = "Fresh{ML}: Programming with Binders Made Simple", booktitle = "Eighth {ACM SIGPLAN} International Conference on Functional Programming ({ICFP} 2003), Uppsala, Sweden", pages = "263--274", year = "2003", month = aug, publisher = "ACM Press", } @Unpublished{gabbay03unp, author = "Dov Gabbay {Murdoch Gabbay, Michael Gabbay}", title = "Restart as a Computational Rule", note = "Invited paper for the Workshop on Lambda-Calculus, Type Theory, and Natural Language, King's College London", month = dec, year = "2003", pdf = "https://www.lix.polytechnique.fr/Labo/Murdoch.Gabbay/papers/rescr.pdf", } @InCollection{gabbay04automath, author = "M.~J.~Gabbay", title = "The $\pi$-calculus in {FM}", booktitle = "Thirty Five Years of Automating Mathematics", series = "Applied Logic Series", volume = "28", pages = "80--149", publisher = "Kluwer", year = "2004", editor = "F. D. Kamareddine", } @InProceedings{gabbay04lics, author = "M. J. Gabbay and J. Cheney", title = "A Sequent Calculus for Nominal Logic", booktitle = lics04, pages = "139--148", year = "2004", pdf = "https://www.lix.polytechnique.fr/Labo/Murdoch.Gabbay/papers/seqcnl.pdf", } @Article{gabbay07jal, title = "Fresh Logic: proof-theory and semantics for {FM} and nominal techniques", author = "Murdoch Gabbay", journal = "J. Applied Logic", year = "2007", number = "2", volume = "5", pages = "356--387", doi = "10.1016/j.jal.2005.10.012", } @InProceedings{gabbay08entcs, author = "Murdoch Gabbay and {St\'ephane} Lengrand", title = "The lambda-context Calculus", editor = "Brigitte Pientka and Carsten {Sch\"urmann}", series = "Electronic Notes in Theoretical Computer Science", volume = "196", year = "2008", pages = "19--35", booktitle = "Revisions from the Second International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP 2007)", doi = "10.1016/j.entcs.2007.09.015", } @Article{gabbay09ic, author = "Murdoch Gabbay and {St\'ephane} Lengrand", title = "The lambda-context Calculus", editor = "Mariangiola Dezani-Ciancaglini", journal = "Information and Computation", volume = "207", number = "12", pages = "1369--1400", year = "2009", } @Article{gabbay84, author = "D. M. Gabbay and U. Reyle", title = "{N-Prolog}: An Extension of {Prolog} with Hypothetical Implications. {I}", journal = "Journal of Logic Programming", volume = "1", pages = "319--355", year = "1984", } @Article{gabbay85jlp, title = "{N-Prolog}: An Extension of {Prolog} with Hypothetical Implication {II}---Logical Foundations, and Negation as Failure", author = "Dov M. Gabbay", journal = "Journal of Logic Programming", pages = "251--283", month = dec, year = "1985", volume = "2", number = "4", } @InProceedings{gabbay90csl, title = "Algorithmic Proof with Diminishing Resources, Part 1", author = "Dov M. Gabbay", booktitle = "{CSL}'90. Fourth Workshop on Computer Science Logic", editor = "Egon B{\"o}rger", publisher = "Springer", series = lncs, number = "533", year = "1991", } @InProceedings{gabbay91elp, author = "Dov Gabbay", editor = "Peter Schroeder-Heister", title = "Modal Provability Foundations for Negation by Failure, in Extensions of Logic Programming", booktitle = "Extensions of Logic Programming: International Workshop, T{\"u}bingen FRG, December 1989", publisher = "Springer", series = lnai, volume = "475", year = "1991", pages = "179--222", } @Article{gabbay92jsl, author = "Dov M. Gabbay and Ruy J. G. B. de Queiroz", title = "Extending the Curry-Howard Interpretation to Linear, Relevant and Other Resource Logics", journal = "J. Symb. Log.", volume = "57", number = "4", pages = "1319--1365", year = "1992", URL = "https://doi.org/10.2307/2275370", doi = "10.2307/2275370", } @InProceedings{gabbay99lics, author = "M. J. Gabbay and A. M. Pitts", title = "A new approach to abstract syntax involving binders", booktitle = lics99, pages = "214--224", year = "1999", publisher = "IEEE Computer Society Press", } @InProceedings{gacek08ijcar, author = "Andrew Gacek", title = "The {A}bella Interactive Theorem Prover (System Description)", booktitle = ijcar08, year = "2008", pages = "154--161", URL = "https://arxiv.org/abs/0803.2305", editor = "A. Armando and P. Baumgartner and G. Dowek", publisher = "Springer", series = lncs, volume = "5195", } @InProceedings{gacek08lfmtp, author = "Andrew Gacek and Dale Miller and Gopalan Nadathur", title = "Reasoning in {A}bella about Structural Operational Semantics Specifications", booktitle = lfmtp08, year = "2008", editor = "A. Abel and C. Urban", series = entcs, number = "228", pages = "85--100", pdf = "https://arxiv.org/pdf/0804.3914.pdf", doi = "10.1016/j.entcs.2008.12.118", } @InProceedings{gacek08lics, author = "Andrew Gacek and Dale Miller and Gopalan Nadathur", title = "Combining generic judgments with recursive definitions", booktitle = lics08, year = "2008", editor = "F. Pfenning", publisher = "IEEE Computer Society Press", pages = "33--44", doi = "10.1109/LICS.2008.33", URL = "https://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/lics08a.pdf", } @TechReport{gacek09corr, author = "Andrew Gacek and Dale Miller and Gopalan Nadathur", title = "Nominal abstraction", note = "Extended version LICS 2008 paper. Submitted", month = aug, year = "2009", pdf = "https://arxiv.org/abs/0908.1390", institution = "CoRR", } @PhdThesis{gacek09phd, author = "Andrew Gacek", title = "A Framework for Specifying, Prototyping, and Reasoning about Computational Systems", school = "University of Minnesota", year = "2009", } @InProceedings{gacek10ppdp, author = "Andrew Gacek", title = "Relating Nominal and Higher-order Abstract Syntax Specifications", booktitle = "Proceedings of the 2010 Symposium on Principles and Practice of Declarative Programming", editor = "Temur Kutsia and Wolfgang Schreiner and Maribel Fern\'andez", year = "2010", publisher = "ACM", month = jul, pages = "177--186", pdf = "https://arxiv.org/pdf/1003.5447.pdf", } @Article{gacek11ic, author = "Andrew Gacek and Dale Miller and Gopalan Nadathur", title = "Nominal abstraction", journal = "Information and Computation", year = "2011", volume = "209", number = "1", pages = "48--73", doi = "10.1016/j.ic.2010.09.004", pdf = "https://arxiv.org/abs/0908.1390", } @Article{gacek12jar, author = "Andrew Gacek and Dale Miller and Gopalan Nadathur", title = "A two-level logic approach to reasoning about computations", year = "2012", URL = "https://arxiv.org/abs/0911.2993", doi = "10.1007/s10817-011-9218-1", journal = jar, volume = "49", number = "2", pages = "241--273", } @Article{galanaki08apal, author = "Chrysida Galanaki and Panos Rondogiannis and William W. Wadge", title = "An infinite-game semantics for well-founded negation in logic programming", journal = apal, volume = "151", number = "2", year = "2008", pages = "70--88", } @Book{gallier86, author = "Jean H. Gallier", title = "Logic for Computer Science: Foundations of Automatic Theorem Proving", publisher = "Harper $\&$ Row", year = "1986", } @InProceedings{gallier87lics, author = "J. H. Gallier and S. Raatz and W. Snyder", title = "Theorem Proving Using Rigid {E}-Unification: Equational Matings", booktitle = lics87, pages = "338--346", month = jun, publisher = "IEEE Computer Society Press", address = "Washington, D.C., USA", year = "1987", } @InCollection{gallier90lcs, author = "Jean H. Gallier", title = "On {G}irard's ``Candidats de Reductibilit{\'e}''", editor = "P. Odifreddi", booktitle = "Logic and Computer Science", series = "APIC Studies in Data Processing", volume = "31", pages = "91--122", publisher = "Academic Press", address = "London", year = "1990", } @InCollection{gallier91lcs, author = "Jean Gallier and Wayne Snyder", title = "Designing Unification Procedures Using Transformations: {A} Survey", booktitle = "Logic From Computer Science", publisher = "Springer", year = "1991", editor = "Y. Moschovakis", pages = "153--215", address = "New York", } @TechReport{gallier91tr, author = "Jean Gallier", title = "Unification procedures in automated deduction methods based on matings: a survey", year = "1991", institution = "Computer Science Department, University of Pennsylvania", note = "To appear in a book edited by M. Nivat and A. Podelski, 1993", } @Article{gallier93tcs, author = "Jean Gallier", title = "Constructive Logics. Part {I}: {A} Tutorial on Proof Systems and Typed lambda-Calculi", journal = "Theoretical Computer Science", year = "1993", volume = "110", number = "2", pages = "249--239", } @InProceedings{galmiche94lfcs, author = "Didier Galmiche and Guy Perrier", title = "Foundations of Proof Search Strategies Design in Linear Logic", booktitle = "Symposium on Logical Foundations of Computer Science", year = "1994", address = "St. Petersburg, Russia", pages = "101--113", publisher = "Springer", series = lncs, volume = "813", } @InProceedings{galmiche94psttl, author = "Didier Galmiche and E. Boudinet", title = "Proof search for programming in Intuitionistic Linear Logic", editor = "D. Galmiche and L. Wallen", booktitle = "CADE-12 Workshop on Proof Search in Type-Theoretic Languages", pages = "24--30", year = "1994", address = "Nancy, France", month = jun, } @InProceedings{galmiche94ptelp, author = "Didier Galmiche", title = "Canonical Proofs for Linear Logic Programming Frameworks", editor = "A. Momigliano and M. Ornaghi", pages = "2--10", booktitle = "Proof-Theoretical Extensions of Logic Programming", year = "1994", address = "Santa Margherita Ligure, Italy", month = jun, note = "Post-Conference Workshop for ICLP'94", } @InCollection{gandy76lc, author = "Robin O. Gandy", title = "The Simple Theory of Types", booktitle = "Logic Colloquium 76", publisher = "North Holland", year = "1976", series = "Studies in Logic and the Foundations of Mathematics", volume = "87", pages = "173--181", } @InProceedings{ganzinger01ijcar, author = "Harald Ganzinger and David A. McAllester", title = "A New Meta-complexity Theorem for Bottom-Up Logic Programs", booktitle = "First International Joint Conference Automated Reasoning (IJCAR)", year = "2001", pages = "514--528", publisher = "Springer", series = lncs, volume = "2083", editor = "Rajeev Gor{\'e} and Alexander Leitsch and Tobias Nipkow", } @InProceedings{ganzinger02iclp, author = "H. Ganzinger and D. McAllester", title = "Logical Algorithms", booktitle = "Proc.\ International Conference on Logic Programming (ICLP) 2002", series = lncs, publisher = "Springer", volume = "2401", pages = "209--223", year = "2002", } @InProceedings{garg05concur, title = "Type-Directed Concurrency", author = "Deepak Garg and Frank Pfenning", year = "2005", editor = "Mart\'{\i}n Abadi and Luca de Alfaro", booktitle = "16th International Conference on Concurrency Theory (CONCUR)", publisher = "Springer", series = lncs, volume = "3653", pages = "6--20", doi = "10.1007/11539452\_5", } @InProceedings{garg06cs, title = "Non-Interference in Constructive Authorization Logic", author = "Deepak Garg and Frank Pfenning", publisher = "IEEE Computer Society", year = "2006", booktitle = "CSFW", pages = "283--296", URL = "https://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=10965", } @Article{garg12jcs, title = "Stateful authorization logic - Proof theory and a case study", author = "Deepak Garg and Frank Pfenning", journal = "Journal of Computer Security", year = "2012", number = "4", volume = "20", pages = "353--391", } @InProceedings{garg2010proof, title = "A proof-carrying file system", author = "Deepak Garg and Frank Pfenning", booktitle = "2010 IEEE Symposium on Security and Privacy", pages = "349--364", year = "2010", organization = "IEEE", } @InProceedings{garrigue97tacs, author = "Jacques Garrigue and Didier R{\'e}my", title = "Extending {ML} with Semi-Explicit Higher-Order Polymorphism", booktitle = "International Symposium on Theoretical Aspects of Computer Software", year = "1997", month = sep, series = lncs, publisher = "Springer", volume = "1281", pages = "20--46", } @Article{gaspar13sl, title = "Negative Translations Not Intuitionistically Equivalent to the Usual Ones", author = "Jaime Gaspar", journal = "Studia Logica", year = "2013", number = "1", volume = "101", pages = "45--63", } @Book{gazdar85book, author = "Gerald Gazdar and Ewan Klein and Geoffrey Pullum and Ivan Sag", title = "Generalized Phrase Structure Grammar", publisher = "Harvard University Press", year = "1985", address = "Cambridge, Massachusetts", } @Unpublished{gazeau.rewriting, author = "Ivan Gazeau and Dale Miller and Catuscia Palamidessi", title = "Non-local robustness analysis via rewriting techniques", month = sep, year = "2012", note = "An earlier version of this paper appeared in the pre-proceedings of QFM 2012.", URL = "https://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/qapl-full-version.pdf", } @TechReport{gazeau12hal, hal_id = "hal-00665995", institution = "INRIA", URL = "https://hal.inria.fr/hal-00665995", title = "{A non-local method for robustness analysis of floating point programs}", author = "Ivan Gazeau and Dale Miller and Catuscia Palamidessi", booktitle = "{QAPL - Tenth Workshop on Quantitative Aspects of Programming Languages}", address = "Tallinn, Estonie", year = "2012", month = Feb, note = "To appear in QAPL 2012.", pdf = "https://hal.inria.fr/hal-00665995/PDF/proof\_example.pdf", } @InProceedings{gazeau12qapl, author = "Ivan Gazeau and Dale Miller and Catuscia Palamidessi", title = "A non-local method for robustness analysis of floating point programs", booktitle = "Proceedings of the 10th Workshop on Quantitative Aspects of Programming Languages and Systems (QAPL 2012)", pages = "63--76", year = "2012", editor = "Herbert Wiklicky and Mieke Massink", volume = "85", series = "Electronic Proceedings in Theoretical Computer Science", doi = "10.4204/EPTCS.85.5", } @PhdThesis{gazeau13phd, author = "Ivan Gazeau", title = "Safe Programming in finite precision: Controling the errors and information leaks", school = "Ecole Polytechnique", year = "2013", type = "Ph.D. Thesis", } @InProceedings{gazeau13qapl, author = "Ivan Gazeau and Dale Miller and Catuscia Palamidessi", title = "Preserving differential privacy under finite-precision semantics", booktitle = "Proceedings 11th International Workshop on Quantitative Aspects of Programming Languages and Systems (QAPL)", URL = "https://hal.inria.fr/hal-00780774", year = "2013", pages = "1--18", } @Article{gazeau16tcs, author = "Ivan Gazeau and Dale Miller and Catuscia Palamidessi", title = "Preserving differential privacy under finite-precision semantics", journal = tcs, year = "2016", doi = "10.1016/j.tcs.2016.01.015", pages = "92--108", volume = "655", } @InProceedings{gehlot90lics, author = "Vijay Gehlot and Carl Gunter", title = "Normal Process Representatives", booktitle = lics90, year = "1990", month = jun, address = "Philadelphia, Pennsylvania", organization = "IEEE Computer Society Press", pages = "200--207", doi = "10.1109/LICS.1990.113746", } @Article{gelenter86toplas, author = "David Gelenter", title = "{Generative communication in Linda}", journal = "ACM Transactions on Programming Languages and Systems", volume = "7", number = "1", pages = "80--112", year = "1986", } @InProceedings{gelfond88iclp, author = "Michael Gelfond and Vladimir Lifschitz", title = "The Stable Model Semantics for Logic Programming", booktitle = "Proceedings of the Fifth International Conference on Logic Programming", year = "1988", editor = "Robert A. Kowalski and Kenneth Bowen", pages = "1070--1080", publisher = "The {MIT} Press", address = "Cambridge, Massachusetts", } @InCollection{gentzen35, author = "Gerhard Gentzen", title = "Investigations into Logical Deduction", booktitle = "{The Collected Papers of Gerhard Gentzen}", editor = "M. E. Szabo", publisher = "North-Holland", address = "Amsterdam", year = "1935", pages = "68--131", note = "Translation of articles that appeared in 1934-35. Collected papers appeared in 1969.", doi = "10.1007/BF01201353", } @Article{gentzen36ma, author = "Gerhard Gentzen", title = "Die Widerspruchfreiheit der reinen Zahlentheorie", journal = "Mathematische Annalen", year = "1936", volume = "112", pages = "493--565", note = "Reprinted in English translation as ``The consistency of Elementary Number Theory'' in The collected papers of Gerhard Gentzen, M. E. Szabo, ed.", } @InCollection{gentzen38, author = "Gerhard Gentzen", year = "1938", title = "New version of the consistency proof for elementary number theory", booktitle = "Collected Papers of Gerhard Gentzen", editor = "M. E. Szabo", publisher = "North-Holland", address = "Amsterdam", pages = "252--286", note = "Originally published 1938", } @Misc{geogebra, key = "GeoGebra", title = "GeoGebra for Teaching and Learning Math", howpublished = "\url{https://www.geogebra.org/}", } @Unpublished{gerard.mlts, author = "Ulysse G\'erard and Dale Miller", title = "Functional programming with $\lambda$-tree syntax: Draft", note = "Available from \url{https://trymlts.github.io/}.", month = may, year = "2018", } @InProceedings{gerard17csl, author = "Ulysse G\'erard and Dale Miller", title = "Separating Functional Computation from Relations", booktitle = "26th EACSL Annual Conference on Computer Science Logic (CSL 2017)", year = "2017", editor = "Valentin Goranko and Mads Dam", volume = "82", series = "LIPIcs", pages = "23:1--23:17", doi = "10.4230/LIPIcs.CSL.2017.23", } @InProceedings{gerard18lfmtp, title = "{Functional programming with $\lambda$-tree syntax: a progress report}", author = "Ulysse G{\'e}rard and Dale Miller", URL = "https://hal.inria.fr/LFMTP-2018/hal-01806129v1", booktitle = "{13th international Workshop on Logical Frameworks and Meta-Languages: Theory and Practice}", address = "Oxford, United Kingdom", year = "2018", month = Jul, pdf = "https://hal.inria.fr/hal-01806129/file/paper.pdf", } %% URL = "https://www.lix.polytechnique.fr/Labo/Dale.Miller/gerard19phd.pdf", @PhdThesis{gerard19phd, author = "Ulysse G{\'e}rard", title = "Computing with relations, functions, and bindings", school = "Institut Polytechnique de Paris", year = "2019", month = jun, URL = "https://hal.archives-ouvertes.fr/tel-02414237", } @InProceedings{gerard19ppdp, author = "Ulysse G{\'e}rard and Dale Miller and Gabriel Scherer", title = "Functional programming with $\lambda$-tree syntax", booktitle = "Principles and Practice of Programming Languages 2019 (PPDP '19)", year = "2019", editor = "E. Komendantskaya", URL = "https://dx.doi.org/10.1145/3354166.3354177", doi = "10.1145/3354166.3354177", month = oct, } @Article{geuvers09sadhana, author = "H. Geuvers", title = "Proof assistants: History, ideas and future", journal = "S\={a}dhan\={a}", year = "2009", volume = "34", pages = "3--25", } @InCollection{geuvers92types, author = "Herman Geuvers", title = "Inductive and Coinductive Types with Iteration and Recursion", editor = "B. Nordstr{\"o}m and K. Pettersson and G. Plotkin", booktitle = "Informal Proceedings Workshop on Types for Proofs and Programs, B{\aa}stad, Sweden, 8--12 June 1992", publisher = "Dept.\ of Computing Science, Chalmers Univ.\ of Technology and G{\"o}teborg Univ.", pages = "193--217", year = "1992", URL = "https://www.cs.kun.nl/~herman/BRABasInf_RecTyp.ps.gz", } @Article{giacobazzi96au, author = "R. Giacobazzi and C. Palamidessi and F. Ranzato", title = "Weak relative pseudo-complements of closure operators", journal = "Algebra Universalis", year = "1996", volume = "36", number = "3", pages = "405--412", } @Article{giannotti87, author = "F. Giannotti and A. Matteucci and D. Pedreschi and F. Turini", title = "Symbolic Evaluation with Structural Recursive Symbolic Constants", journal = "Science of Computer Programming", volume = "9", number = "2", pages = "161--177", year = "1987", } @InProceedings{giese99tableaux, author = "Martin Giese and Wolfgang Ahrendt", title = "Hilbert's epsilon-Terms in Automated Theorem Proving", booktitle = tableaux99, year = "1999", pages = "171--185", } @Book{gilmore05book, author = "Paul C. Gilmore", title = "Logicism Renewed", publisher = "A.K. Peters, Ltd.", year = "2005", address = "Wellesley, Massachusetts", ISBN = "1-56881-276-0", URL = "https://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.22.6490", note = "Reviewed by Jamie Andrews, 2007, Bulletin of Symbolic Logic", } @InCollection{gimenez95types, author = "Eduardo Gim{\'e}nez", title = "Codifying Guarded Definitions with Recursion Schemes", editor = "P. Dybjer and B. Nordstr{\"o}m", booktitle = "Selected Papers 2nd Int.\ Workshop on Types for Proofs and Programs, TYPES'94, B{\aa}stad, Sweden, 6--10 June 1994", series = lncs, volume = "996", pages = "39--59", publisher = "Springer", address = "Berlin", year = "1994", } @PhdThesis{gimenez96phd, author = "Eduardo Gim{\'e}nez", title = "Un Calcul de Constructions Infinies et son Application a la Verification des Systemes Communicants", type = "{Ph.D.} thesis {PhD} 96-11", school = "Laboratoire de l'Informatique du Parall{\'e}lisme, Ecole Normale Sup{\'e}rieure de Lyon", month = dec, year = "1996", URL = "ftp://ftp.ens-lyon.fr/pub/LIP/Rapports/PhD/PhD96-11.ps.Z", } @InCollection{gimenez96types, author = "Eduardo Gim{\'e}nez", title = "An Application of Co-Inductive Types in {Coq}: An Experiment with the Alternating Bit Protocol", editor = "S. Berardi and M. Coppo", booktitle = "Selected Papers 3rd Int.\ Workshop on Types for Proofs and Programs, TYPES'95, Torino, Italy, 5--8 June 1995", series = lncs, volume = "1158", pages = "135--152", publisher = "Springer", address = "Berlin", year = "1996", } @InCollection{gimenez98icalp, author = "Eduardo Gim{\'e}nez", title = "Structural Recursive Definitions in Type Theory", editor = "K. G. Larsen and S. Skyum and G. Winskel", booktitle = "Proceedings 25th Int.\ Coll.\ on Automata, Languages and Programming, ICALP'98, Aalborg, Denmark, 13--17 July 1998", series = lncs, volume = "1443", pages = "397--408", publisher = "Springer", address = "Berlin", year = "1998", } @TechReport{gimenez98tr, type = "Technical Report", number = "RT-0221", institution = "Inria, Institut National de Recherche en Informatique et en Automatique", title = "A Tutorial on Recursive Types in Coq", author = "Eduardo Gimenez", } @InProceedings{giordano88fgcs, author = "L. Giordano and A. Martelli and G. F. Rossi", title = "Local Definitions with Static Scope Rules in Logic Languages", booktitle = "Proceedings of the FGCS International Conference, Tokyo", year = "1988", } @InProceedings{giordano91ilps, author = "L. Giordano and A. Martelli", title = "A Modal Reconstruction of Blocks and Modules in Logic Programming", booktitle = "Proc. International Logic Programming Symposium", year = "1991", address = "San Diego", pages = "239--253", } @Article{girard01mscs, author = "Jean-Yves Girard", title = "Locus solum: From the rules of logic to the logic of rules", journal = "Mathematical Structures in Computer Science", year = "2001", pages = "301--506", volume = "11", number = "3", month = jun, doi = "10.1017/S096012950100336X", } @Book{girard06book, author = "Jean-Yves Girard", title = "Le Point Aveugle: Cours de logique: Tome 1, Vers la perfection", publisher = "Hermann", year = "2006", } @Unpublished{girard21sc, author = "Jean-Yves Girard", title = "Schrödinger’s cut: La logique à la lumière du quantique", note = "Unpublished.", URL = "https://girard.perso.math.cnrs.fr/chat.pdf", month = feb, year = "2021", } @InCollection{girard71sls, author = "Jean-Yves Girard", title = "Une extension de l'interpretation de {G{\"o}del} {\`a} l'analyse, et son application {\`a} l'{\'e}limination des coupures dans l'analyse et la th{\'e}orie des types", publisher = "North-Holland", address = "Amsterdam", editor = "J. E. Fenstad", booktitle = "2nd Scandinavian Logic Symposium", year = "1971", pages = "63--92", } @Article{girard86tcs, author = "Jean-Yves Girard", title = "The System {F} of Variable Types: Fifteen Years Later", journal = "Theoretical Computer Science", volume = "45", pages = "159--192", year = "1986", } @Book{girard87book, author = "Jean-Yves Girard", title = "Proof Theory and Logical Complexity, Volume {I}", year = "1987", volume = "1", series = "Studies in Proof Theory", publisher = "Bibliopolis, edizioni di filosofia e scienze", address = "Napoli", } @InProceedings{girard87ccsl, author = "Jean-Yves Girard", title = "Towards a Geometry of Interaction", booktitle = "Categories in Computer Science", month = jun, year = "1987", publisher = "AMS", series = "Contemporary Mathematics", volume = "92", pages = "69--108", } @Article{girard87tcs, author = "Jean-Yves Girard", title = "Linear Logic", journal = "Theoretical Computer Science", volume = "50", number = "1", year = "1987", pages = "1--102", doi = "10.1016/0304-3975(87)90045-4", } @Book{girard89book, author = "Jean-Yves Girard and Paul Taylor and Yves Lafont", title = "Proofs and Types", publisher = "Cambridge University Press", year = "1989", } @InProceedings{girard90feas, author = "Jean-Yves Girard and Andre Scedrov and Philip J. Scott", title = "Bounded Linear Logic: {A} Modular Approach to Polynomial Time Computability", booktitle = "Feasible Mathematics, Proc. Mathematical Sciences Institute Workshop, Cornell University, June, 1989", editor = "S. R. Buss and P. J. Scott", publisher = "{Birkh\"auser Boston}", year = "1990", pages = "195--209", } @TechReport{girard91LU, author = "Jean-Yves Girard", title = "On the unity of logic", institution = "Universit\'e Paris VII", year = "1991", month = jun, number = "26", } @Article{girard91mscs, author = "Jean-Yves Girard", title = "A new constructive logic: classical logic", journal = "Math. Structures in Comp. Science", volume = "1", year = "1991", pages = "255--296", doi = "10.1017/S0960129500001328", } @Article{girard92jlc, author = "Jean-Yves Girard", title = "{Logic and Exceptions: A Few Remarks}", journal = "Journal of Logic and Computation", volume = "2", number = "2", pages = "111--118", year = "1992", month = may, doi = "10.1093/logcom/2.2.111", } @Unpublished{girard92mail, author = "Jean-Yves Girard", title = "A Fixpoint Theorem in Linear Logic", note = "An email posting to linear@cs.stanford.edu archived at \url{https://www.seas.upenn.edu/~sweirich/types/archive/1992/msg00030.html}", year = "1992", month = feb, } @Article{girard93apal, author = "Jean-Yves Girard", title = "On the unity of logic", journal = apal, year = "1993", volume = "59", pages = "201--217", doi = "10.1016/0168-0072(93)90093-S", } @InProceedings{girard95all, author = "Jean-Yves Girard", title = "Linear Logic: Its Syntax and Semantics", booktitle = "Advances in Linear Logic", year = "1995", editor = "J.-Y. Girard and Y. Lafont and L. Regnier", pages = "1--42", publisher = "Cambridge Univ.~Press", } @InProceedings{girard96laa, author = "Jean-Yves Girard", title = "Proof-nets: the parallel syntax for proof-theory", booktitle = "Logic and Algebra", editor = "Aldo Ursini and Paolo Agliano", series = "Lecture Notes In Pure and Applied Mathematics", volume = "180", pages = "97--124", publisher = "Marcel Dekker", address = "New York", year = "1996", } @Article{girard98ic, author = "Jean-Yves Girard", title = "Light Linear Logic", journal = "Information and Computation", year = "1998", volume = "143", number = "2", pages = "175--204", doi = "10.1006/inco.1998.2700", } @InCollection{girard99cl, author = "Jean-Yves Girard", editor = "Berger and Schwichtenberg", booktitle = "Computational Logic", title = "On the meaning of logical rules {I}: syntax vs. semantics", publisher = pub-sv, year = "1999", pages = "215--272", } @InProceedings{glabbeek90concur, author = "R. J. van Glabbeek", pages = "278--297", title = "The Linear Time -- Branching Time Spectrum", editor = "J. C. M. Baeten and J. W. Klop", series = lncs, publisher = "Springer", volume = "458", year = "1990", booktitle = "Proceedings of CONCUR'90", address = "Amsterdam", } @TechReport{glabbeek90tr, author = "R. J. van Glabbeek", title = "The linear time -- branching time spectrum", institution = "CWI", number = "CS-R9029", year = "1990", } @Article{glenszczk15sl, author = "Anna Glenszczyk", title = "Negational Fragment of Intuitionistic Control Logic", year = "2015", journal = "Studia Logica", doi = "10.1007/s11225-015-9610-7", URL = "https://dx.doi.org/10.1007/s11225-015-9610-7", publisher = "Springer Netherlands", pages = "1--21", } @InProceedings{goad80a, author = "Christopher. A. Goad", title = "Proofs as Descriptions of Computation", booktitle = "Fifth Conference on Automated Deduction", address = "Les Arcs, France", publisher = "Springer", year = "1980", editor = "W. Bibel and R. Kowalski", series = lncs, volume = "87", pages = "39--52", } @PhdThesis{goad80b, author = "Christopher Alan Goad", title = "Computational Uses of the Manipulation of Formal Proofs", school = "Stanford University", month = aug, year = "1980", } @Article{goedel30mfm, author = "Kurt G{\"o}del", title = "Die Vollst{\"a}ndigkeit der Axiome des logischen Funktionenkalk{\"u}ls", journal = "Monatshefte f{\"u}r Mathematik", year = "1930", volume = "37", number = "1", pages = "349--360", doi = "10.1007/BF01696781", } @Article{goedel31mmp, author = "Kurt G{\"o}del", title = "{\"U}ber formal unentscheidbare {S\"a}tze der {Principia Mathematica} und verwandter {S}ysteme {I}", journal = "Monatshefte der Mathematischen Physik", year = "1931", volume = "38", pages = "173--198", note = "English Version in~\cite{vanheijenoort67book}", } @Article{goedel32erg, author = "Kurt G{\"o}del", title = "Zur intuitionistischen Arithmetik und Zahlentheorie", journal = "Ergebnisse eines Mathematischen Kolloquiums", year = "1932", pages = "34--38", note = "English translation in {\em The Undecidable} (M. Davis, ed.) 1965, 75-81", } @Article{goedel33emk, author = "Kurt G{\"o}del", title = "Eine Interpretation des intuitionistischen Aussagenkalkuls", journal = "Ergebnisse eines Mathematischen Kolloquiums.", volume = "4", pages = "39--40", year = "1933", note = "Available in ``Kurt G{\"o}del: Collected Works. Volume 1'' edited by S. Feferman and et al.", } @InCollection{goedel36vol1, author = "Kurt G{\"o}del", title = "On the length of proofs", booktitle = "Kurt G{\"o}del: Collected Works. Volume 1", pages = "396--399", publisher = "Oxford University Press", year = "1986", editor = "S. Feferman and et al.", } @Article{goedel58dialectica, author = "Kurt G{\"o}del", title = "{\"U}ber eine bisher noch nicht ben{\"u}tzte {E}rweiterung des finiten {S}tandpunktes", journal = "Dialectica", year = "1958", pages = "280--287", } @InCollection{goedel65davis, author = "Kurt G{\"o}del", title = "On Formally Undecidable Propositions of the Principia Mathematica and Related Systems. {I}.", publisher = "Raven Press", booktitle = "The Undecidable", editor = "Martin Davis", year = "1965", } @InProceedings{goguen00ase, author = "Joseph Goguen and Kai Lin and Grigore Rosu", title = "Circular Coinductive Rewriting", booktitle = "Automated Software Engineering 2000 (ASE'00)", year = "2000", } @Article{goguen01entcs, author = "Joseph Goguen and Kai Lin and Grigore Rosu", title = "Behavioral and Coinductive Rewriting", journal = entcs, year = "2001", volume = "36", } @InProceedings{goguen75, author = "J. Goguen and J. Thatcher and E. Wagner", title = "Abstract Data Types as Initial Algebras and the Correctness of Data Representations", booktitle = "Computer Graphics, Pattern Recognition and Data Structure", pages = "89--93", publisher = "{IEEE} Press", year = "1975", } @InCollection{goguen78, author = "J. Goguen and J. Thatcher and E. Wagner", title = "An Initial Algebra Approach to the Specification, Correctness and Implementation of Abstract Data Types", booktitle = "Current Trends in Programming Methodology {IV}", editor = "R. Yeh", publisher = "Prentice-Hall", pages = "80--149", year = "1978", } @Book{goldblatt84book, author = "R. Goldblatt", title = "{Topoi: The Categorial Analysis of Logic}", publisher = "North-Holland", address = "New York", year = "1984", } @Article{goldfarb81tcs, author = "Warren Goldfarb", title = "The Undecidability of the Second-Order Unification Problem", journal = "Theoretical Computer Science", volume = "13", year = "1981", pages = "225--230", } @Article{golson83, author = "W. Golson and W. Rounds", title = "Connections between Two Theories of Concurrency: Metric Spaces and Synchronization Trees", journal = "Information and Control", volume = "57", year = "1983", pages = "102--124", } @InProceedings{gonthier07ascm, title = "The Four Colour Theorem: Engineering of a Formal Proof", author = "Georges Gonthier", publisher = "Springer", year = "2007", volume = "5081", booktitle = "8th Asian Symposium on Computer Mathematics", editor = "Deepak Kapur", pages = "333", series = lncs, } @InProceedings{gordon00milner, title = "From {LCF} to {HOL}: a short history", author = "Mike Gordon", booktitle = "Proof, Language, and Interaction: Essays in Honour of Robin Milner", publisher = "MIT Press", year = "2000", editor = "Gordon D. Plotkin and Colin Stirling and Mads Tofte", pages = "169--186", } @Article{gordon03tcs, author = "Andrew D. Gordon and Alan Jeffrey", title = "Typing correspondence assertions for communication protocols", journal = "Theoretical Computer Science", volume = "300", number = "1-3", year = "2003", pages = "379--409", publisher = "Elsevier Science Publishers Ltd.", } @Book{gordon79, author = "Michael J. Gordon and Arthur J. Milner and Christopher P. Wadsworth", title = "Edinburgh {LCF}: {A} Mechanised Logic of Computation", publisher = "Springer", volume = "78", series = lncs, year = "1979", doi = "10.1007/3-540-09724-4", } @TechReport{gordon85, author = "Mike Gordon", title = "{HOL}: {A} Machine Oriented Formulation of Higher-Order Logic", number = "68", institution = "University of Cambridge", month = jul, year = "1985", } @Book{gordon88, author = "Michael J. C. Gordon", title = "Programming Language Theory and its Implementation", publisher = "Prentice Hall", year = "1988", } @InProceedings{gordon91tphol, title = "Introduction to the {HOL} System", author = "Michael J. C. Gordon", publisher = "IEEE Computer Society", year = "1991", booktitle = "Proceedings of the International Workshop on the {HOL} Theorem Proving System and its Applications", editor = "Myla Archer and Jeffrey J. Joyce and Karl N. Levitt and Phillip J. Windley", pages = "2--3", } @Book{gordon93book, author = "M. J. C. Gordon and T. F. Melham", title = "Introduction to {HOL} -- {A} theorem proving environment for higher order logic", publisher = "Cambridge University Press", year = "1993", } @InCollection{gordon94hoare, author = "Michael Gordon", title = "A Mechanized {H}oare Logic of State Transitions", booktitle = "A Classical Mind: Essays in Honour of {C}. {A}. {R}. {H}oare", year = "1994", publisher = "Prentice-Hall International Series in Computer Science", editor = "A. W. Roscoe", pages = "163--185", } @InProceedings{gordon94tphol, author = "A. Gordon", title = "A Mechanisation of Name-Carrying Syntax up to Alpha-Conversion", booktitle = "International Workshop on Higher Order Logic Theorem Proving and its Applications", series = "Lecture Notes in Computer Science", volume = "780", pages = "414--426", year = "1994", } @Article{gore10jlc, author = "Rajeev Gor\'{e} and Linda Postniece", title = "Combining Derivations and Refutations for Cut-free Completeness in Bi-Intuitionistic Logic", journal = jlc, pages = "233--260", volume = "20", number = "1", year = "2010", pdf = "https://users.rsise.anu.edu.au/~linda/GorePostniece_GBiInt.pdf", } @Article{gore11lmcs, author = "Rajeev Gor{\'{e}} and Linda Postniece and Alwen Tiu", title = "On the Correspondence between Display Postulates and Deep Inference in Nested Sequent Calculi for Tense Logics", journal = "Logical Methods in Computer Science", volume = "7", number = "2", year = "2011", URL = "https://doi.org/10.2168/LMCS-7(2:8)2011", doi = "10.2168/LMCS-7(2:8)2011", } @InProceedings{gore13cade, author = "Rajeev Gor{\'{e}} and Jimmy Thomson", title = "An Improved {BDD} Method for Intuitionistic Propositional Logic: {BDDI}ntKt System Description", booktitle = "24th International Conference on Automated Deduction", series = lncs, volume = "7898", pages = "275--281", publisher = pub-sv, year = "2013", doi = "10.1007/978-3-642-38574-2\_19", } @InProceedings{goubault07aplas, author = "Jean Goubault-Larrecq and Catuscia Palamidessi and Angelo Troina", title = "A Probabilistic Applied Pi-Calculus", booktitle = "{P}roceedings of the 5th {A}sian {S}ymposium on {P}rogramming {L}anguages and {S}ystems ({APLAS}'07)", editor = "Zhong Shao", pages = "175--290", publisher = "Springer", series = "Lecture Notes in Computer Science", title = "A Probabilistic Applied Pi-Calculus", volume = "4807", year = "2007", } @Article{goubault19mscs, title = "A semantics for nabla", volume = "29", doi = "10.1017/S0960129518000063", number = "8", journal = "Mathematical Structures in Computer Science", publisher = "Cambridge University Press", author = "Jean Goubault-Larrecq", year = "2019", pages = "1250--1274", } @Article{goubault95jiglp, title = "A {BDD}-Based Simplification and Skolemization Procedure", author = "Jean Goubault", journal = "Logic Journal of the IGPL", year = "1995", number = "6", volume = "3", pages = "827--855", } @Book{goubault97book, author = "Jean Goubault-Larrecq and Ian Mackie", title = "Proof Theory and Automated Deduction", publisher = "Kluwer Academic Publishers", year = "1997", number = "6", series = "Applied Logic Series", } @InProceedings{goubault99tableaux, author = "Jean Goubault-Larrecq", title = "A Simple Sequent System for First-Order Logic with Free Constructors", booktitle = tableaux99, year = "1999", pages = "202--216", publisher = "Springer", address = "London, UK", series = lncs, volume = "1617", } @TechReport{gould66tr, author = "W. E. Gould", title = "A Matching Procedure for $\omega$-Order Logic", institution = "A F C R L", number = "Scientific Report No. 4", year = "1966", } @InProceedings{grabmayer14icfp, title = "Maximal sharing in the Lambda calculus with letrec", author = "Clemens Grabmayer and Jan Rochel", booktitle = "Proceedings of the 19th ACM SIGPLAN international conference on Functional programming, Gothenburg, Sweden, September 1-3, 2014", publisher = "ACM", year = "2014", editor = "Johan Jeuring and Manuel M. T. Chakravarty", pages = "67--80", doi = "10.1145/2692915.2628148", } @InProceedings{grabmayer18termgraph, title = "Modeling Terms by Graphs with Structure Constraints (Two Illustrations)", author = "Clemens Grabmayer", year = "2018", volume = "288", booktitle = "TERMGRAPH@FSCD", editor = "Maribel Fern{\'a}ndez and Ian Mackie", pages = "1--13", series = "EPTCS", doi = "10.48550/arXiv.1902.02010", } % URL = "https://arxiv.org/abs/1902.01510", @Proceedings{grahamlengrand13itrs, editor = "St{\'e}phane Graham-Lengrand and Luca Paolini", title = "Proceedings Sixth Workshop on Intersection Types and Related Systems, {ITRS} 2013, Dubrovnik, Croatia, 29th June 2012", series = "EPTCS", volume = "121", year = "2013", doi = "10.4204/EPTCS.121", } @Proceedings{gramlich12ijcar, title = "Automated Reasoning: 6th International Joint Conference, {IJCAR} 2012, Manchester, {UK}, June 2012, Proceedings", year = "2012", editor = "Bernhard Gramlich and Dale Miller and Uli Sattler", volume = "7364", series = lnai, publisher = pub-sv, doi = "10.1007/978-3-642-31365-3", } @Article{green69mi, author = "Cordell Green", title = "Theorem Proving by Resolution as a Basis for Question-Answering Systems", year = "1969", journal = "Machine Intelligence", volume = "4", publisher = "Elsevier", } @InCollection{green81, author = "Cordell Green", title = "Application of Theorem Proving to Problem Solving", booktitle = "Readings in Artificial Intelligence", editor = "Bonnie Webber and Nils Nilsson", chapter = "3", pages = "202--222", publisher = "Tioga", address = "Palo Alto", year = "1981", } @InProceedings{gregoire06flops, author = "Benjamin Gr{\'e}goire and Laurent Th{\'e}ry and Benjamin Werner", title = "A Computational Approach to Pocklington Certificates in Type Theory", pages = "97--113", doi = "10.1007/11737414\_8", editor = "Masami Hagiya and Philip Wadler", booktitle = "FLOPS 2006: Functional and Logic Programming, 8th International Symposium", publisher = "Springer", series = lncs, volume = "3945", year = "2006", } @Article{greibach69jcss, author = "S. Greibach and J. Hopcroft", title = "Scattered context grammars", journal = jcss, year = "1969", volume = "3", pages = "233--247", } @Article{grishin81iransm, title = "Predicate and set-theoretic calculi based on logic without contractions", author = "Vyacheslav Nikolaevich Grishin", journal = "Izvestiya Rossiiskoi Akademii Nauk. Seriya Matematicheskaya", volume = "45", number = "1", pages = "47--68", year = "1981", publisher = "Russian Academy of Sciences, Steklov Mathematical Institute of Russian", } @Article{grishin99mathnotes, title = "Weight of the Comprehension Axiom in a Theory Based on Logic without Contractions", author = "Vyacheslav Nikolaevich Grishin", journal = "Mathematical Notes", volume = "66", number = "5", pages = "533--540", year = "1999", publisher = "Kluwer Academic", } @Article{grohmann07entcs, author = "Davide Grohmann and Marino Miculan", title = "Directed Bigraphs", journal = entcs, volume = "173", pages = "121--137", year = "2007", doi = "10.1016/j.entcs.2007.02.031", } @Article{groote92ic, author = "J. F. Groote and F. Vaandrager", title = "Structured operational semantics and bisimulation as a congruence", journal = "Information and Computation", year = "1992", volume = "100", pages = "202--260", } @Proceedings{grundy98tphols, editor = "Jim Grundy and Malcolm C. Newey", title = "Theorem Proving in Higher Order Logics, 11th International Conference, {TPHOL}s'98, Canberra, Australia, September 27 - October 1, 1998, Proceedings", booktitle = "TPHOLs", publisher = "Springer", series = "Lecture Notes in Computer Science", volume = "1479", year = "1998", ISBN = "3-540-64987-5", } @InCollection{guard64tr, author = "J. R. Guard", title = "Automated logic for semi-automated mathematics", booktitle = "Scientific Report No 1", year = "1964", pages = "64--411", publisher = "A F C R L", } @InProceedings{guenot10iclp, author = "Nicolas Guenot", title = "Focused Proof Search for Linear Logic in the Calculus of Structures", booktitle = "Technical Communications of the 26th International Conference on Logic Programming (ICLP 2010)", year = "2010", month = jul, address = "Edinburgh, United Kingdom", editor = "Manuel V. Hermenegildo and Torsten Schaub", publisher = lci, series = lipics, volume = "7", pages = "84--93", doi = "10.4230/LIPIcs.ICLP.2010.84", URL = "https://www.lix.polytechnique.fr/~nguenot/pub/iclp10.pdf", } @InProceedings{guenot11ppdp, author = "Nicolas Guenot", title = "Nested proof search as reduction in the Lambda-calculus", booktitle = "Proceedings of the 13th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP)", editor = "Peter Schneider-Kamp and Michael Hanus", year = "2011", pages = "183--194", } @PhdThesis{guenot13phd, author = "Nicolas Guenot", school = "Ecole Polytechnique", title = "Nested Deduction in Logical Foundations for Computation", type = "Ph.D. Thesis", year = "2013", } @InProceedings{guenot14csllics, author = "Nicolas Guenot and Lutz Strassburger", title = "Symmetric Normalisation for Intuitionistic Logic", doi = "10.1145/2603088.2603160", booktitle = "Proceedings 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})", year = "2014", editor = "Tom Henzinger and Dale Miller", } @InProceedings{guerrini99lics, author = "Stefano Guerrini", title = "Correctness of Multiplicative Proof Nets is Linear", booktitle = lics99, year = "1999", pages = "454--463", } @InProceedings{guglielmi01csl, author = "Alessio Guglielmi and Lutz Stra{\ss}burger", title = "Non-commutativity and {MELL} in the Calculus of Structures", year = "2001", booktitle = "{CSL 2001}", volume = "2142", pages = "54--68", editor = "L. Fribourg", series = lncs, } @InProceedings{guglielmi02lpar, author = "Alessio Guglielmi and Lutz Stra{\ss}burger", title = "A Non-commutative Extension of {MELL}", booktitle = "Proceedings of LPAR 2002", pages = "231--246", year = "2002", number = "2514", series = lncs, month = jan, } @Article{guglielmi07tocl, author = "Alessio Guglielmi", title = "A System of Interaction and Structure", journal = tocl, year = "2007", volume = "8", number = "1", pages = "1--64", month = jan, doi = "10.1145/1182613.1182614", } @Article{guglielmi08lmcs, title = "Normalisation Control in Deep Inference via Atomic Flows", author = "Alessio Guglielmi and Tom Gundersen", journal = lmcs, year = "2008", number = "1", volume = "4", } @InProceedings{guglielmi10lics, author = "Alessio Guglielmi and Tom Gundersen and Lutz Stra{\ss}burger", title = "Breaking Paths in Atomic Flows for Classical Logic", booktitle = lics10, year = "2010", editor = "Jean-Pierre Jouannaud", month = jul, address = "Edinburgh, United Kingdom", pages = "284--293", doi = "10.1109/LICS.2010.12", URL = "https://www.lix.polytechnique.fr/~lutz/papers/AFII.pdf", } @InProceedings{guglielmi10rta, author = "Alessio Guglielmi and Tom Gundersen and Michel Parigot", title = "A Proof Calculus Which Reduces Syntactic Bureaucracy", booktitle = "Proceedings of the 21st International Conference on Rewriting Techniques and Applications ({RTA} 2010)", month = jul, year = "2010", address = "Edinburgh, United Kingdom", editor = "Christopher Lynch", publisher = lci, series = lipics, volume = "6", pages = "135--150", doi = "10.4230/LIPIcs.RTA.2010.135", URL = "https://drops.dagstuhl.de/opus/volltexte/2010/2649", } @Article{guglielmi11mscs, author = "Alessio Guglielmi and Lutz Stra{\ss}burger", title = "A system of interaction and structure {V}: the exponentials and splitting", journal = "Mathematical Structures in Computer Science", volume = "21", number = "3", year = "2011", pages = "563--584", doi = "10.1017/S096012951100003X", } @InProceedings{guglielmi94iclp, author = "Alessio Guglielmi", title = "Concurrency and Plan Generation in a Logic Programming Language with a Sequential Operator", booktitle = "Logic Programming, 11th International Conference, S. Margherita Ligure, Italy", pages = "240--254", editor = "P. Van Hentenryck", year = "1994", publisher = "Mit Press", } @InProceedings{guglielmi95strict, author = "Alessio Guglielmi", title = "Sequentiality by Linear Implication and Universal Quantification", booktitle = "Structures in Concurrency Theory", year = "1995", series = "Workshops in Computing", editor = "J{\"o}rg Desel", publisher = "Springer", pages = "160--174", } @PhdThesis{guglielmi96phd, author = "Alessio Guglielmi", title = "Abstract Logic Programming in Linear Logic---Independence and Causality in a First Order Calculus", school = "Uni\-ver\-si\-t\`a di Pisa", number = "TD-4/96", publisher = "Uni\-ver\-si\-t\`a di Pisa", year = "1996", } @InProceedings{gundersen13lics, title = "Atomic Lambda Calculus: {A} Typed Lambda-Calculus with Explicit Sharing", author = "Tom Gundersen and Willem Heijltjes and Michel Parigot", publisher = "IEEE Computer Society", year = "2013", booktitle = lics13, ISBN = "978-1-4799-0413-6", pages = "311--320", URL = "https://dl.acm.org/citation.cfm?id=2591370", doi = "10.5555/2591370.2591373", } @InProceedings{gunter89atpn, author = "C. A. Gunter and Vijay Gehlot", title = "Nets as Tensor Theories", booktitle = "Proc. 10-th International Conference on Application and Theory of Petri Nets (ICATPN'89), Bonn", editor = "G. De Michelis", year = "1989", pages = "174--191", } @TechReport{gunter89upenn, author = "C. A. Gunter and Vijay Gehlot", title = "Nets as Tensor Theories", year = "1989", month = oct, institution = "University of Pennsylvania, Computer and Information Science Department", number = "MS-CIS-89-68", URL = "https://repository.upenn.edu/cis_reports/857/", } @InProceedings{gunter91elp, author = "Elsa L. Gunter", editor = "Peter Schroeder-Heister", title = "Extensions to Logic Programming Motivated by the Construction of a Generic Theorem Prover", booktitle = "Extensions of Logic Programming: International Workshop, T{\"u}bingen FRG, December 1989", publisher = "Springer", series = lnai, volume = "475", year = "1991", pages = "223--244", } @Book{gunter92book, author = "C. A. Gunter", title = "Semantics of Programming Languages: Structures and Techniques", publisher = "MIT Press", series = "Foundations of Computing", year = "1992", } @Article{gurevich00tocl, author = "Gurevich", title = "Sequential Abstract-State Machines Capture Sequential Algorithms", journal = tocl, volume = "1", number = "1", pages = "77--111", year = "2000", } @InCollection{gurevich84cpt, author = "Yuri Gurevich", title = "Toward Logic Tailored for Computational Complexity", booktitle = "Computation and Proof Theory", editor = "M. M. Richter and {\em et al.}", publisher = "{Springer LNM 1104}", year = "1984", pages = "175--216", } @InCollection{gurevich88ttcs, author = "Yuri Gurevich", title = "Logic and the Challenge of Computer Science", booktitle = "Trends in Theoretical Computer Science", editor = "E. B{\"o}rger", publisher = "Computer Science Press", year = "1988", pages = "1--57", } @Article{guttag78, author = "J. Guttag and J. Horning", title = "The Algebraic Specification of Abstract Data Types", journal = "Acta Informatica", volume = "10", number = "1", pages = "27--52", year = "1978", } @InProceedings{guzman90lics, author = "Juan C. Guzm{\'a}n and Paul Hudak", title = "Single-Threaded Polymorphic Lambda Calculus", pages = "333--343", booktitle = lics90, year = "1990", month = jun, address = "Philadelphia, Pennsylvania", organization = "IEEE Computer Society Press", } @InProceedings{haas92jicslp, author = "Juergen Haas and Bharat Jayaraman", title = "Interactive Synthesis of Definite Clause Grammars", booktitle = "Proceedings of the Joint International Conference and Symposium on Logic Programming", editor = "K. R. Apt", publisher = "MIT Press", pages = "541--555", year = "1992", } @InProceedings{haas92lpw, title = "From Context-Free to Definite-Clause Grammars", author = "Juergen Haas and Bharat Jayaraman", editor = "Dale Miller", year = "1992", booktitle = "Proceedings of the 1992 Workshop on $\lambda$Prolog", } @InProceedings{haemmerle06iclp, title = "Modules for {Prolog} Revisited", author = "R{\'e}my Haemmerl{\'e} and Fran{\c c}ois Fages", booktitle = "ICLP: Logic Programming, 22nd International Conference", publisher = pub-sv, month = aug, year = "2006", volume = "4079", editor = "S. Etalle and M. Truszczynski", pages = "41--55", series = lncs, } @TechReport{haemmerle06inriatr, author = "R\'{e}my Haemmerle and Fran\c{c}ois Fages", title = "Modules for {P}rolog revisited", month = mar, year = "2006", institution = "INRIA Rocquencourt", number = "Rapport de recherche No 5869", URL = "ftp://ftp.inria.fr/INRIA/publication/publi-ps-gz/RR/RR-5869.ps.gz", } @Article{hagiya84ngc, title = "Foundation of Logic Programming Based on Inductive Definition", author = "Masami Hagiya and Takafumi Sakurai", journal = "New Gener. Comput", year = "1984", number = "1", volume = "2", pages = "59--77", } @InProceedings{hagiya90cade, author = "M. Hagiya", title = "Programming by Example and Proving by Example Using Higher-order Unification", booktitle = "Tenth International Conference on Automated Deduction, Kaiserslautern", editor = "Mark Stickel", publisher = "Springer", series = lnai, volume = "449", address = "Berlin", year = "1990", } @Article{hales05am, author = "Thomas C. Hales", title = "A Proof of the {Kepler} Conjecture", journal = "Annals of Mathematics", year = "2005", volume = "162", number = "3", pages = "1065--1185", } @InProceedings{hales05dag, title = "Introduction to the Flyspeck Project", author = "Thomas C. Hales", publisher = "Internationales Begegnungs- und Forschungszentrum f{\"u}r Informatik (IBFI), Schloss Dagstuhl, Germany", year = "2005", volume = "05021", booktitle = "Mathematics, Algorithms, Proofs", editor = "Thierry Coquand and Henri Lombardi and Marie-Fran{\c c}oise Roy", series = "Dagstuhl Seminar Proceedings", } @Misc{hales15arxiv, author = "Thomas C. Hales and Mark Adams and Gertrud Bauer and Dat Tat Dang and John Harrison and Truong Le Hoang and Cezary Kaliszyk and Victor Magron and Sean McLaughlin and Thang Tat Nguyen and Truong Quang Nguyen and Tobias Nipkow and Steven Obua and Joseph Pleso and Jason Rute and Alexey Solovyev and An Hoai Thi Ta and Trung Nam Tran and Diep Thi Trieu and Josef Urban and Ky Khac Vu and Roland Zumkeller", title = "A formal proof of the Kepler conjecture", year = "2015", note = "Available at \url{https://arxiv.org/abs/1501.02155}", } @Misc{hales18fabstracts, author = "Thomas Hales", title = "Formal Abstracts - a Vision", howpublished = "Blog posting \href{https://jiggerwit.wordpress.com/2018/04/09/formal-abstracts-a-long-term-vision/}{URL}.", month = apr, year = "2018", } @Article{hallnas87tcs, author = "Lars Halln{\"{a}}s", title = "An intensional characterization of the largest bisimulation", journal = "Theoretical Computer Science", year = "1987", volume = "53", pages = "333--343", } @Article{hallnas90jlc, author = "Lars Halln{\"{a}}s and Peter Schroeder-Heister", title = "A Proof-Theoretic Approach to Logic Programming. {I}. {Clauses} as rules", journal = jlc, volume = "1", number = "2", year = "1990", month = dec, pages = "261--283", doi = "10.1093/logcom/1.2.261", } @Article{hallnas91jlc, author = "Lars Halln{\"{a}}s and Peter Schroeder-Heister", title = "A Proof-Theoretic Approach to Logic Programming. {II}. {Programs} as definitions", journal = jlc, year = "1991", month = oct, volume = "1", number = "5", pages = "635--660", doi = "10.1093/logcom/1.5.635", } @Article{hallnas91tcs, author = "Lars Halln{\"{a}}s", title = "Partial inductive definitions", journal = "Theoretical Computer Science", year = "1991", volume = "87", pages = "115--142", } @Article{halpern01bsl, author = "Joseph Y. Halpern and Robert Harper and Neil Immerman and Phokion G. Kolaitis and Moshe Y. Vardi and Victor Vianu", title = "On the unusual effectiveness of logic in computer science", journal = "Bulletin of Symbolic Logic", year = "2001", volume = "7", number = "1", pages = "213--236", month = mar, } @TechReport{hannan87, author = "John J. Hannan", title = "Abstract Interpretation: Theory and Practice", institution = "University of Pennsylvania", type = "Area Exam Paper", month = oct, year = "1987", } @InProceedings{hannan88iclp, author = "John Hannan and Dale Miller", title = "Uses of higher-order unification for implementing program transformers", editor = "Kenneth A. Bowen and Robert A. Kowalski", booktitle = "Fifth International Logic Programming Conference", address = "Seattle, Washington", publisher = "MIT Press", pages = "942--959", month = aug, year = "1988", } @Unpublished{hannan88prop, author = "John. J. Hannan", title = "Proof-Theoretic Methods for Analysis of Functional Programs", month = dec, year = "1988", note = "Dissertation Proposal, University of Pennsylvania, Technical Report MS-CIS-89-07", } @TechReport{hannan88tr, author = "John Hannan and Dale Miller", title = "Enriching a meta-language with higher-order features", month = jun, year = "1988", institution = "University of Pennsylvania", number = "MS-CIS-88-45", URL = "https://repository.upenn.edu/cis_reports/695/", } @InCollection{hannan89meta, author = "John Hannan and Dale Miller", title = "A Meta-Logic for Functional Programming", chapter = "24", booktitle = "Meta-Programming in Logic Programming", editor = "Harvey Abramson and M. H. Rogers", publisher = "{MIT} Press", pages = "453--476", year = "1989", series = "Computer Science and Intelligent Systems", ISBN = "0-262-51047-2", note = "Proceedings of the 1988 Workshop on Meta-Programming in Logic Programming, Bristol, UK", } @InProceedings{hannan89mpc, author = "John Hannan and Dale Miller", title = "Deriving mixed evaluation from standard evaluation for a simple functional programming language", booktitle = "1989 Intern.\ Conf.\ on Mathematics of Program Construction", editor = "Jan L. A. van de Snepscheut", publisher = "Springer", series = lncs, volume = "375", year = "1989", pages = "239--255", URL = "https://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/mpc89.pdf", } @InProceedings{hannan90lfp, author = "John Hannan and Dale Miller", title = "From Operational Semantics to Abstract Machines: Preliminary Results", booktitle = "Proceedings of the 1990 ACM Conference on Lisp and Functional Programming", editor = "M. Wand", organization = "{ACM}", publisher = "ACM Press", pages = "323--332", year = "1990", doi = "10.1145/91556.91680", } @PhdThesis{hannan90phd, author = "John J. Hannan", title = "Investigating a Proof-Theoretic Meta-Language for Functional Programs", school = "University of Pennsylvania", month = aug, year = "1990", } @InProceedings{hannan91a, author = "John Hannan", title = "Staging Transformations for Abstract Machines", booktitle = "Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics Based Program Manipulation", editor = "P. Hudak and N. Jones", publisher = "ACM Press", pages = "130--141", year = "1991", } @InProceedings{hannan92lics, author = "John Hannan and Frank Pfenning", title = "Compiler Verification in {LF}", booktitle = lics92, address = "Santa Cruz, California", publisher = "IEEE Computer Society Press", month = jun, year = "1992", } @Article{hannan92mscs, author = "John Hannan and Dale Miller", title = "From Operational Semantics to Abstract Machines", journal = "Mathematical Structures in Computer Science", volume = "2", number = "4", year = "1992", pages = "415--459", doi = "10.1017/S0960129500001559", } @Article{hannan93jfp, author = "John Hannan", title = "Extended natural semantics", journal = "J. of Functional Programming", year = "1993", volume = "3", number = "2", pages = "123--152", month = apr, doi = "10.1017/S0956796800000666", } @Article{hansson94fac, author = "H. Hansson and B. Jonsson", title = "A logic for reasoning about time and probability", journal = "Formal Aspects of Computing", year = "1994", number = "6", } @InProceedings{hanus89iclp, author = "Michael Hanus", title = "Polymorphic Higher-Order Programming in {Prolog}", booktitle = "Proceedings of the Sixth International Conference", editor = "Giorgio Levi and Maurizio Martelli", year = "1989", publisher = "MIT Press", pages = "382--397", } @Article{hanus94jlp, author = "Michael Hanus", title = "The Integration of Functions into Logic Programming: {From} Theory to Practice", year = "1994", journal = "J. Logic Programming", volume = "19\&20", pages = "583--628", } @Article{hardy28mind, author = "G. H. Hardy", title = "Mathematical proof", journal = "Mind", year = "1928", volume = "38", pages = "1--25", } @Book{hardy40book, title = "A mathematician's apology", author = "Godfrey H. Hardy", publisher = "Cambridge University Press", year = "1940", pages = "1--153", } @InProceedings{haridi83lpw, title = "Evaluation of Logic Programs Based on Natural Deduction ({DRAFT})", author = "Seif Haridi and Dan Sahlin", booktitle = "Logic Programming Workshop", publisher = "N{\'u}cleo de Intellig{\^e}ncia Artificial, Universidade Nova De Lisboa, Portugal", year = "1983", editor = "Lu{\'i}s Moniz Pereira and Ant{\'o}nio Porto and Lu{\'i}s Monteiro and Miguel Figueiras", pages = "560--574", URL = "https://www.softwarepreservation.org/projects/prolog/lisbon/lpw83/LPW_1983_proceedings.pdf", } @Article{harland00entcs, title = "Forward and Backward Chaining in Linear Logic", author = "James Harland and David J. Pym and Michael Winikoff", journal = entcs, year = "2000", volume = "37", } @Article{harland03tocl, author = "James Harland and David Pym", title = "Resource-distribution via Boolean constraints", journal = tocl, year = "2003", volume = "4", number = "1", pages = "56--90", } @TechReport{harland90tr, author = "James Harland and David Pym", title = "The Uniform Proof-Theoretic Foundation of Linear Logic Programming", institution = "Laboratory for the Foundations of Computer Science, University of Edinburgh", number = "ECS-LFCS-90-124", month = nov, year = "1990", } @InProceedings{harland91ilps, author = "James Harland and David Pym", title = "The Uniform Proof-Theoretic Foundation of Linear Logic Programming (Extended Abstract)", booktitle = "Proceedings of the 1991 International Logic Programming Symposium, San Diego", month = nov, year = "1991", publisher = "MIT Press", address = "San Diego", editor = "V.~Saraswat and K.~Ueda", pages = "304--318", } @Unpublished{harland91tr, title = "A Proof Theoretic Analysis of Goal-Directed Provability", author = "James Harland", note = "Submitted for publication", year = "1991", month = aug, } @InProceedings{harland92lpar, author = "James Harland and David Pym", title = "Resolution in Fragments of Classical Linear Logic (Extended Abstract)", booktitle = lpar92, year = "1992", series = lncs, volume = "624", publisher = "Springer", address = "St. Petersburg", editor = "A.~Voronkov", pages = "30--41", month = jul, } @TechReport{harland92tr, author = "James Harland and David Pym", title = "On Goal-directed Provability in Classical Logic", institution = "Dept of Comp Sci, Uni. of Melbourne", number = "92/16", year = "1992", } @Article{harland94jlc, title = "A Proof-theoretic Analysis of Goal-directed Provability", author = "James Harland", pages = "69--88", journal = "Journal of Logic and Computation", year = "1994", month = feb, volume = "4", number = "1", } @InProceedings{harland96acsc, author = "James Harland and Michael Winikoff", title = "Some Applications of the Linear Logic Programming Language {L}ygon", booktitle = "Proceedings of the Nineteenth Australasian Computer Science Conference", pages = "262--271", year = "1996", address = "Melbourne, Australia", URL = "https://www.cs.mu.oz.au/~winikoff/papers/lygon/gz/acsc96.ps.gz", } @InProceedings{harland96amast, author = "James Harland and David Pym and Michael Winikoff", title = "Programming in {Lygon}: An Overview", booktitle = "Proceedings of the {Fifth} {International} {Conference} on {Algebraic} {Methodology} and {Software} {Technology}", pages = "391--405", editor = "Martin Wirsing and Maurice Nivat", year = "1996", month = jul, series = lncs, number = "1101", publisher = "Springer", } @Article{harland97cl, title = "On goal-directed provability in classical logic", author = "James Harland", journal = "Comput. Lang", year = "1997", number = "2-4", volume = "23", pages = "161--178", } @Article{harper07jfp, author = "Robert Harper and Daniel R. Licata", title = "Mechanizing Metatheory in a Logical Framework", journal = "Journal of Functional Programming", year = "2007", volume = "17", number = "4--5", pages = "613--673", month = jul, } @TechReport{harper86, author = "Robert Harper", title = "{Modules and Persistence in Standard ML}", number = "ECS-LFCS-86-11", institution = "Laboratory for the Foundations of Computer Science, University of Edinburgh", month = sep, year = "1986", } @InProceedings{harper87lics, author = "Robert Harper and Furio Honsell and Gordon Plotkin", title = "A Framework for Defining Logics", booktitle = lics87, pages = "194--204", address = "Ithaca, NY", month = jun, year = "1987", publisher = "IEEE", } @InProceedings{harper87tap, author = "Robert Harper and Robin Milner and Mads Tofte", title = "{A Type Discipline for Program Modules}", booktitle = "TAPSOFT '87", publisher = "Springer", year = "1987", series = lncs, volume = "250", pages = "308--319", } @TechReport{harper89lfcs, author = "Robert Harper and Robin Milner and Mads Tofte", title = "{The Definition of Standard ML: Version 3}", number = "ECS-LFCS-89-81", institution = "Laboratory for the Foundations of Computer Science, University of Edinburgh", month = may, year = "1989", } @TechReport{harper90tr, author = "Robert Harper", title = "Systems of Polymorphic Type Assignment in {LF}", institution = "Carnegie Mellon University", address = "Pittsburgh, Pennsylvania", number = "CMU-CS-90-144", month = jun, year = "1990", } @Unpublished{harper91lf, author = "Robert Harper and Frank Pfenning", title = "Modularity in the {LF} Logical Framework", month = nov, year = "1991", note = "Submitted", annote = "Talk given at the Second Workshop on Logical Frameworks, Edinburgh, Scotland, May 1991", } @Article{harper93jacm, author = "Robert Harper and Furio Honsell and Gordon Plotkin", title = "A Framework for Defining Logics", journal = "Journal of the ACM", volume = "40", number = "1", pages = "143--184", year = "1993", doi = "10.1145/138027.138060", } @Article{harper94ipl, title = "A simplified account of polymorphic references", author = "Robert Harper", pages = "201--206", journal = "Information Processing Letters", month = aug, year = "1994", volume = "51", number = "4", } @Article{harper98jlc, author = "Robert Harper and Frank Pfenning", title = "A module system for a programming language based on the {LF} logical framework", journal = jlc, year = "1998", volume = "8", number = "1", pages = "5--31", month = feb, } @InProceedings{harrison06ijcar, author = "John Harrison", title = "Towards self-verification of {HOL-Light}", booktitle = "Proceedings of IJCAR'06", year = "2006", volume = "4130", series = lncs, pages = "177--191", publisher = pub-sv, } @Article{harrison07jucs, title = "Floating-Point Verification", author = "John Harrison", journal = "J. UCS", year = "2007", number = "5", volume = "13", pages = "629--638", } @Book{harrison09book, author = "John Harrison", title = "Handbook of Practical Logic and Automated Reasoning", year = "2009", publisher = "Cambridge University Press", } @InProceedings{harrison09hol, title = "{HOL} Light: an overview", author = "John Harrison", booktitle = "International Conference on Theorem Proving in Higher Order Logics", pages = "60--66", year = "2009", organization = "Springer", } @InCollection{harrison14lc, author = "John Harrison and Josef Urban and Freek Wiedijk", title = "History of Interactive Theorem Proving", booktitle = "Computational Logic", publisher = "North Holland", year = "2014", editor = "J. Siekmann", volume = "9", pages = "135--214", series = "Handbook of the History of Logic", doi = "10.1016/B978-0-444-51624-4.50004-6", } @Article{harrison16jfr, title = "Preface: Twenty Years of the {QED} Manifesto", author = "John Harrison and Josef Urban and Freek Wiedijk", journal = "J. Formalized Reasoning", year = "2016", number = "1", volume = "9", pages = "1--2", } @Manual{harrison17hol, author = "John Harrison", title = "The {HOL} {L}ight tutorial", year = "2017", URL = "https://www.cl.cam.ac.uk/~jrh13/hol-light/tutorial.pdf", } @TechReport{harrison95tr, title = "Metatheory and reflection in theorem proving: {A} survey and critique", author = "John Harrison", year = "1995", institution = "Citeseer", } @InProceedings{harrison96fmcad, author = "John Harrison", title = "{HOL} Light: {A} Tutorial Introduction", booktitle = "Formal Methods in Computer-Aided Design, First International Conference, {FMCAD} '96, Palo Alto, California, USA, November 6-8, 1996, Proceedings", pages = "265--269", year = "1996", URL = "https://dx.doi.org/10.1007/BFb0031814", doi = "10.1007/BFb0031814", series = "Lecture Notes in Computer Science", volume = "1166", editor = "Mandayam K. Srivas and Albert John Camilleri", publisher = "Springer", } @InProceedings{harrison99tphol, author = "John Harrison", booktitle = "12th International Conference on Theorem Proving in Higher Order Logics", editor = "Y. Bertot and G. Dowek and A. Hirschowitz and C. Paulin and L. Th{\'e}ry", pages = "113--130", title = "A machine-checked theory of floating point arithmetic", year = "1999", publisher = pub-sv, series = lncs, volume = "1690", } @Article{harrop60jsl, author = "R. Harrop", title = "Concerning Formulas of the types {$A\rightarrow B\lor C,\ A\rightarrow (Ex)B(x)$} in Intuitionistic Formal Systems", journal = jsl, volume = "25", year = "1960", pages = "27--32", } @TechReport{hascoet87, author = "Laurent Hasco{\"{e}}t", title = "A Tactic-Driven System for Building Proofs", type = "Research Report", number = "770", institution = "INRIA", address = "Rocquencourt, France", month = dec, year = "1987", } @PhdThesis{haspel72, author = "C. H. Haspel", title = "A Study of Some Interpretations of Modal and Intuitionistic Logics in the First Order Predicate Calculus", school = "Syracuse University", address = "Syracuse, NY", year = "1972", } @Proceedings{hawblitzel12cpp, title = "{CPP}: Second International Conference on Certified Programs and Proofs", year = "2012", editor = "Chris Hawblitzel and Dale Miller", volume = "7679", series = lncs, publisher = pub-sv, doi = "10.1007/978-3-642-35308-6", } @InProceedings{heath15pxtp, author = "Quentin Heath and Dale Miller", title = "A framework for proof certificates in finite state exploration", booktitle = "Proceedings of the Fourth Workshop on Proof eXchange for Theorem Proving", year = "2015", editor = "Cezary Kaliszyk and Andrei Paskevich", number = "186", series = "Electronic Proceedings in Theoretical Computer Science", pages = "11--26", month = aug, publisher = "Open Publishing Association", doi = "10.4204/EPTCS.186.4", URL = "https://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/pxtp2015.pdf", } @InProceedings{heath17linearity, author = "Quentin Heath and Dale Miller", title = "A Proof Theory for Model Checking: An Extended Abstract", month = jan, year = "2017", booktitle = "Proceedings Fourth International Workshop on Linearity (LINEARITY 2016)", editor = "Iliano Cervesato and Maribel Fern\'andez", volume = "238", series = "EPTCS", doi = "10.4204/EPTCS.238.1", } @Article{heath19jar, author = "Quentin Heath and Dale Miller", title = "A proof theory for model checking", year = "2019", doi = "10.1007/s10817-018-9475-3", journal = jar, volume = "63", number = "4", pages = "857--885", } @Article{heck93jsl, author = "Jr. Richard G. Heck", journal = "Journal of Symbolic Logic", title = "The Development of Arithmetic in Frege's {\it Grundgesetze der Arithmetik}", volume = "58", number = "2", year = "1993", pages = "579--601", } @Article{heering86, author = "J. Heering", title = "Partial Evaluation and $\omega$-Completeness of Algebraic Specifications", journal = "Theoretical Computer Science", volume = "43", year = "1986", pages = "149--167", } @Book{heijenoort67book, author = "Jean van Heijenoort", title = "From {F}rege to {G\"{o}}del. {A} Source Book in Mathematical Logic 1879--1931", publisher = "Harvard University Press", year = "1967", address = "Cambridge, Massachusetts", } @Article{heijltjes10apal, author = "Willem Heijltjes", title = "Classical Proof Forestry", journal = apal, year = "2010", volume = "161", number = "11", pages = "1346--1366", } @Article{heijltjes16mscs, title = "{Proof nets and semi-star-autonomous categories}", author = "Willem Heijltjes and Lutz Stra{\ss}burger", URL = "https://hal.inria.fr/hal-01417643", journal = "{Mathematical Structures in Computer Science}", publisher = "{Cambridge University Press (CUP)}", volume = "26", number = "5", pages = "789--828", year = "2016", month = Jun, doi = "10.1017/S0960129514000395", hal_id = "hal-01417643", hal_version = "v1", } @TechReport{heijltjes18tr, author = "Willem B. Heijltjes and Dominic J. D. Hughes and Lutz Stra{\ss}burger", title = "Proof nets for first-order additive linear logic", institution = "Inria", year = "2018", number = "9201", month = sep, } @InProceedings{heintze90lics, author = "Nevin Heintze and Joxan Jaffar", title = "A Decision Procedure for a Class of Set Constraints", booktitle = lics90, organization = "IEEE Computer Society Press", year = "1990", } @PhdThesis{hendriks93phd, author = "H. Hendriks", title = "Studied Flexibility: Categories and Types in Syntax and Semantics", school = "ILLC", address = "Amsterdam", year = "1993", } @Article{henglein94jfp, author = "Fritz Henglein and Harry Mairson", title = "The Complexity of Type Inference for Higher-Order Typed Lambda Calculi", journal = "Journal of Functional Programming", year = "1994", month = oct, volume = "4", number = "4", pages = "435--477", } @Article{henkin49jsl, author = "Leon Henkin", title = "The Completeness of the First-Order Functional Calculus", journal = "Journal of Symbolic Logic", year = "1949", volume = "14", number = "3", pages = "159--166", } @Article{henkin50jsl, author = "Leon Henkin", journal = "Journal of Symbolic Logic", number = "2", pages = "81--91", title = "Completeness in the Theory of Types", volume = "15", year = "1950", } @Article{henkin96bsl, author = "Leon Henkin", journal = "The Bulletin of Symbolic Logic", volume = "2", number = "2", pages = "127--158", title = "The discovery of my completeness proofs", year = "1996", } @Article{hennessy85jacma, author = "Matthew Hennessy and Robin Milner", title = "Algebraic Laws for Nondeterminism and Concurrency", journal = "JACM", volume = "32", number = "1", year = "1985", pages = "137--161", doi = "10.1145/2455.2460", } @Article{hennessy85jacmb, author = "M. Hennessy", title = "Acceptance Trees", journal = "JACM", volume = "32", number = "4", year = "1985", pages = "896--928", } @Book{hennessy88, author = "Matthew Hennessy", title = "Algebraic Theory of Processes", publisher = "MIT Press", year = "1988", } @Book{hennessy90, author = "J.~Hennesy and D.~Patterson", title = "Computer Architecture {A} Quantitative Approach", publisher = "Morgan Kaufman Publishers, Inc.", year = "1990", } @Article{hennessy95tcs, title = "Symbolic bisimulations", author = "M. Hennessy and H. Lin", journal = "Theoretical Computer Science", pages = "353--389", month = feb, year = "1995", volume = "138", number = "2", } @TechReport{henriksen09tr, title = "{U}sing {LJF} as a {F}ramework for {P}roof {S}ystems", author = "Anders Starcke Henriksen", institution = "{U}niversity of {C}openhagen", type = "{T}echnical {R}eport", year = "2009", URL = "https://hal.inria.fr/inria-00442159/en/", } @PhdThesis{henriksen11phd, author = "Anders Starcke Henriksen", title = "Adversarial Models for Cooperative Interactions", school = "University of Copenhagen", year = "2011", month = dec, } @Article{hensel98jlc, title = "Coalgebraic Theories of Sequences in {PVS}", author = "Ulrich Hensel and Bart Jacobs", journal = jlc, pages = "463--500", volume = "9", number = "4", year = "1999", } @InProceedings{herbelin10lics, author = "Hugo Herbelin", title = "An Intuitionistic Logic That Proves {Markov's} Principle", editor = "Jean-Pierre Jouannaud", booktitle = lics10, pages = "50--56", year = "2010", organization = "IEEE", } @Unpublished{herbelin11unp, author = "Hugo Herbelin and Alexis Saurin", title = "$\lambda$-calculus and ${\Lambda}$-calculus: a capital difference", note = "Unpublished manuscript", year = "2010", } @InProceedings{herbelin94csl, author = "Hugo Herbelin", title = "A Lambda-Calculus Structure Isomorphic to {G}entzen-Style Sequent Calculus Structure", booktitle = "Computer Science Logic, 8th International Workshop, CSL '94", pages = "61--75", publisher = "Springer", series = "Lecture Notes in Computer Science", volume = "933", year = "1995", doi = "10.1007/BFb0022247", } @PhdThesis{herbelin95phd, author = "Hugo Herbelin", title = "{S}\'equents qu'on calcule: de l'interpr\'etation du calcul des s\'equents comme calcul de lambda-termes et comme calcul de strat\'egies gagnantes", school = "Universit\'e Paris 7", year = "1995", URL = "https://tel.archives-ouvertes.fr/tel-00382528", } @InProceedings{herbelinl09wollic, title = "Forcing-Based Cut-Elimination for Gentzen-Style Intuitionistic Sequent Calculus", author = "Hugo Herbelin and Gyesik Lee", booktitle = "Logic, Language, Information and Computation, 16th International Workshop, Wo{LLIC} 2009, Tokyo, Japan, June 21-24, 2009. Proceedings", publisher = "Springer", year = "2009", volume = "5514", editor = "Hiroakira Ono and Makoto Kanazawa and Ruy J. G. B. de Queiroz", pages = "209--217", series = lncs, doi = "10.1007/978-3-642-02261-6", } @PhdThesis{herbrand30phd, author = "Jacques Herbrand", year = "1930", title = "Recherches sur la Th{\'e}orie de la {D}{\'e}monstration", school = "University of Paris", } @Article{hermant10jlc, title = "Completeness and Cut-elimination in the Intuitionistic Theory of Types - Part 2", author = "Olivier Hermant and James Lipton", journal = "J. Logic and Computation", year = "2010", number = "2", volume = "20", pages = "597--602", URL = "https://dx.doi.org/10.1093/logcom/exp076", } @Article{hermenegildo05scp, author = "Manuel V. Hermenegildo and Germ{\'a}n Puebla and Francisco Bueno and Pedro L{\'o}pez-Garc{\'\i}a", title = "Integrated program debugging, verification, and optimization using abstract interpretation (and the Ciao system preprocessor)", journal = "Sci. Comput. Program.", year = "2005", volume = "58", number = "1-2", pages = "115--140", } @InProceedings{hermenegildo99iclp, author = "Manuel V. Hermenegildo and Francisco Bueno and Germ{\'a}n Puebla and Pedro L{\'o}pez-Garc{\'\i}a", title = "Program analysis, debugging, and optimization using the ciao system preprocessor", booktitle = "Proceedings of the 1999 international conference on Logic programming", year = "1999", pages = "52--66", location = "Las Cruces, New Mexico, United States", publisher = "MIT Press", } @Article{hermida98ic, title = "Structural Induction and Coinduction in a Fibrational Setting", author = "Claudio Hermida and Bart Jacobs", pages = "107--152", journal = "Information and Computation", month = sep, year = "1998", volume = "145", number = "2", } @Unpublished{hetzl.unp, author = "Stefan Hetzl", title = "On the form of witness terms", note = "Draft manuscript", year = "2009", } @InProceedings{hetzl07apanl, author = "Stefan Hetzl and Alexander Leitsch", title = "{P}roof {T}ransformations and {S}tructural {I}nvariance", booktitle = "{A}lgebraic and {P}roof-theoretic {A}spects of {N}on-classical {L}ogics", year = "2007", editor = "Stefano Aguzzoli and Agata Ciabattoni and Brunella Gerla and Corrado Manara and Vincenzo Marra", series = "Lecture Notes in Computer Science", publisher = "Springer", note = "to appear", } @Article{hetzl09apal, author = "Stefan Hetzl", title = "Describing proofs by short tautologies", journal = apal, year = "2009", volume = "159", number = "1--2", pages = "129--145", } @InProceedings{hetzl09lfcs, author = "Stefan Hetzl and Alexander Leitsch and Daniel Weller and Bruno Woltzenlogel Paleo", title = "A {C}lausal {A}pproach to {P}roof {A}nalysis in {S}econd-{O}rder {L}ogic", booktitle = "Logical Foundations of Computer Science (LFCS) 2009", year = "2009", editor = "Sergei Artemov and Anil Nerode", series = "Lecture Notes in Computer Science", volume = "5407", pages = "214--229", publisher = "Springer", } @InProceedings{hetzl12cicm, author = "Stefan Hetzl", title = "{Project Presentation: Algorithmic Structuring and Compression of Proofs (ASCOP)}", booktitle = "Conference on Intelligent Computer Mathematics (CICM) 2012", editor = "J. Jeuring et al.", publisher = "Springer", series = "Lecture Notes in Artificial Intelligence", volume = "7362", year = "2012", pages = "437--441", } @InProceedings{hetzl12csl, author = "Stefan Hetzl and Lutz Stra{\ss}burger", title = "{H}erbrand-{C}onfluence for {C}ut-{E}limination in {C}lassical {F}irst-{O}rder {L}ogic", booktitle = "Computer Science Logic (CSL) 2012", pages = "320--334", series = "Leibniz International Proceedings in Informatics (LIPIcs)", volume = "16", year = "2012", editor = "Patrick C{\'e}gielski and Arnaud Durand", publisher = "Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik", } @InProceedings{hetzl12lata, author = "Stefan Hetzl", title = "{A}pplying {T}ree {L}anguages in {P}roof {T}heory", booktitle = "Language and Automata Theory and Applications (LATA) 2012", editor = "Adrian-Horia Dediu and Carlos Mart{\'i}n-Vide", series = lncs, publisher = "Springer", volume = "7183", pages = "301--312", year = "2012", } @InProceedings{hetzl12lpar, author = "Stefan Hetzl and Alexander Leitsch and Daniel Weller", title = "{T}owards {A}lgorithmic {C}ut-{I}ntroduction", booktitle = "Logic for Programming, Artificial Intelligence and Reasoning (LPAR-18)", publisher = "Springer", series = "Lecture Notes in Computer Science", volume = "7180", pages = "228--242", year = "2012", } @Article{hetzl12ndjfl, author = "Stefan Hetzl", title = "{T}he {C}omputational {C}ontent of {A}rithmetical {P}roofs", journal = "Notre Dame Journal of Formal Logic", year = "2012", volume = "53", number = "3", pages = "289--296", } @Article{hetzl13lmcs, author = "Stefan Hetzl and Lutz Stra{\ss}burger", title = "Herbrand-Confluence", journal = "Logical Methods in Computer Science", volume = "9", number = "4", year = "2013", doi = "10.2168/LMCS-9(4:24)2013", } @InProceedings{heule1313fmcad, author = "Marijn Heule and Warren A. Hunt Jr. and Nathan Wetzler", title = "Trimming while checking clausal proofs", booktitle = "Formal Methods in Computer-Aided Design, {FMCAD} 2013", pages = "181--188", publisher = "{IEEE}", year = "2013", doi = "10.1109/FMCAD.2013.6679408", } @InProceedings{heule15cade, title = "Expressing Symmetry Breaking in {DRAT} Proofs", author = "Marijn Heule and Warren A. Hunt Jr. and Nathan Wetzler", booktitle = "Automated Deduction - CADE-25 - 25th International Conference on Automated Deduction, Berlin, Germany, August 1-7, 2015, Proceedings", publisher = "Springer", year = "2015", volume = "9195", editor = "Amy P. Felty and Aart Middeldorp", pages = "591--606", series = "Lecture Notes in Computer Science", } @InProceedings{heule18aaai, author = "Marijn J. H. Heule", editor = "Sheila A. McIlraith and Kilian Q. Weinberger", title = "Schur Number Five", booktitle = "Proceedings of the Thirty-Second Conference on Artificial Intelligence (AAAI-18)", pages = "6598--6606", publisher = "{AAAI} Press", year = "2018", doi = "10.1609/AAAI.V32I1.12209", } @Article{hewitt77ai, author = "Carl Hewitt", title = "Viewing control structures as patterns of passing messages", journal = "Artifical Intelligence", volume = "8", pages = "323--364", year = "1977", } @Book{hilbert34gm1, author = "D. Hilbert and P. Bernays", title = "Grundlagen der Mathematik {I}", publisher = "Springer Verlag", year = "1934", } @Book{hilbert34gm2, author = "D. Hilbert and P. Bernays", title = "Grundlagen der Mathematik {II}", publisher = "Springer Verlag", year = "1939", } @InCollection{hilbert99, author = "David Hilbert", title = "Grundlagen der Geometrie", booktitle = "Festschrift zur Feier der Enthllung des Gauss-Weber-Denkmals in G{\"o}ttingen", pages = "1--92", publisher = "B.G. Teubner", address = "Leipzig", year = "1899", } @Book{hill94mit, author = "Pat Hill and John Lloyd", title = "The {G}{\"o}del Programming Language", publisher = "MIT Press", year = "1994", } @Article{hindley69ams, author = "R. Hindley", title = "The Principal Type-Scheme of an Object in Combinatory Logic", journal = "Transactions of the American Mathematical Society", year = "1969", volume = "146", pages = "29--60", } @Book{hindley86, author = "J. Roger Hindley and Jonathan P. Seldin", title = "Introduction to Combinatory Logic and Lambda Calculus", publisher = "Cambridge University Press", year = "1986", } @Book{hindley86book, author = "Roger J. Hindley and Jonathan P. Seldin", title = "Introduction to Combinators and Lambda-Calculs", publisher = "Cambridge University Press", address = "Cambridge", year = "1986", } @Article{hintikka00njpl, author = "Jaakko Hintikka", title = "Game-theoretical Semantics as a Challenge to Proof Theory", journal = "Nordic Journal of Philosophical Logic", year = "2000", volume = "4", number = "2", } @Article{hintikka55apf, title = "Form and Content in Quantification Theory", author = "K. J. J. Hintikka", journal = "Acta Philosophica Fennica", volume = "8", pages = "7--55", year = "1955", } @Book{hintikka62book, author = "Jaako Hintikka", title = "Knowledge and Belief: An Introduction into the logic of the two notions", publisher = "Cornell University Press", address = "Ithaca", year = "1962", } @InProceedings{hirschkoff97tphol, author = "Daniel Hirschkoff", title = "A Full Formalization of Pi-Calculus Theory in the {Calculus of Constructions}", editor = "E. Gunter and A. Felty", booktitle = "International Conference on Theorem Proving in Higher Order Logics (TPHOLs'97)", address = "Murray Hill, New Jersey", year = "1997", month = aug, pages = "153--169", series = lncs, number = "1275", } @Unpublished{hirschowitz08corr, title = "Topological Observations on Multiplicative Additive Linear Logic", author = "Andr{\'e} Hirschowitz and Michel Hirschowitz and Tom Hirschowitz", journal = "CoRR", year = "2008", note = "informal publication", URL = "https://arxiv.org/abs/0807.2636", } @Article{hoare69, author = "C. A. R. Hoare", title = "An axiomatic basis for computer programming", journal = "CACM", volume = "12", month = oct, year = "1969", pages = "576--580", } @Book{hoare85csp, author = "C. A. R. Hoare", title = "Communicating Sequential Processes", publisher = "Prentice-Hall", year = "1985", } @InCollection{hoare89cmcs, author = "C. A. R. Hoare", title = "Notes on an Approach to Category Theory for Computer Scientists", booktitle = "Constructive Methods in Computing Science", series = "NATO ASI Series", volume = "F55", editor = "Manfred Broy", address = "Berlin", pages = "245--305", year = "1989", } @InProceedings{hodas01ijcar, author = "Joshua S. Hodas and Naoyuki Tamura", year = "2001", title = "{lolliCop} --- {A} Linear Logic Implementation of a Lean Connection-Method Theorem Prover for First-Order Classical Logic", booktitle = "Proceedings of IJCAR: International Joint Conference on Automated Reasoning", pages = "670--684", editor = "R. Gor\'e and A. Leitsch and T. Nipkow", number = "2083", series = lncs, publisher = "Springer", } @InProceedings{hodas90iclp, title = "Representing Objects in a Logic Programming Language with Scoping Constructs", author = "Joshua Hodas and Dale Miller", year = "1990", booktitle = "1990 International Conference in Logic Programming", month = jun, pages = "511--526", publisher = "MIT Press", editor = "David H. D. Warren and Peter Szeredi", } @InProceedings{hodas91lics, author = "Joshua Hodas and Dale Miller", title = "Logic Programming in a Fragment of Intuitionistic Linear Logic: Extended Abstract", booktitle = lics91, editor = "G. Kahn", address = "Amsterdam", year = "1991", month = jul, pages = "32--42", publisher = "IEEE", } @InProceedings{hodas92jicslp, author = "Joshua Hodas", title = "Specifying Filler-Gap Dependency Parsers in a Linear-Logic Programming Language", booktitle = "Proceedings of the Joint International Conference and Symposium on Logic Programming", editor = "K. Apt", year = "1992", pages = "622--636", } @InProceedings{hodas93welp, title = "Logic Programming with Multiple Context Management Schemes", author = "Joshua S. Hodas", booktitle = welp93, editor = "Roy Dyckhoff", pages = "171--182", series = lnai, number = "798", year = "1993", } @Article{hodas94ic, author = "Joshua Hodas and Dale Miller", title = "Logic Programming in a Fragment of Intuitionistic Linear Logic", journal = "Information and Computation", year = "1994", volume = "110", number = "2", pages = "327--365", doi = "10.1006/inco.1994.1036", } @PhdThesis{hodas94phd, author = "Joshua S. Hodas", title = "Logic Programming in Intuitionistic Linear Logic: Theory, Design, and Implementation", school = "University of Pennsylvania, Department of Computer and Information Science", month = may, year = "1994", } @InProceedings{hodas98jicslp, author = "Joshua Hodas and Kevin Watkins and Naoyuki Tamura and Kyoung-Sun Kang", title = "Efficient Implementation of a Linear Logic Programming Language", booktitle = "{Proceedings of the 1998 Joint International Conference and Symposium on Logic Programming}", editor = "Joxan Jaffar", pages = "145--159", year = "1998", } @InProceedings{hodas99lacl, author = "Joshua S. Hodas", title = "A linear logic treatment of phrase structure grammars for unbounded dependencies", pages = "160--179", booktitle = "Proceedings of the 2nd International Conference on Logical Aspects of Computational Linguistics (LACL-97)", editor = "Alain Lecomte and Fran{\c{c}}oise Lamarche and Guy Perrier", month = sep, series = "LNAI", volume = "1582", publisher = "Springer", address = "Berlin", year = "1999", } @InCollection{hodges04sep, author = "Wilfrid Hodges", title = "Logic and Games", booktitle = "The Stanford Encyclopedia of Philosophy", editor = "Edward N. Zalta", URL = "https://plato.stanford.edu/archives/win2004/entries/logic-games/", year = "2004", publisher = "Stanford University", } @InCollection{hodges13sep, author = "Wilfrid Hodges", title = "Logic and Games", booktitle = "The Stanford Encyclopedia of Philosophy", editor = "Edward N. Zalta", publisher = "Stanford University", URL = "https://plato.stanford.edu/archives/spr2013/entries/logic-games/", year = "2013", edition = "Spring 2013", } @Book{hodges97smt, author = "W. Hodges", title = "A Shorter Model Theory", year = "1997", publisher = "Cambridge University Press", } @Article{hofmann03ic, author = "Martin Hofmann", title = "Linear types and non-size increasing polynomial time computation", journal = "Information and Computation", year = "2003", volume = "183", number = "1", pages = "57--85", } @InProceedings{hofmann99lics, author = "Martin Hofmann", title = "Semantical analysis of higher-order abstract syntax", booktitle = lics99, pages = "204--213", year = "1999", publisher = "IEEE Computer Society Press", } @TechReport{holte06tr, author = "Steven Holte and Gopalan Nadathur", title = "Modularity and Separate Compilation in Logic Programming", institution = "University of Minnesota", number = "DTC Research Report 2006/19", month = nov, year = "2006", } @InProceedings{honda91ecoop, author = "K.~Honda and M.~Tokoro", title = "An object calculus for asynchronous communication", booktitle = "Proc. of ECOOP'91", editor = "P.~America", volume = "512", series = lncs, year = "1991", publisher = "Springer", pages = "133--147", } @InProceedings{honsell01icalp, author = "Furio Honsell and Marino Miculan and Ivan Scagnetto", title = "An axiomatic approach to metareasoning on systems in higher-order abstract syntax", booktitle = "Proc. ICALP'01", pages = "963--978", year = "2001", number = "2076", series = lncs, publisher = "Springer", } @Article{honsell01tcs, author = "Furio Honsell and Marino Miculan and Ivan Scagnetto", title = "$\pi$-calculus in (Co)Inductive Type Theories", journal = "Theoretical Computer Science", year = "2001", volume = "2", number = "253", pages = "239--285", doi = "10.1016/S0304-3975(00)00095-5", } @Article{honsell02ic, author = "Furio Honsell and Donald Sannella", title = "Prelogical relations", journal = "Information and Computation", volume = "178", number = "1", year = "2002", pages = "23--43", publisher = "Academic Press, Inc.", } @InProceedings{honsell12lfmtp, author = "Furio Honsell and Marina Lenisa and Luigi Liquori and Petar Maksimovic and Ivan Scagnetto", title = "{LFP}: a logical framework with external predicates", doi = "10.1145/2364406.2364409", booktitle = "LFMTP 2012: Proceedings of the seventh international workshop on Logical frameworks and meta-languages, theory and practice", editor = "Adam Chlipala and Carsten Sch{\"u}rmann", pages = "13--22", year = "2012", publisher = "ACM New York", } @InProceedings{honsell93mfcs, author = "F. Honsell and M. Lenisa", title = "Some results on the full abstraction problem for restricted lambda calculi", booktitle = "Proceedings of Mathematical Foundations of Computer Science (MFCS '93)", editor = "Andrzej M. Borzyszkowski and Stefan Sokolowski", publisher = "Springer", year = "1993", series = lncs, volume = "711", pages = "84--104", } @Article{honsell95ic, title = "A Variable Typed Logic of Effects", author = "Furio Honsell and Ian A. Mason and Scott Smith and Carolyn Talcott", pages = "55--90", journal = "Information and Computation", month = may, year = "1995", volume = "119", number = "1", } @InProceedings{honsell98, author = "F.~Honsell and M.~Lenisa and U.~Montanari and M.~Pistore", title = "Final semantics for the $\pi$-calculus", booktitle = "Proc.~of PROCOMET'98", year = "1998", } @InProceedings{honsell99csl, author = "Furio Honsell and Donald Sannella", title = "Pre-logical relations", booktitle = "Proceedings of Computer Science Logic (CSL'99)", pages = "546--561", year = "1999", volume = "1683", series = lncs, publisher = "Springer", } @Article{honsell99mscs, author = "Furio Honsell and Marina Lenisa", title = "Coinductive Characterizations of Applicative Structures", journal = "Mathematical Structures in Computer Science", year = "1999", volume = "9", pages = "403--435", } @Unpublished{hook88, author = "James Hook and Garrel Pottinger", title = "Ulysses Theories: The Modular Implementation of Mathematics", month = jul, year = "1988", note = "Draft", } @TechReport{horn88, author = "Christian Horn", title = "Interactive Program and Proof Development with Nur{PRL}", institution = "Humboldt University", address = "Berlin", month = apr, year = "1988", } @Article{horne19mscs, title = "Constructing weak simulations from linear implications for processes with private names", volume = "29", doi = "10.1017/S0960129518000452", number = "8", journal = "Mathematical Structures in Computer Science", publisher = "Cambridge University Press", author = "Ross Horne and Alwen Tiu", year = "2019", pages = "1275--1308", } @InProceedings{horne23places, author = "Ross Horne and Luca Padovani", editor = "Ilaria Castellani and Alceste Scalas", title = "A Logical Account of Subtyping for Session Types", booktitle = "Proc.~ 14th Workshop on Programming Language Approaches to Concurrency and Communication-cEntric Software, PLACES 2023", series = "{EPTCS}", volume = "378", pages = "26--37", year = "2023", doi = "10.4204/EPTCS.378.3", } @InCollection{howard80, author = "William A. Howard", title = "The formulae-as-type notion of construction, 1969", editor = "J. P. Seldin and R. Hindley", booktitle = "To H. B. Curry: Essays in Combinatory Logic, Lambda Calculus, and Formalism", pages = "479--490", publisher = "Academic Press", address = "New York", year = "1980", } @InCollection{howard96icfp, author = "Brian T. Howard", title = "Inductive, Coinductive, and Pointed Types", booktitle = "Proceedings 1st ACM SIGPLAN Int.\ Conf.\ on Functional Programming, ICFP'96, Philadelphia, PA, USA, 24--26 May 1996", series = "SIGPLAN Notices 31(6)", publisher = "ACM Press", address = "New York", year = "1996", pages = "102--109", URL = "https://www.cis.ksu.edu/~bhoward/ftp/icfp.dvi.Z", } @InProceedings{howe88cade, author = "Douglas J. Howe", title = "Computational Metatheory in {Nuprl}", booktitle = "9th {International Conference on Automated Deduction, Argonne, Illinois}", editor = "Ewing Lusk and Ross Overbeek", publisher = "Springer", series = lncs, volume = "310", address = "Berlin", month = may, year = "1988", pages = "238--257", } @InProceedings{howe91, author = "D. Howe", title = "On Computational Open-Endedness in {Martin-L\"{o}f's} Type Theory", booktitle = lics91, publisher = "{ACM} Press", pages = "162--172", year = "1991", } @Article{howe96ic, title = "Proving Congruence of Bisimulation in Functional Programming Languages", author = "Douglas J. Howe", pages = "103--112", journal = "Information and Computation", year = "1996", volume = "124", number = "2", } @PhdThesis{howe98phd, title = "Proof {S}earch {I}ssues in {S}ome {N}on-{C}lassical {L}ogics", author = "Jacob M. Howe", note = "Available as University of St Andrews Research Report CS/99/1", month = dec, year = "1998", school = "University of St Andrews", } @InProceedings{huang94cade, author = "Xiaorong Huang", editor = "Alan Bundy", title = "Reconstructing Proofs at the Assertion Level", booktitle = "Proceedings of the 12th Conference on Automated Deduction", publisher = "Springer", pages = "738--752", address = "Nancy, France", series = lnai, number = "814", year = "1994", URL = "https://js-sfbsun.cs.uni-sb.de/pub/www/deduktion.html", } @InProceedings{huang94coling, author = "Xiaorong Huang", title = "Planning Argumentative Texts", booktitle = "Proceedings of 15th COLING", pages = "329--333", address = "Kyoto, Japan", year = "1994", URL = "https://js-sfbsun.cs.uni-sb.de/pub/www/deduktion.html", } @InProceedings{huang94dcss, author = "Xiaorong Huang", editor = "Ashwin Ram and Kurt Eiselt", title = "Proverb: {A} System Explanining Machine-Found Proofs", booktitle = "Proceedings of 16th Annual Conference of the Cognitive Science Society", publisher = "Lawrence Erlbaum Associates", pages = "427--432", series = "", address = "Atalanta, USA", year = "1994", annote = "ISBN 0-8058-1803-0,ISSN 1047-1316", URL = "https://js-sfbsun.cs.uni-sb.de/pub/www/deduktion.html", } @InProceedings{huang94iwg, author = "Xiaorong Huang", editor = "", title = "Planning Reference Choices for Argumentative Texts", booktitle = "Proceedings of 7th IWG", publisher = "", pages = "145--152", series = "", address = "Kennebunkport, Maine, USA", year = "1994", URL = "https://js-sfbsun.cs.uni-sb.de/pub/www/deduktion.html", } @PhdThesis{huang94tr, author = "Xiaorong Huang", title = "Human Oriented Proof Presentation: {A} Reconstructive Approach", school = "Fachbereich Informatik, Universit{\"a}t des Saarlandes", year = "1994", address = "Saarbr{\"u}cken, Germany", URL = "https://js-sfbsun.cs.uni-sb.de/pub/www/deduktion.html", } @PhdThesis{hudelmaier89phd, author = "J{\"o}rg Hudelmaier", title = "Bounds for cut elimination in intuitionistic propositional logic", school = "University of T{\"u}bingen", address = "T{\"u}bingen", year = "1989", } @Article{hudelmaier92aml, author = "J{\"o}rg Hudelmaier", title = "Bounds on Cut-Elimination in Intuitionistic Propositional Logic", journal = "Archive for Mathematical Logic", year = "1992", volume = "31", pages = "331--353", } @InCollection{hudelmaier99semantical, author = "J. Hudelmaier", editor = "S. Barry Cooper and John K. Truss", title = "A Semantical Calculus for Intuitionistic Propositional Logic", booktitle = "Sets and Proofs", publisher = "Cambridge University Press", year = "1999", pages = "73--94", doi = "10.1017/CBO9781107325944.006", } @Unpublished{hudelmaierXXbicomp, author = "J{\"o}rg Hudelmaier", title = "Bicomplete calculi for intuitionistical propositional logic", note = "Aufsatz (Essay). Universit{\"a}t T{\"u}bingen. Available from \url{https://www-pu.informatik.uni-tuebingen.de/logik/joerg/bicomp.ps}", } @Unpublished{hudelmaierxxbicomp, author = "J{\"o}rg Hudelmaier", title = "Bicomplete calculi for intuitionistical propositional logic", note = "Aufsatz (Essay). Universit{\"a}t T{\"u}bingen. Available from \url{https://www-pu.informatik.uni-tuebingen.de/logik/joerg/bicomp.ps}", } @InProceedings{huet02tphols, author = "G\'erard P. Huet", title = "Higher Order Unification 30 Years Later", year = "2002", editor = "Victor Carre{\~n}o and C{\'e}sar Mu{\~n}oz and Sofi{\`e}ne Tahar", booktitle = "TPHOLs: 15th International Conference on Theorem Proving in Higher Order Logics", publisher = "Springer", series = lncs, volume = "2410", pages = "3--12", } @PhdThesis{huet72phd, author = "G\'{e}rard P. Huet", school = "Case Western Reserve University", title = "Constrained Resolution: {A} Complete Method for Higher Order Logic", year = "1972", } @Article{huet73ic, author = "G\'erard Huet", title = "The Undecidability of Unification in Third Order Logic", journal = "Information and Control", volume = "22", pages = "257--267", year = "1973", } @InProceedings{huet73ijcai, author = "G\'{e}rard P. Huet", booktitle = "Proceedings of the 3rd International Joint Conference on Artificial Intelligence", year = "1973", pages = "139--146", title = "A Mechanization of Type Theory", publisher = "William Kaufmann", } @Article{huet75tcs, author = "G\'erard P. Huet", title = "A Unification Algorithm for Typed $\lambda$-Calculus", journal = "Theoretical Computer Science", volume = "1", year = "1975", pages = "27--57", doi = "10.1016/0304-3975(75)90011-0", } @PhdThesis{huet76phd, author = "G{\'e}rard Huet", title = "{R}\'e\-so\-lu\-tion d'\'equa\-tions dans les langages d'ordre $1,2,\ldots,\omega$", type = "Th\`e\-se de doctorat d'\'e\-tat", school = "Universit\'e Paris~7", year = "1976", } @Article{huet78, author = "G\'erard Huet and Bernard Lang", title = "Proving and Applying Program Transformations Expressed with Second-Order Patterns", journal = "Acta Informatica", volume = "11", year = "1978", pages = "31--55", } @Misc{huet79rtaprob, author = "G\'erard Huet", title = "{RTA} Problem \#94", year = "1979", URL = "https://www.lsv.ens-cachan.fr/rtaloop/problems/94.html", } @InCollection{huet80, author = "G. Huet and D. Oppen", title = "Equations and Rewrite Rules: {A} Survey", booktitle = "Formal Language Theory: Perspectives and Open Problems", editor = "R. Book", publisher = "Academic Press", pages = "349--405", year = "1980", } @Unpublished{huet86, author = "G\'erard Huet", title = "Formal Structures for Computation and Deduction", month = may, year = "1986", note = "Lecture notes.", URL = "https://yquem.inria.fr/~huet/PUBLIC/Formal_Structures.ps.gz", } @InProceedings{huet87, author = "G\'erard Huet", title = "A Uniform Approach to Type Theory", booktitle = "Proceedings of the Institute on Logical Foundations of Functional Programming", address = "Austin, Texas", month = jun, year = "1987", note = "To appear", } @TechReport{huet89inria, author = "G\'erard Huet", title = "The Construction Engine", number = "Rapports Techniques 110", institution = "INRIA/Rocquencourt", month = aug, year = "1989", } @TechReport{huet90bra, author = "G{\'e}rard Huet", title = "{BRA} Workshop Proceedings on Logical Frameworks", number = "Electronically distributed", institution = "INRIA/Rocquencourt", month = aug, year = "1990", } @InProceedings{hughes03lics, author = "Dominic J. D. Hughes and Rob J.~van Glabbeek", title = "Proof Nets for unit-free Multiplicative-Additive Linear Logic ({E}xtended abstract)", booktitle = "Proc.\ IEEE Logic in Computer Science", year = "2003", URL = "https://boole.stanford.edu/~dominic/papers/mallnets/mallnets-lics.pdf", } @Article{hughes05tocl, author = "Dominic Hughes and Rob Van Glabbeek", title = "Proof Nets for Unit-Free Multiplicative-Additive Linear Logic", journal = tocl, volume = "6", year = "2005", pages = "784--842", URL = "https://doi.acm.org/10.1145/1094622.1094629", doi = "10.1145/1094622.1094629", } @Unpublished{hughes05tr, author = "Dominic J. D. Hughes", title = "A classical sequent calculus free of structural rules", year = "2005", month = jun, note = "Submitted. Archived as math.LO/0506463 at arXiv.org.", } @Article{hughes06am, author = "Dominic J. D. Hughes", title = "Proofs Without Syntax", journal = "Annals of {M}athematics", year = "2006", month = nov, volume = "143", number = "3", pages = "1065--1076", } @Article{hughes06wollic, author = "Dominic J. D. Hughes", title = "Towards Hilbert's 24$^{\mbox{th}}$ Problem: Combinatorial Proof Invariants: (Preliminary version)", journal = "Electr. Notes Theor. Comput. Sci.", volume = "165", year = "2006", pages = "37--63", doi = "10.1016/j.entcs.2006.05.036", } @InProceedings{hughes07padl, title = "QuickCheck Testing for Fun and Profit", author = "John Hughes", booktitle = "Practical Aspects of Declarative Languages, 9th International Symposium, PADL 2007, Nice, France, January 14-15, 2007", publisher = "Springer", year = "2007", series = lncs, volume = "4354", editor = "Michael Hanus", pages = "1--32", } @Book{hughes68, author = "G. E. Hughes and M. J. Cresswell", title = "An Introduction to Modal Logic", publisher = "Methuen", address = "London", year = "1968", } @Book{hughes84, author = "G. E. Hughes and M. J. Cresswell", title = "A Companion to Modal Logic", publisher = "Methuen", address = "London", year = "1984", } @Article{hughes89cj, author = "John Hughes", title = "Why functional programming matters", journal = "The Computer Journal", volume = "32", number = "2", month = apr, year = "1989", pages = "98--107", publisher = "Cambridge University Press", } @InCollection{hughes90rtfp, author = "J. Hughes", title = "Why Functional Programming Matters", chapter = "2", pages = "17--42", editor = "D. A. Turner", booktitle = "Research Topics in Functional Programming", series = "UT Year of Programming Series", publisher = "Addison-Wesley", year = "1990", } @InProceedings{huibonhoa92lpw, author = "Alain Hui Bon Hoa", title = "Some Kind of Magic for a Restriction of ${L}_\lambda$", booktitle = "Proceedings of the 1992 $\lambda$Prolog Workshop", year = "1992", month = jul, editor = "Dale Miller", } @InProceedings{huibonhoa92plilp, author = "Alain Hui Bon Hoa", title = "A Bottom-Up Interpreter for a Higher-Order Logic Programming Language", booktitle = "Proceedings of PLILP'92", year = "1992", month = aug, publisher = "Spinger Verlag", } @InProceedings{huibonhoa94tacs, author = "Alain Hui Bon Hoa", title = "Intuitionistic Resolution for a Logic Programming Language with Scoping Constructs", booktitle = "Proceedings of TACS'94", year = "1994", } @InProceedings{huitouze93iclp, author = "Serge Le Huitouze anfd Pascale Louvet and Olivier Ridoux", title = "Logic Grammars and $\lambda${P}rolog", booktitle = "Proceedings of the Tenth International Conference on Logic Programming", year = "1993", editor = "David S. Warren", publisher = "MIT Press", pages = "64--79", } @InProceedings{hur13popl, author = "Chung-Kil Hur and Georg Neis and Derek Dreyer and Viktor Vafeiadis", title = "The Power of Parameterization in Coinductive Proof", booktitle = "ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL)", year = "2013", pages = "193--206", publisher = "ACM", } @Article{hurd03nasa, title = "First-order proof tactics in higher-order logic theorem provers", author = "Joe Hurd", journal = "Design and Application of Strategies/Tactics in Higher Order Logics, number NASA/CP-2003-212448 in NASA Technical Reports", pages = "56--68", year = "2003", } @InProceedings{hurd11nfm, author = "Joe Hurd", title = "The {OpenTheory} standard theory library", booktitle = "The Third International Symposium on NASA Formal Methods", pages = "177--191", year = "2011", editor = "Mihaela Gheorghiu Bobaru and Klaus Havelund and Gerard J. Holzmann and Rajeev Joshi", number = "6617", series = lncs, } @Article{hyland00ic, author = "J. M. E. Hyland and C.-H. L. Ong", title = "On Full Abstraction for {PCF}: {I}. Models, observables and the full abstraction problem, {II}. Dialogue games and innocent strategies, {III}. {A} fully abstract and universal game model", journal = "Information and Computation", year = "2000", volume = "163", pages = "285--408", } @InCollection{hyland08acmr, author = "Martin Hyland", editor = "O. Grumberg and T. Nipkow and C. Pfaller", booktitle = "Formal and Logical methods for System Security and Correctness", title = "Abstract and Concrete Models for Recursion", publisher = "IOS Press", year = "2008", pages = "175--197", } @Article{hyland93apal, title = "Full intuitionistic linear logic (extended abstract)", author = "Martin Hyland and Valeria de Paiva", pages = "273--291", journal = "Annals of Pure and Applied Logic", month = nov, year = "1993", volume = "64", number = "3", } @Article{ilik10apal, author = "Danko Ilik and Gyesik Lee and Hugo Herbelin", title = "Kripke Models for Classical Logic", journal = apal, year = "2010", volume = "161", number = "11", pages = "1367--1378", } @InProceedings{ilik14csllics, author = "Danko Ilik", title = "Axioms and Decidability for Type Isomorphism in Presence of Sums", doi = "10.1145/2603088.2603115", booktitle = "Proceedings 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})", year = "2014", editor = "Tom Henzinger and Dale Miller", } @Unpublished{ilik16tra, title = "{On the exp-log normal form of types}", author = "Danko Ilik", URL = "https://hal.inria.fr/hal-01167162", note = "working paper or preprint", year = "2016", month = Aug, keywords = "type isomorphism ; sum types ; lambda calculus", pdf = "https://hal.inria.fr/hal-01167162/file/explog.pdf", hal_id = "hal-01167162", hal_version = "v2", } @Unpublished{ilik16trb, title = "{Perspectives for proof unwinding by programming languages techniques}", author = "Danko Ilik", URL = "https://hal.inria.fr/hal-01354180", note = "working paper or preprint", year = "2016", month = Aug, pdf = "https://hal.inria.fr/hal-01354180/file/KGS-book-chapter-danko.pdf", hal_id = "hal-01354180", hal_version = "v1", } @Article{ilik17jal, title = "{Perspectives for proof unwinding by programming languages techniques}", author = "Danko Ilik", URL = "https://hal.inria.fr/hal-01354180", journal = "{IfColog Journal of Logics and their Applications (FLAP)}", publisher = "{College Publications}", volume = "4", number = "10", pages = "3487--3508", year = "2017", month = Nov, pdf = "https://hal.inria.fr/hal-01354180/file/KGS-book-chapter-danko.pdf", hal_id = "hal-01354180", hal_version = "v1", } @Book{indrzejczak21book, author = "Andrzej Indrzejczak", title = "Sequents and Trees: An Introduction to the Theory and Applications of Propositional Sequent Calculi", publisher = "Birkh{\"{a}}user", year = "2021", series = "Studies in Universal Logic", } @Article{ishtiaq98jlc, author = "S. S. Ishtiaq and D. J. Pym", title = "A Relevant Analysis of Natural Deduction", journal = jlc, year = "1998", volume = "8", number = "6", month = dec, pages = "809--838", } @Misc{iso00prolog2, author = "{ISO.org}", title = "{ISO/IEC 13211-2:2000}: Information technology --- Programming languages --- {Prolog} --- Part 2: Modules", publisher = "International Organization for Standardization", year = "2000", URL = "https://www.iso.org/standard/20775.html", } @TechReport{jacobs92tr, author = "Ian Jacobs and Laurence Rideau", title = "A {Centaur} Tutorial", year = "1992", type = "Programme 2: Calcul symbolique, Programmation et G\'enie logiciel", number = "141", month = aug, institution = "INRIA-Sophia Antipolis", URL = "https://hal.inria.fr/inria-00070028/en/", } @Article{jacobs94apal, author = "Bart Jacobs", title = "Semantics of weakening and contraction", journal = apal, year = "1994", volume = "69", pages = "73--106", } @Article{jacobs97beatcs, author = "Bart Jacobs and Jan Rutten", title = "A Tutorial on (Co)Algebras and (Co)Induction", journal = "Bulletin of the European Association for Theoretical Computer Science", volume = "62", pages = "222--259", month = jun, year = "1997", URL = "https://www.cs.kun.nl/~bart/PAPERS/JR.ps.Z", note = "Surveys and Tutorials", } @InCollection{jacobs97tapsoft, key = "Jacobs", author = "Bart Jacobs", title = "Behavior-Refinement of Coalgebraic Specifications with Coinductive Correctness Proofs", booktitle = "{TAPSOFT '97}: Theory and Practice of Software Development, 7th International Joint Conference {CAAP/FASE}, Lille, France", publisher = "Springer", year = "1997", editor = "Michel Bidoit and Max Dauchet", series = lncs, volume = "1214", pages = "787--802", address = "New York, NY", annote = "25 references.", } @InCollection{jaeger93als, author = "G. Jaeger", title = "Some proof-theoretic aspects of logic programming", booktitle = "Algebra and Logic of Specification", editor = "J. E. Fenstad and I. T. Frolov and R. Hilpinen", year = "1993", publisher = "Springer, Berlin", } @InProceedings{jaffar04rtss, author = "Joxan Jaffar and Andrew E. Santosa and Razvan Voicu", title = "A {CLP} Proof Method for Timed Automata", booktitle = "RTSS", year = "2004", pages = "175--186", publisher = "IEEE Computer Society", URL = "https://doi.ieeecomputersociety.org/10.1109/REAL.2004.5", } @InProceedings{jaffar87popl, author = "J. Jaffar and J.-L. Lassez", title = "Constraint Logic Programming", booktitle = "Proceedings of the 14th ACM Symposium on the Principles of Programming Languages", year = "1987", publisher = "ACM", } @InProceedings{jagadeesan05fsttcs, author = "Radha Jagadeesan and Gopalan Nadathur and Vijay Saraswat", title = "Testing concurrent systems: An interpretation of intuitionistic logic", editor = "R. Ramanujam and S. Sen", booktitle = fsttcs05, address = "Hyderabad, India", year = "2005", publisher = "Springer", series = lncs, volume = "3821", pages = "517--528", } @Article{jankov68izvestiya, author = "V. A. Jankov", title = "The Calculus of the Weak Law of Excluded Middle", journal = "Mathematics of the USSR - Izvestiya", year = "1968", volume = "2", number = "5", pages = "997--1004", } @InProceedings{jayaraman91iclp, author = "Bharat Jayaraman and Gopalan Nadathur", title = "Implementation Techniques for Scoping Constructs in Logic Programming", editor = "Koichi Furukawa", booktitle = "Eighth International Logic Programming Conference", address = "Paris, France", publisher = "MIT Press", pages = "871--886", month = jun, year = "1991", } @Article{jensen76tcs, author = "D. C. Jensen and Tomasz Pietrzykowski", title = "Mechanizing {\it omega}-Order Type Theory Through Unification", journal = "Theor. Comput. Sci.", volume = "3", number = "2", year = "1976", pages = "123--171", doi = "10.1016/0304-3975(76)90021-9", } @Book{johnson1975yacc, title = "Yacc: Yet another compiler-compiler", author = "Stephen C Johnson", volume = "32", year = "1975", publisher = "Bell Laboratories Murray Hill, NJ", } @InProceedings{johnson85fpca, author = "T. Johnson", title = "Lambda Lifting: Transforming Programs to Recursive Equations", booktitle = "Proceedings of Functional Programming Languages and Computer Architecture", publisher = "Springer", series = lncs, volume = "201", year = "1985", } @InCollection{johnson91, author = "Mark Johnson", title = "Techniques for Deductive Parsing", booktitle = "Natural Language Understanding and Logic Programming, III", publisher = "Elsevier", year = "1991", editor = "C. G. Brown and G. Koch", } @Book{jones80, editor = "N. Jones", title = "Semantics-Directed Compiler Generation", publisher = "Springer", series = lncs, volume = "94", year = "1980", } @InProceedings{jones85, author = "N. Jones and P. Sestoft and H. S{\o}ndergaard", title = "An Experiment in Partial Evaluation: The Generation of a Compiler Generator", booktitle = "Proceedings of the First International Conference on Rewriting Techniques", publisher = "Springer", series = lncs, volume = "202", pages = "124--140", year = "1985", } @InProceedings{jones87vdm, author = "C. B. Jones", title = "{VDM} Proof Obligations and their Justification", booktitle = "{VDM} 1987 -- A Formal Method at Work", year = "1987", editor = "D. {Bj\o rner} and C. B. Jones and M. {Mac an Airchinnigh} and E. J. Neuhold", volume = "252", pages = "260--286", series = "LNCS", publisher = "Springer-Verlag", doi = "10.1007/3-540-17654-3\_15", } @InProceedings{jouannaud99lics, author = "Jean-Pierre Jouannaud and Albert Rubio", title = "The Higher-Order Recursive Path Ordering", booktitle = lics99, pages = "402--411", year = "1999", publisher = "IEEE Computer Society Press", } @InProceedings{jourdan12esop, author = "Jacques-Henri Jourdan and Fran{\c{c}}ois Pottier and Xavier Leroy", editor = "Helmut Seidl", title = "Validating {LR}(1) Parsers", booktitle = "Programming Languages and Systems", year = "2012", publisher = "Springer Berlin Heidelberg", address = "Berlin, Heidelberg", pages = "397--416", } @InProceedings{jouvelot91popl, title = "Algebraic Reconstruction of Types and Effects", author = "Pierre Jouvelot and David K. Gifford", pages = "303--310", booktitle = "Conference Record of the Eighteenth Annual ACM Symposium on Principles of Programming Languages", month = jan, year = "1991", address = "Orlando, Florida", publisher = "ACM", } @Article{joyal81am, author = "Andr\'e Joyal", title = "Une th\'eorie comminatoire des s\'eries formelles", journal = "Advances in Mathematics", year = "1981", volume = "42", pages = "1--82", } @Article{kahle06synthese, author = "R. Kahle and P. Schroeder-Heister", title = "Introduction to Proof Theoretic Semantics", journal = "Special issue of Synthese", year = "2006", volume = "148", } @Book{kahn84, editor = "G. Kahn and D. B. MacQueen and G. Plotkin", title = "Semantics of Data Types", publisher = "Springer", series = lncs, volume = "173", note = "(several papers from this volume also appear revised in {\em Information and Computation}, 76(2/3), 1988)", year = "1984", } @InProceedings{kahn87stacs, author = "Gilles Kahn", title = "Natural Semantics", booktitle = "Proceedings of the Symposium on Theoretical Aspects of Computer Science", editor = "Franz-Josef Brandenburg and Guy Vidal-Naquet and Martin Wirsing", publisher = pub-sv, month = mar, year = "1987", pages = "22--39", series = lncs, volume = "247", doi = "10.1007/BFb0039592", } @InProceedings{kaiser17fscd, title = "Relating System {F} and $\lambda$2: {A} Case Study in {Coq}, {Abella} and {Beluga}", author = "Jonas Kaiser and Brigitte Pientka and Gert Smolka", booktitle = "{FSCD 2017 - 2nd International Conference on Formal Structures for Computation and Deduction}", address = "Oxford, UK", year = "2017", editor = "Dale Miller", month = Sep, doi = "10.4230/LIPIcs.FSCD.2017.21", pages = "21:1--21:19", } @InCollection{kaliszyk13cade, title = "{PR}oc{H}: Proof reconstruction for {HOL} light", author = "Cezary Kaliszyk and Josef Urban", booktitle = cade13, pages = "267--274", year = "2013", publisher = "Springer", } @Article{kanovich14jscc, author = "Max I. Kanovich", title = "Multiset rewriting over Fibonacci and Tribonacci numbers", journal = "Journal of Computer and System Sciences", year = "2014", volume = "80", pages = "1138--1151", doi = "https://dx.doi.org/10.1016/j.jcss.2014.04.006", } @Article{kanovich16mscs, author = "Max Kanovich", title = "The undecidability theorem for the Horn-like fragment of linear logic (Revisited)", journal = "Mathematical Structures in Computer Science", year = "2016", volume = "26", pages = "719--744", doi = "10.1017/S0960129516000049", } @Article{kanovich19mscs, title = "Subexponentials in non-commutative linear logic", volume = "29", doi = "10.1017/S0960129518000117", number = "8", journal = "Mathematical Structures in Computer Science", publisher = "Cambridge University Press", author = "Max Kanovich and Stepan Kuznetsov and Vivek Nigam and Andre Scedrov", year = "2019", pages = "1217--1249", } @InProceedings{kanovich92lics, author = "Max Kanovich", title = "Horn programming in linear logic is {NP-complete}", booktitle = lics92, pages = "200--210", year = "1992", month = jun, publisher = "IEEE Computer Society Press", } @Article{kanovich94apal, author = "Max Kanovich", title = "The complexity of {Horn} fragments of linear logic", journal = apal, year = "1994", volume = "69", pages = "195--241", } @TechReport{kanovich94tr, author = "Max I. Kanovich", title = "Simulating Linear Logic with 1-Linear Logic", institution = "Laboratoire de Math{\'e}matiques Discr{\`e}tes, University of Marseille", year = "1994", number = "94-02", type = "Preprint", } @InCollection{kanovich95all, author = "Max I. Kanovich", title = "The Direct Simulation of {M}insky Machines in Linear Logic", booktitle = "Advances in Linear Logic", editor = "J.-Y. Girard and Y. Lafont and L. Regnier", year = "1995", pages = "123--145", publisher = "Cambridge University Press", note = "Proceedings of the Workshop on Linear Logic, Ithaca, New York, June 1993", } @Article{kanovich95apal, title = "Petri Nets, {Horn} programs, {Linear} {Logic} and vector games", author = "Max I. Kanovich", pages = "107--135", journal = apal, year = "1995", volume = "75", number = "1--2", doi = "10.1017/S0960129500001328", } @Article{kanovich96apal, author = "Max I. Kanovich", title = "Linear logic automata", journal = "Annals of Pure and Applied Logic", year = "1996", volume = "78", pages = "147--188", doi = "https://doi.org/10.1016/0168-0072(95)00035-6", } @InProceedings{kanovich98cotic, author = "M. I. Kanovich and M. Okada and A. Scedrov", title = "Specifying Real-Time Finite-State Systems in Linear Logic", booktitle = "Second International Workshop on Constraint Programming for Time-Critical Applications and Multi-Agent Systems (COTIC)", year = "1998", address = "Nice, France", month = sep, note = "Also appears in the {\em Electronic Notes in Theoretical Computer Science}, Volume 16 Issue 1 (1998) 15 pp", } @InProceedings{keller10msfp, title = "Hereditary Substitutions for Simple Types, Formalized", author = "Chantal Keller and Thorsten Altenkirch", booktitle = "Proceedings of the 3rd ACM SIGPLAN Workshop on Mathematically Structured Functional Programming, MSFP@ICFP 2010, Baltimore, MD, USA, September 25, 2010", publisher = "ACM", year = "2010", editor = "Venanzio Capretta and James Chapman", ISBN = "978-1-4503-0255-5", pages = "3--10", } @Article{kesner96ic, author = "Delia Kesner and Laurence Puel", title = "A typed pattern calculus", journal = "Information and Computation", volume = "124", number = "1", year = "1996", pages = "32--61", publisher = "Academic Press, Inc.", } @Book{ketonen22book, author = "Oiva Ketonen", editors = "Sara Negri and Jan {von Plato}", title = "Investigations into the Predicate Calculus", publisher = "College Publications", year = "2022", note = "Ed.\ by S. Negri and J. von Plato", } @Article{ketonen44, author = "Oiva Ketonen", title = "Untersuchungen zum Pr{\"a}dikatenkalkul", journal = "Annales Academiae Scientiarum Fennicae, series A, I. Mathematica-physica 23", publisher = "Springer, Berlin", year = "1944", } @InProceedings{kikuchi08fossacs, author = "Kentaro Kikuchi and {St\'ephane} Lengrand", title = "Strong Normalisation of Cut-Elimination that Simulates {\(\beta\)}-Reduction", booktitle = "11th International Conference on Foundations of Software Science and Computation Structures (FOSSACS'08)", editor = "Roberto Amadio", publisher = "Springer", series = lncs, volume = "4962", month = mar, year = "2008", address = "Budapest, Hungary", pages = "380--394", URL = "https://www.lix.polytechnique.fr/~lengrand/Work/Reports/FOSSACS08.pdf", } @InProceedings{kiniry05vstte, author = "Joseph. R. Kiniry and Patrice Chalin and Cl\'ement Hurlin", title = "Integrating Static Checking and Interactive Verification: Supporting Multiple Theories and Provers in Verification", booktitle = "VSTTE'05, Proceedings of Verified Software: Theories, Tools, Experiements", pdf = "https://mobius.inria.fr/twiki/pub/Publications/WebHome/KiniryChalinHurlin_VSTTE05.pdf", year = "2005", address = "Zurich, Switzerland", month = oct, } @InCollection{kirchner14lc, author = "Claude Kirchner and H\'el\`ne Kirchner", title = "Equational logic and rewriting", booktitle = "Logic and Computation", publisher = "North Holland", year = "2014", editor = "J. Siekmann", volume = "9", pages = "255--282", series = "Handbook of the History of Logic", ISBN = "978-0-444-51624-4", } @Article{kleene35ajm1, author = "Stephen Cole Kleene", journal = "American Journal of Mathematics", pages = "153--173", title = "A theory of positive integers in formal logic, Part {I}", volume = "57", year = "1935", } @Article{kleene35ajm2, author = "Stephen Cole Kleene", journal = "American Journal of Mathematics", pages = "219--244", title = "A theory of positive integers in formal logic, Part {II}", volume = "57", year = "1935", } @Book{kleene52, author = "Stephen Cole Kleene", title = "Introduction to Metamathematics", publisher = "North-Holland", address = "Amsterdam", year = "1952", } @Article{kleene52ams, author = "Stephen Cole Kleene", title = "Permutability of Inferences in {Gentzen's} Calculi {LK} and {LJ}", journal = "Memoirs of the American Mathematical Society", volume = "10", pages = "1--26", year = "1952", } @Book{kleene67, author = "Stephen Cole Kleene", title = "Mathematical Logic", publisher = "John Wiley $\&$ Sons, Inc.", year = "1967", } @Book{kleene68book, author = "S. C. Kleene", title = "Mathematical Logic", publisher = "Wiley and Sons", year = "1968", } @InProceedings{klein09sosp, author = "Gerwin Klein and Kevin Elphinstone and Gernot Heiser and June Andronick and David Cock and Philip Derrin and Dhammika Elkaduwe and Kai Engelhardt and Rafal Kolanski and Michael Norrish and Thomas Sewell and Harvey Tuch and Simon Winwood", title = "se{L4}: Formal verification of an {OS} kernel", booktitle = "Proceedings of the 22nd Symposium on Operating Systems Principles (22nd SOSP'09), Operating Systems Review (OSR)", pages = "207--220", publisher = "ACM SIGOPS", address = "Big Sky, MT", month = oct, year = "2009", } @InProceedings{kobayashi93ilps, author = "Naoki Kobayashi and Akinori Yonezawa", booktitle = "Logic {Programming} - {Proceedings of the 1993 International Symposium}", title = "{ACL} - {A} Concurrent Linear Logic Programming Paradigm", editor = "Dale Miller", pages = "279--294", month = oct, year = "1993", publisher = "MIT Press", } @InProceedings{kobayashi94oopsla, author = "Naoki Kobayashi and Akinori Yonezawa", title = "Type-Theoretic Foundations for Concurrent Object-Oriented Programming", booktitle = "Proceedings of {OOPSLA'94}", note = "To appear.", year = "1994", } @Misc{kobayashi94tr, author = "Naoki Kobayashi and Akinori Yonezawa", title = "Typed Higher-Order Cocurrent Linear Logic Programming", howpublished = "submitted", year = "1994", month = apr, } @Article{kobayashi95fac, author = "Naoki Kobayashi and Akinori Yonezawa", title = "Asynchronous communication model based on linear logic", journal = "Formal Aspects of Computing", year = "1995", volume = "7", number = "2", pages = "113--149", doi = "10.1007/BF01211602", } @Article{kobayashi99tcs, author = "N. Kobayashi and T. Shimizu and A. Yonezawa", title = "Distributed Concurrent Linear Logic Programming", journal = "Theoretical Computer Science", year = "1999", volume = "227", number = "1-2", pages = "185--220", note = "", } @Article{kohlenbach03apal, author = "Ulrich Kohlenbach and Paulo Oliva", title = "Proof mining in ${L}_1$-approximation", journal = apal, year = "2003", volume = "121", number = "1", pages = "1--38", } @Article{kohlenbach03steklov, author = "Ulrich Kohlenbach and Paulo Oliva", title = "Proof mining: a systematic way of analysing proofs in mathematics", journal = "Proceedings of the Steklov Institute of Mathematics", year = "2003", volume = "242", pages = "136--164", } @Article{kohlhase16jfr, title = "{QED} Reloaded: Towards a Pluralistic Formal Library of Mathematical Knowledge", author = "Michael Kohlhase and Florian Rabe", journal = "J. Formalized Reasoning", year = "2016", number = "1", volume = "9", pages = "201--234", } @Book{kohlhase2006omdoc, title = "{OMD}oc--An Open Markup Format for Mathematical Documents [version 1.2]: Foreword by Alan Bundy", author = "Michael Kohlhase", volume = "4180", series = lnai, year = "2006", publisher = "Springer", } @PhdThesis{kohlhase94phd, author = "Michael Kohlhase", school = "Saarland University", title = "A Mechanization of Sorted Higher-Order Logic Based on the Resolution Principle", year = "1994", } @TechReport{kohlhase94tr, author = "Michael Kohlhase", title = "Higher-Order Order-Sorted Resolution", institution = "Fachbereich Informatik, Universit{\"a}t des Saarlandes", year = "1994", type = "Seki Report", number = "SR-94-1", } @InProceedings{kohlhase95tableau, author = "Michael Kohlhase", title = "Higher-Order Tableaux", pages = "294--309", booktitle = "tableaux95", } @InCollection{kohlhase98book, author = "Michael Kohlhase", title = "Higher-Order Automated Theorem Proving", booktitle = "Automated Deduction - A Basis for Applications", year = "1998", publisher = "Kluwer", editor = "Wolfgang Bibel and Peter Schmitt", pages = "431--462", } @Article{kohlhase99jancl, author = "Michael Kohlhase and Ortwin Scheja", title = "Higher-Order Multi-Valued Resolution", journal = "Journal of Applied Non-Classical Logics", year = "1999", volume = "9", number = "4", } @Article{kolmogorov25ms, author = "Andrei Nikolaevich Kolmogorov", title = "On the Principle of the Excluded Middle", journal = "Matematicheskii sbornik", year = "1925", volume = "32", pages = "646--667", note = "English translation by Jean van Heijenoort in {\em From {F}rege to {G}{\"o}del}", } @Article{kolmogorov32mz, author = "Andrei Nikolaevich Kolmogorov", title = "Zur {D}eutung der intuitionistischen {L}ogik", journal = "Mathematische Zeitschrift", volume = "35", pages = "58--65", year = "1932", } @InProceedings{konev14sat, title = "A {SAT} attack on the {Erd\H{o}}s discrepancy conjecture", author = "Boris Konev and Alexei Lisitsa", booktitle = "International Conference on Theory and Applications of Satisfiability Testing", pages = "219--226", year = "2014", number = "8561", series = lncs, organization = "Springer", } @Article{konev15ai, author = "Boris Konev and Alexei Lisitsa", title = "Computer-aided proof of {Erd{\"o}s} discrepancy properties", journal = "Artificial Intelligence", year = "2015", volume = "224", pages = "103--118", } @InProceedings{kopylov95lics, author = "A. P. Kopylov", title = "Decidability of Linear Affine Logic", pages = "496--505", booktitle = "Symposium on Logic in Computer Science ({LICS} '95)", month = jun, publisher = "IEEE Computer Society Press", address = "Los Alamitos, Ca., USA", year = "1995", } @Article{korf85, author = "Richard E. Korf", title = "Depth-First Iterative-Deepening: An Optimal Admissible Tree Search", journal = "Artificial Intelligence", volume = "27", year = "1985", pages = "97--109", } @InCollection{korovin08iprover, title = "iProver--an instantiation-based theorem prover for first-order logic (system description)", author = "Konstantin Korovin", booktitle = "Automated Reasoning", pages = "292--298", year = "2008", publisher = "Springer", } @InProceedings{kowalski13lpnmr, title = "Logic Programming in the 1970s", author = "Robert A. Kowalski", booktitle = "Logic Programming and Nonmonotonic Reasoning, 12th International Conference, LPNMR 2013, Corunna, Spain, September 15-19, 2013. Proceedings", publisher = "Springer", year = "2013", volume = "8148", editor = "Pedro Cabalar and Tran Cao Son", ISBN = "978-3-642-40563-1; 978-3-642-40564-8", pages = "11--22", series = "Lecture Notes in Computer Science", } @InCollection{kowalski14lc, author = "Robert Kowalski", title = "Logic Programming", booktitle = "Computational Logic", publisher = "North Holland", year = "2014", editor = "J. Siekmann", volume = "9", pages = "523--569", series = "Handbook of the History of Logic", doi = "10.1016/B978-0-444-51624-4.50012-5", } @Article{kowalski71ai, author = "R. A. Kowalski and D. Kuehner", title = "Linear Resolution with Selection Function", journal = "Artificial Intelligence", year = "1971", volume = "2", pages = "227--260", } @Article{kowalski74ip, author = "Robert Kowalski", title = "Predicate Logic as a Programming Language", journal = "Information Processing", year = "1974", volume = "74", pages = "569--574", } @Article{kowalski79cacm, author = "R. A. Kowalski", title = "Algorithm = {Logic} + {Control}", journal = "Communications of the Association for Computing Machinery", year = "1979", volume = "22", pages = "424--436", } @Article{kozen83tcs, author = "Dexter Kozen", title = "Results on the Propositional $\mu$-Calculus", journal = tcs, year = "1983", volume = "27", number = "3", pages = "333--354", } @InProceedings{kozlowski97dimacs, author = "T. Kozlowski and S. Smolka", title = "Digital signatures with encryption: Fact and fiction", booktitle = "Proceedings of the DIMACS Workshop on Design and Formal Verification of Security Protocols", year = "1997", } @Article{krajicek88aml, title = "The number of proof lines and the size of proofs in first order logic", author = "Jan Kraj{\'i}cek and Pavel Pudl{\'a}k", journal = "Arch. Math. Log", year = "1988", number = "1", volume = "27", pages = "69--84", } @Article{kreisel68jsl, author = "Georg Kreisel", title = "A Survey of Proof Theory", journal = jsl, volume = "33", number = "3", pages = "321--388", year = "1968", } @Article{kripke59jsl, author = "S. Kripke", title = "A Completeness Theorem in Modal Logic’", journal = jsl, year = "1959", volume = "24", number = "1", pages = "1--14", } @Article{kripke63, author = "S. A. Kripke", title = "Semantical Considerations on Modal Logic", journal = "Acta Philosphica Fennica", volume = "16", year = "1963", } @InCollection{kripke65, author = "S. A. Kripke", title = "Semantical analysis of intuitionistic logic {I}", booktitle = "Formal Systems and Recursive Functions", editor = "J. N. Crossley and M. Dummett", publisher = "(Proc. 8th Logic Colloq. Oxford 1963) North-Holland", address = "Amsterdam", year = "1965", pages = "92--130", } @Book{krivine90lambda, author = "{Jean-Louis} Krivine", title = "Lambda-Calcul~: Types et Mod\`eles", publisher = "Masson", year = "1990", series = "Etudes et Recherches en Informatique", } @Article{krivine94apal, author = "J-L Krivine", title = "Classical Logic, Storage Operators, and Second-Order Lambda-Calculus", journal = apal, year = "1994", note = "To appear", } @Article{krukow08jcs, title = "A logical framework for history-based access control and reputation systems", author = "Karl Krukow and Mogens Nielsen and Vladimiro Sassone", journal = "Journal of Computer Security", year = "2008", number = "1", volume = "16", pages = "63--101", URL = "https://content.iospress.com/articles/journal-of-computer-security/jcs299", } @InCollection{kulstad08sep, author = "Mark Kulstad and Laurence Carlin", title = "Leibniz\'s Philosophy of Mind", booktitle = "The Stanford Encyclopedia of Philosophy", editor = "Edward N. Zalta", URL = "https://plato.stanford.edu/archives/fall2008/entries/leibniz-mind/", year = "2008", edition = "Fall 2008", } Volume 5Issue POPLJanuary 2021 Article No.: 1pp 1-28https://doi.org/ @InProceedings{kuperberg21popl, author = "Denis Kuperberg and Laureline Pinault and Damien Pous", title = "Cyclic proofs, {System T}, and the power of contraction", booktitle = "Proc.\ of the ACM on Programming Languages - POPL", year = "2021", volume = "5", pages = "1--28", month = jan, doi = "10.1145/3434282", } @InProceedings{kupferman00cav, author = "Kupferman and Vardi", title = "An Automata-Theoretic Approach to Reasoning about Infinite-State Systems", booktitle = "Proceedings of the 12th International Conference on Computer Aided Verification (CAV'00)", editor = "E. A. Emerson and A. P. Sistla", publisher = "Springer", series = lncs, volume = "1855", year = "2000", } @Article{kuzmin30bas, author = "R.~Kuzmin", title = "Sur une nouvelle classe de nombres transcendants", journal = "Bulletin de l’Académie des Sciences de l’URSS", year = "1930", pages = "585--597", } @Article{kwiatkowska04sttt, author = "M. Kwiatkowska and G. Norman and D. Parker", title = "Probabilistic symbolic model checking using {PRISM}: a hybrid approach", journal = "International Journal of Software Tools for Technology Transfer", year = "2004", volume = "6", number = "2", } @Article{kwon92cl, author = "Keehang Kwon and Gopalan Nadathur and Debra Sue Wilson", title = "Implementing Polymorphic Typing in a Logic Programming Language", journal = "Computer Languages", volume = "20", number = "1", pages = "25--42", year = "1994", } @InProceedings{kwon92lpw, author = "Keehang Kwon and Gopalan Nadathur and Debra Sue Wilson", title = "Implementing a Notion of Modules in the Logic Programming Language {$\lambda$Prolog}", booktitle = "Proceedings of the 1992 $\lambda$Prolog Workshop", editor = "Dale Miller", year = "1992", } @InProceedings{kwon93welp, author = "Keehang Kwon and Gopalan Nadathur and Debra Sue Wilson", title = "Implementing a notion of modules in the logic programming language $\lambda${P}rolog", booktitle = welp93, editor = "Evelina Lamma and Paola Mello", series = lnai, volume = "660", publisher = "Springer", year = "1993", pages = "359--393", } @Article{kwon94cl, author = "Keehang Kwon and Gopalan Nadathur and Debra Sue Wilson", title = "Implementing Polymorphic Typing in a Logic Programming Language", journal = "Computer Languages", volume = "20", number = "1", pages = "25--42", year = "1994", } @PhdThesis{kwon94phd, author = "Keehang Kwon", title = "Towards a Verified Abstract Machine for a Logic Programming Language with a Notion of Scope", school = "Duke University", year = "1994", note = "Available as Technical Report CS-1994-36, Department of Computer Science, Duke University", } @Article{kwon97jucs, author = "Keehang Kwon", title = "A structured presentation of a closure-based compilation method for a scoping notion in logic programming", journal = "Journal of Universal Computer Science", volume = "3", pages = "4", year = "1997", } @Article{lafont04tcs, author = "Yves Lafont", title = "Soft linear logic and polynomial time", journal = "Theoretical Computer Science", volume = "318", number = "1-2", year = "2004", pages = "163--180", } @InProceedings{lafont24jfla, title = "{A diagram editor to mechanise categorical proofs}", author = "Ambroise Lafont", URL = "https://hal.science/hal-04407118", booktitle = "{JFLA 2024: Journ{\'e}es Francophones des Langages Applicatifs}", address = "Saint-Jacut-de-la-Mer, France", year = "2024", month = Jan, pdf = "https://hal.science/hal-04407118/file/jfla2024-paper-53.pdf", } @PhdThesis{lafont88phd, author = "Yves Lafont", title = "Logique, Cat\'egories et Machines", school = "Universit\'e Paris~7", year = "1988", } @Article{lafont88tcs, author = "Yves Lafont", title = "The linear abstract machine", journal = tcs, volume = "59", number = "1--2", pages = "157--180", year = "1988", } @Unpublished{lafont89glasgow, author = "Yves Lafont", title = "Functional Programming and Linear Logic", note = "Lecture notes for the Summer School on Functional Programming and Constructive Logic, Glasgow, United Kingdom", year = "1989", URL = "ftp://lmd.univ-mrs.fr/pub/lafont/glasgow.ps.Z", } @InProceedings{lafont90popl, author = "Yves Lafont", title = "Interaction Nets", booktitle = popl90, address = "San Francisco, California", year = "1990", pages = "95--108", publisher = "ACM", } @InProceedings{lafont91lics, author = "Yves Lafont and Thomas Streicher", title = "Game semantics for linear logic", booktitle = "Proceedings of the 6th Annual IEEE Symposium on Logic in Computer Science (LICS 91)", year = "1991", pages = "43--50", } @InCollection{lafont95cup, author = "Yves Lafont", title = "From Proof Nets to Interaction Nets", booktitle = "Advances in Linear Logic", pages = "225--247", publisher = "Cambridge University Press", year = "1995", editor = "J.-Y.~Girard and Y.~Lafont and L.~Regnier", volume = "222", series = "London Mathematical Society Lecture Notes", } @Article{lafont96jsl, author = "Yves Lafont", title = "The Undecidability of Second Order Linear Logic without Exponentials", journal = jsl, volume = "61", number = "2", pages = "541--548", year = "1996", } @Article{lafont97ic, author = "Yves Lafont", title = "Interaction Combinators", journal = ic, volume = "137", pages = "69--101", year = "1997", } @Book{lakatos76book, author = "Imre Lakatos", title = "Proofs and Refutations", publisher = "Cambridge University Press", year = "1976", } @InProceedings{laksham91ilps, author = "T. L. Lakshman and Uday S. Reddy", title = "Typed {Prolog}: {A} Semantic Reconstruction of the Mycroft-{O}'Keefe Type System", booktitle = "Logic Programming, Proceedings of the 1991 International Symposium", editor = "Vijay A. Saraswat and Kazunori Ueda", year = "1991", publisher = "MIT Press", address = "San Diego, California, USA", pages = "202--217", } @Unpublished{lamarche.mscs, author = "Fran\c{c}ois Lamarche", title = "On the Algebra of Structural Contexts", note = "Accepted for publication in Math. Struct. in Comp. Sci.", } @InProceedings{lamarche05lics, author = "Fran\c{c}ois Lamarche and Lutz Stra{\ss}burger", title = "Constructing Free Boolean Categories", pages = "209--218", booktitle = lics05, publisher = "IEEE Computer Society", year = "2005", } @InProceedings{lamarche05tlca, author = "Fran\c{c}ois Lamarche and Lutz Stra{\ss}burger", title = "Naming Proofs in Classical Propositional Logic", booktitle = "Typed Lambda Calculi and Applications, TLCA 2005", editor = "Pawel Urzyczyn", series = lncs, volume = "3461", publisher = "Springer", pages = "246--261", year = "2005", } @Article{lamarche06lmcs, author = "Fran\c{c}ois Lamarche and Lutz Stra{\ss}burger", title = "From Proof Nets to the Free *-Autonomous Category", journal = lmcs, volume = "2", number = "4:3", year = "2006", pages = "1--44", pdf = "https://arxiv.org/pdf/cs.LO/0605054", } @TechReport{lamarche08tr, author = "Fran\c{c}ois Lamarche", title = "Proof Nets for Intuitionistic Linear Logic: Essential Nets", institution = "INRIA-Lorraine", year = "2008", number = "INRIA-00347336", month = dec, } @InProceedings{lamarche12jal, hal_id = "hal-00706562", URL = "https://hal.inria.fr/hal-00706562", title = "{Modelling Martin L{\"o}f Type Theory in Categories}", author = "Fran{\c c}ois Lamarche", keywords = "Martin-L{\"o}f type theory, Grothendieck Fibration, Martin-L{\"o}f identity type, abstract homotopy theory, path object.", booktitle = "{Logic, Categories, Semantics, special issue of J. of Applied Logic}", publisher = "Elsevier North-Holland", address = "Bordeaux, France", organization = "Ch. Retor{\'e} and J. Gilibert", note = "Scheduled to appear in June 2013", editor = "Ch. Retor{\'e} and J. Gilibert", year = "2012", month = Jun, pdf = "https://hal.inria.fr/hal-00706562/PDF/IdentityTypeMyElsev.pdf", } @TechReport{lamarche13hal, hal_id = "hal-00831430", URL = "https://hal.inria.fr/hal-00831430", title = "{Path Functors in Cat}", author = "Fran{\c c}ois Lamarche", institution = "INRIA", number = "hal-00831430", abstract = "{We build an endofunctor in the category of small categories along with the necessary structure on it to turn it into a path object suitable for homotopy theory and modelling identity types in Martin-L\"of type theory. We construct the free Grothendieck bifibration over a base category generated by an arbitrary functor to that category.}", pdf = "https://hal.inria.fr/hal-00831430/PDF/PathFunctorsInCat.pdf", note = "Submitted", month = apr, year = "2013", } @InProceedings{lamarche95lics, author = "Fran\c{c}ois Lamarche", title = "Games Semantics for Full Propositional Linear Logic", booktitle = lics95, pages = "464--473", year = "1995", } @InProceedings{lamarche96entcs, author = "Fran\c{c}ois Lamarche", title = "From Proof Nets to Games: extended abstract", booktitle = "Linear Logic 1996 Tokyo Meeting", year = "1996", editor = "Jean-Yves Girard and Mitsuhiro Okada and Andre Scedrov", volume = "3", series = entcs, pages = "107--119", doi = "10.1016/S1571-0661(05)80409-8", } @Article{lambek58, author = "J. Lambek", title = "The mathematics of sentence structure", journal = "American Mathematical Monthly", volume = "65", year = "1958", pages = "154--169", } @Book{lambek86, author = "J. Lambek and P. J. Scott", title = "Introduction to Higher Order Categorical Logic", publisher = "Cambridge University Press", year = "1986", } @InProceedings{lambek87ccsl, author = "J. Lambek", title = "Multicategories Revisited", booktitle = "Categories in Computer Science", month = jun, year = "1987", publisher = "AMS", series = "Contemporary Mathematics", volume = "92", pages = "217--239", } @InCollection{lambek88slp, author = "Joachim Lambek", booktitle = "Categorial and categorical grammars", title = "Categorial Grammars and Natural Language Structures", publisher = "D.\ Reidel", address = "Dordrecht", year = "1988", editor = "{Richard~T. Oehrle, Emmon Bach} and Deirdre Wheeler", volume = "32", pages = "297--317", } @Article{lamma94jlp, author = "Evelina Lamma and Paola Mello and Antonio Natali", title = "An Extended Warren Abstract Machine for the Execution of Structured Logic Programs", journal = "Journal of Logic Programming", year = "1994", note = "To appear.", } @Article{lampson88ic, author = "B. Lampson and R. Burstall", title = "Pebble, a Kernal Language for Modules and Abstract Data Types", journal = "Information and Computation", volume = "76", number = "2/3", month = feb # "/" # mar, year = "1988", pages = "278--346", } @Article{landin64, author = "P. J. Landin", title = "The Mechanical Evaluation of Expressions", journal = "Computer Journal", volume = "6", number = "5", pages = "308--320", year = "1964", } @TechReport{lang88tr, author = "Bernard Lang", title = "Complete Evaluation of {Horn} {Clauses}: an Automata Theoretic approach", institution = "INRIA", year = "1988", type = "Research Report", number = "813", month = nov, } @Misc{lappin00misc, author = "Shalom Lappin and Carl Pollard", title = "Strategies for Hyperintensional Semantics", howpublished = "Manuscript, King's College, London and Ohio State University", year = "2000", } @Misc{lappin02misc, author = "Shalom Lappin and Carl Pollard", title = "A Higher-Order Fine-Grained Logic for Intensional Semantics", howpublished = "Manuscript", year = "2002", } @Book{larson95book, author = "Richard Larson and Gabriel Segal", title = "Knowledge of Meaning", publisher = "MIT Press", year = "1995", address = "Cambridge Ma", } @InProceedings{lassen00bisimulation, author = "S. Lassen", title = "Bisimulation in Untyped Lambda Calculus: {B}{\"o}hm Trees and Bisimulation up to Context", booktitle = entcs, volume = "20", publisher = "Elsevier Science Publishers", editor = "Michael Mislove {Stephen Brookes, Achim Jung} and Andre Scedrov", year = "2000", } @TechReport{laurent00tr, author = "Olivier Laurent and Myriam Quatrini and Lorenzo Tortora de Falco", title = "Polarized and Focalized Linear and Classical Proofs", institution = "{I}nstitut de {M}ath\'ematiques de {L}uminy", type = "Pr\'epublication", number = "24", address = "Marseille, France", month = sep, year = "2000", } @InProceedings{laurent01tlca, author = "Olivier Laurent", title = "A Token Machine for Full Geometry of Interaction (Extended Abstract)", booktitle = "Typed Lambda Calculi and Applications '01", editor = "Samson Abramsky", series = lncs, volume = "2044", publisher = "Springer", pages = "283--297", month = may, year = "2001", } @InProceedings{laurent02lics, author = "Olivier Laurent", title = "Polarized games (extended abstract)", booktitle = lics02, publisher = "IEEE Computer Society Press", pages = "265--274", month = jul, year = "2002", } @PhdThesis{laurent02phd, author = "Olivier Laurent", title = "Etude de la polarisation en logique", school = "{U}niversit\'e {Aix}-{M}arseille~{II}", month = mar, year = "2002", } @InProceedings{laurent03lics, author = "Olivier Laurent and Laurent Regnier", title = "About Translations of Classical Logic into Polarized Linear Logic", pages = "11--20", booktitle = lics03, publisher = "IEEE Computer Society Press", month = jun, year = "2003", } @Article{laurent03tcs, author = "Olivier Laurent", title = "Polarized proof-nets and $\lambda\mu$-calculus", journal = "Theoretical Computer Science", volume = "290", number = "1", pages = "161--188", month = jan, year = "2003", } @Article{laurent04apal, author = "Olivier Laurent", title = "Polarized Games", journal = apal, number = "1--3", volume = "130", pages = "79--123", month = dec, year = "2004", } @InProceedings{laurent04llcs, author = "Olivier Laurent and Lorenzo Tortora de Falco", title = "Slicing polarized additive normalization", booktitle = "Linear Logic in Computer Science", editor = "Thomas Ehrhard and Jean-Yves Girard and Paul Ruet and Philip Scott", volume = "316", series = "London Mathematical Society Lecture Note Series", publisher = "Cambridge University Press", month = nov, year = "2004", } @Unpublished{laurent04unp, author = "Olivier Laurent", title = "A proof of the focalization property of Linear Logic", note = "Unpublished note", month = may, year = "2004", } @Article{laurent05apal, title = "Polarized and focalized linear and classical proofs", author = "Olivier Laurent and Myriam Quatrini and Lorenzo Tortora de Falco", journal = apal, year = "2005", number = "2-3", volume = "134", pages = "217--264", } @TechReport{laurent05tr, author = "Olivier Laurent", title = "Syntax vs. Semantics: a polarized approach", type = "Pr\'epublication \'electronique", institution = "Laboratoire Preuves, Programmes et Syst\`emes", number = "PPS//03/04//no 17 (pp)", month = mar, year = "2003", note = "Submitted for publication", } @TechReport{laurent05tra, author = "Olivier Laurent", title = "Classical isomorphisms of types", type = "Pr\'epublication \'electronique", institution = "Laboratoire Preuves, Programmes et Syst\`emes", number = "PPS//03/04//no. 18 (pp)", month = apr, year = "2003", note = "Submitted for publication", } @Article{laurent11jlc, title = "Intuitionistic Dual-intuitionistic Nets", author = "Olivier Laurent", journal = "J. Log. Comput", year = "2011", number = "4", volume = "21", pages = "561--587", doi = "10.1093/logcom/exp044", } @InProceedings{laurent18lics, author = "Olivier Laurent", title = "Around Classical and Intuitionistic Linear Logics", booktitle = "LICS '18: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science", year = "2018", doi = "10.1145/3209108.3209132", pages = "629--638", month = jul, } @MastersThesis{laurent98tr, author = "Olivier Laurent", title = "{R}\'eseaux de preuve polaris\'es~: des r\'eseaux pour {LC}", school = "{U}niversit\'e {P}aris {VII}", year = "1998", type = "M\'emoire de {D.E.A.} de Logique et Fondements de l'Informatique", month = sep, URL = "https://www.pps.jussieu.fr/~laurent/dea.ps.gz", } @InProceedings{laurent99tlca, author = "Olivier Laurent", title = "Polarized proof-nets: proof-nets for {LC} (Extended Abstract)", booktitle = "Typed Lambda Calculi and Applications '99", editor = "Jean-Yves Girard", series = lncs, volume = "1581", pages = "213--227", publisher = "Springer", month = apr, year = "1999", } @Article{lawvere63nas, author = "F. William Lawvere", title = "Functorial Semantics of Algebraic Theories", journal = "Proceedings National Academy of Sciences USA", year = "1963", volume = "50", pages = "869--872", } @Article{leach01tplp, author = "Javier Leach and Susana Nieva and Mario Rodr{\'i}guez-Artalejo", title = "Constraint Logic Programming with Hereditary {Harrop} formulas", journal = "Theory Pract. Log. Program.", volume = "1", number = "4", year = "2001", pages = "409--445", publisher = "Cambridge University Press", address = "New York, NY, USA", } @Misc{lean-reference-manual, key = "Lean", title = "{The Lean Reference Manual}", URL = "https://leanprover.github.io/reference/", accessdate = "2024-02-07", } @InProceedings{leavens06gpce, key = "Leavens and {\em et al.}", author = "Gary T. Leavens and Jean-Raymond Abrial and Don Batory and Michael Butler and Alessandro Coglio and Kathi Fisler and Eric Hehner and Cliff Jones and Dale Miller and Simon Peyton-Jones and Murali Sitaraman and Douglas R. Smith and Aaron Stump", title = "Roadmap for Enhanced Languages and Methods to Aid Verification", booktitle = "Fifth International Conference on Generative Programming and Component Engineering (GPCE)", pages = "221--235", year = "2006", month = Oct, organization = "ACM", doi = "10.1145/1173706.1173740", } @Misc{lee01talk, author = "Peter Lee", title = "Certified Code", howpublished = "Harvard University Computer Science Colloquium", month = jan, year = "2001", } @TechReport{lee88cmu, author = "Peter Lee and Frank Pfenning and John Reynolds and Gene Rollins and Dana Scott", title = "Research on Semantically Based Program-Design Environments: The {Ergo Project} in 1988", institution = "Carnegie Mellon University", address = "Pittsburgh", type = "Technical Report", number = "CMU-CS-88-118", month = mar, year = "1988", } @InProceedings{lee88sde, author = "Peter Lee and Frank Pfenning and Gene Rollins and William Scherlis", title = "The {Ergo Support System}: An Integrated Set of Tools for Prototyping Integrated Environments", booktitle = "Proceedings of the {ACM SIGSOFT/SIGPLAN} Software Engineering Symposium on Practical Software Development Environments", publisher = "ACM Press", year = "1988", editor = "Peter Henderson", month = nov, pages = "25--34", } @Book{lee89, author = "Peter Lee", title = "Realistic Compiler Generation", publisher = "MIT Press", year = "1989", address = "Cambridge, MA", } @TechReport{lee89cmu, author = "Peter Lee and Mark Leone and Spiro Michaylov and Frank Pfenning", title = "Towards a Practical Programming Language Based on the Polymorphic Lambda Calculus", institution = "School of Computer Science, Carnegie Mellon University", type = "Ergo Report", number = "89-085", month = nov, year = "1989", address = "Pittsburgh, Pennsylvania", } @InProceedings{leino10lpar, author = "K. Rustan M. Leino", editor = "Edmund M. Clarke and Andrei Voronkov", title = "Dafny: An Automatic Program Verifier for Functional Correctness", booktitle = "Logic for Programming, Artificial Intelligence, and Reasoning", year = "2010", publisher = "Springer Berlin Heidelberg", address = "Berlin, Heidelberg", pages = "348--370", doi = "", } @InProceedings{leitsch15epsilon, author = "Alexander Leitsch and Giselle Reis and Bruno Woltzenlogel Paleo", title = "Epsilon Terms in Intuitionistic Sequent Calculus", year = "2015", note = "Hilbert's Epsilon and Tau in Logic, Informatics and Linguistics Workshop", } @Book{leitsch97book, title = "The Resolution Calculus", author = "Alexander Leitsch", publisher = "Springer", ISBN = "978-3-642-64473-3,978-3-642-60605-2", year = "1997", series = "Texts in Theoretical Computer Science. An EATCS Series", } @InCollection{leivant94lailp, author = "Daniel Leivant", booktitle = "Handbook of Logic in Artificial Intelligence and Logic Programming", title = "Higher-order logic", publisher = "Oxford University Press", year = "1994", editor = "Dov M. Gabbay and C. J. Hogger and J. A. Robinson", pages = "229--321", volume = "2", } @InProceedings{lellmann15lpar, author = "Bj{\"{o}}rn Lellmann and Elaine Pimentel", title = "Proof Search in Nested Sequent Calculi", booktitle = "Logic for Programming, Artificial Intelligence, and Reasoning - 20th International Conference, {LPAR-20} 2015, Suva, Fiji, November 24-28, 2015, Proceedings", pages = "558--574", year = "2015", doi = "10.1007/978-3-662-48899-7\_39", editor = "Martin Davis and Ansgar Fehnker and Annabelle McIver and Andrei Voronkov", } @InProceedings{lellmann17lpar, author = "Bj{\"{o}}rn Lellmann and Carlos Olarte and Elaine Pimentel", title = "A uniform framework for substructural logics with modalities", booktitle = "LPAR-21, 21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Maun, Botswana, 7-12th May 2017", pages = "435--455", year = "2017", URL = "https://www.easychair.org/publications/paper/340350", editor = "Thomas Eiter and David Sands", series = "EPiC Series", volume = "46", publisher = "EasyChair", } @Article{lellmann19tocl, title = "Modularisation of sequent calculi for normal and non-normal modalities", author = "Bj{\"o}rn Lellmann and Elaine Pimentel", journal = "ACM Transactions on Computational Logic (TOCL)", volume = "20", number = "2", pages = "7", year = "2019", publisher = "ACM", } @InProceedings{lengrand06csl, author = "{St\'ephane} Lengrand and Roy Dyckhoff and James McKinna", title = "A sequent calculus for {Pure Type Systems}", booktitle = csl06, editor = "Zoltan Esik", publisher = "Springer-Verlag", series = lncs, volume = "4207", month = sep, year = "2006", place = "Szeged, Hungary", pages = "441--455", } @InProceedings{lengrand06csl, author = "St{\'{e}}phane Lengrand and Roy Dyckhoff and James McKinna", title = "A Sequent Calculus for Type Theory", booktitle = "{CSL}", series = "Lecture Notes in Computer Science", volume = "4207", pages = "441--455", publisher = "Springer", year = "2006", doi = "10.1007/11874683_29", } @PhdThesis{lengrand06phd, author = "St{\'e}phane Lengrand", title = "Normalisation \& Equivalence in Proof Theory \& Type Theory", school = "University of St.~Andrews", year = "2006", month = dec, publisher = "HAL", key = "tel-00134646", URL = "https://tel.archives-ouvertes.fr/tel-00134646", } @TechReport{lengrand07tr, author = "St\'ephane Lengrand", title = "Termination of lambda-calculus with the extra Call-By-Value rule known as assoc", year = "2007", institution = "CNRS-Ecole Polytechnique-INRIA", note = "CoRR, abs/0806.4859", URL = "https://hal.inria.fr/inria-00292029", } @Article{lengrand08apal, author = "{St\'ephane} Lengrand and Alexandre Miquel", title = "Classical {$F_\omega$}, orthogonality and symmetric candidates", editor = "Stephen van Bakel and Stefano Berardi", journal = apal, publisher = "Elsevier", volume = "153", number = "1--3", year = "2008", month = mar, pages = "3--20", } @Article{lengrand10lmcs, author = "{St\'ephane} Lengrand and Roy Dyckhoff and James McKinna", title = "A Focused Sequent Calculus Framework for Proof Search in Pure Type Systems", year = "2011", journal = "Logical Methods in Computer Science", volume = "7", number = "1", URL = "https://www.lix.polytechnique.fr/~lengrand/Work/Reports/TTSC09.pdf", } @InProceedings{lengrand13tableaux, title = "{Psyche}: a proof-search engine based on sequent calculus with an {LCF}-style architecture", author = "{St\'ephane} Graham-Lengrand", year = "2013", editor = "Didier Galmiche and Dominique Larchey-Wendling", booktitle = "International Conference on Automated Reasoning with Analytic Tableaux and Related Methods (Tableaux'13)", publisher = pub-sv, series = lncs, volume = "8123", pages = "149--156", month = sep, place = "Nancy, France", } @Misc{lengrand14hdr, author = "St\'ephane Graham-Lengrand", title = "Polarities and Focussing: a journey from Realisability to Automated Reasoning", school = "Université Paris-Sud", month = dec, year = "2014", note = "Habilitation \`{a} diriger des recherches", URL = "https://tel.archives-ouvertes.fr/tel-01094980", } @InProceedings{lenisa97tapsoft, author = "Marina Lenisa", title = "A Uniform Syntactical Method for Proving Coinduction Principles in Lambda-calculi", editor = "Michel Bidoit and Max Dauchet", booktitle = "{TAPSOFT}~'97: Theory and Practice of Software Development", series = lncs, publisher = "Springer", volume = "1214", year = "1997", pages = "309--320", } @Article{lenisa99ccl, author = "M. Lenisa", title = "A Complete Coinductive Logical System for Bisimulation Equivalence on Circular Objects", journal = lncs, volume = "1578", pages = "243--257", year = "1999", keywords = "computation structures; ETAPS; FOSSACS; software science", } @InProceedings{lenisa99fossacs, author = "Marina Lenisa", title = "A Complete Coinductive Logical System for Bisimulation Equivalence of Circular Objects", booktitle = "FoSSaCS'99", pages = "243--257", year = "1999", editor = "W. Thomas", number = "1578", series = lncs, publisher = "Springer", } @TechReport{leroy07tr, author = "Xavier Leroy", title = "A locally nameless solution to the {POPLmark} challenge", year = "2007", month = JAN, institution = "INRIA", number = "6098", type = "Research report", URL = "https://gallium.inria.fr/~xleroy/publi/POPLmark-locally-nameless.pdf", } @Article{leroy09cacm, title = "Formal verification of a realistic compiler", author = "Xavier Leroy", journal = "Commun. ACM", year = "2009", number = "7", volume = "52", pages = "107--115", doi = "10.1145/1538788.1538814", } @InProceedings{levy06icalp, author = "P. B. Levy", title = "Jumbo $\lambda$-calculus", booktitle = "ICALP06: 33rd International Colloquium on Automata, Languages and Programming", year = "2006", editor = "M. Bugliesi and B. Preneel and V. Sassone and I. Wegener", number = "4052", pages = "444--455", series = lncs, month = jul, publisher = "Springer", } @InBook{levy80, author = "J.-J. L\'{e}vy", editor = "J. P. Seldin and J. R. Hindley", title = "Optimal reductions in the lambda-calculus", pages = "159--191", publisher = "Academic Press", year = "1980", } @InProceedings{li94esop, author = "Benjamin Z. Li", title = "A $\pi$-calculus specification of {Prolog}", booktitle = "Proc.\ of European Symposium on Programming (ESOP 1994)", year = "1994", URL = "https://repository.upenn.edu/cis_reports/251/", volume = "788", series = lncs, publisher = "Springer", pages = "379--393", } @Article{liang05jar, author = "Chuck Liang and Gopalan Nadathur and Xiaochu Qi", title = "Choices in Representing and Reduction Strategies for Lambda Terms in Intensional Contexts", journal = "Journal of Automated Reasoning", year = "2005", volume = "33", pages = "89--132", } @InProceedings{liang07csl, author = "Chuck Liang and Dale Miller", title = "Focusing and Polarization in Intuitionistic Logic", booktitle = csl07, editor = "J. Duparc and T. A. Henzinger", volume = "4646", series = lncs, publisher = pub-sv, pages = "451--465", year = "2007", URL = "https://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/csl07liang.pdf", } @Unpublished{liang07report, author = "Chuck Liang and Dale Miller", title = "On focusing and polarities in linear logic and intuitionistic logic", URL = "https://hal.inria.fr/inria-00167231/", pdf = "https://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/focusli.pdf", month = sep, year = "2007", note = "Extended version of accepted paper.", } @InProceedings{liang09lics, author = "Chuck Liang and Dale Miller", title = "A Unified Sequent Calculus for Focused Proofs", year = "2009", pages = "355--364", booktitle = lics09, URL = "https://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/liang09lics.pdf", } @Article{liang09tcs, author = "Chuck Liang and Dale Miller", title = "Focusing and Polarization in Linear, Intuitionistic, and Classical Logics", year = "2009", journal = "Theoretical Computer Science", publisher = "Elsevier", volume = "410", number = "46", pages = "4747--4768", doi = "10.1016/j.tcs.2009.07.041", note = "Abstract Interpretation and Logic Programming: In honor of professor Giorgio Levi", } @Article{liang11apal, author = "Chuck Liang and Dale Miller", title = "A Focused Approach to Combining Logics", journal = apal, pages = "679--697", volume = "162", number = "9", year = "2011", doi = "10.1016/j.apal.2011.01.012", pdf = "https://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/lku.pdf", } @Article{liang13apal, author = "Chuck Liang and Dale Miller", title = "Kripke Semantics and Proof Systems for Combining Intuitionistic Logic and Classical Logic", journal = apal, month = feb, year = "2013", doi = "10.1016/j.apal.2012.09.005", volume = "164", number = "2", pages = "86--111", URL = "https://hal.inria.fr/hal-00787601", } @InProceedings{liang13lics, author = "Chuck Liang and Dale Miller", title = "Unifying Classical and Intuitionistic Logics for Computational Control", booktitle = lics13, year = "2013", editor = "Orna Kupferman", pages = "283--292", URL = "https://hal.inria.fr/hal-00906299", doi = "10.1109/LICS.2013.34", } @InProceedings{liang15lpar, author = "Chuck Liang and Dale Miller", title = "On Subexponentials, Synthetic Connectives, and Multi-Level Delimited Control", booktitle = "Logic for Programming, Artificial Intelligence, and Reasoning (LPAR)", year = "2015", editor = "Martin Davis and Ansgar Fehnker and Annabelle McIver and Andrei Voronkov", month = nov, doi = "10.1007/978-3-662-48899-7\_21", series = lncs, URL = "https://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/subdelimlncs.pdf", number = "9450", } @InProceedings{liang16lics, author = "Chuck Liang", title = "Unified Semantics and Proof System for Classical, Intuitionistic and Affine Logics", booktitle = "Proceedings of the 31st Annual {ACM/IEEE} Symposium on Logic in Computer Science, {LICS} '16, New York, NY, USA, July 5-8, 2016", pages = "156--165", year = "2016", URL = "https://doi.acm.org/10.1145/2933575.2933581", doi = "10.1145/2933575.2933581", } @Article{liang18mscs, author = "Chuck Liang", title = "On the unification of classical, intuitionistic and affine logics", journal = "Mathematical Structures in Computer Science", year = "2018", month = oct, doi = "10.1017/S0960129518000403", } @Article{liang19mscs, title = "On the unification of classical, intuitionistic and affine logics", volume = "29", doi = "10.1017/S0960129518000403", number = "8", journal = "Mathematical Structures in Computer Science", publisher = "Cambridge University Press", author = "Chuck Liang", year = "2019", pages = "1177--1216", } @InCollection{liang24psh, author = "Chuck Liang and Dale Miller", title = "Focusing {Gentzen's} {LK} proof system", booktitle = "Peter Schroeder-Heister on Proof-Theoretic Semantics", editor = "Thomas Piecha and Kai Wehmeier", series = "Outstanding Contributions to Logic", publisher = "Springer", month = feb, year = "2024", doi = "10.1007/978-3-031-50981-0", URL = "https://hal.archives-ouvertes.fr/hal-03457379", } @PhdThesis{liang96phd, author = "Chuck Liang", title = "Object-Level Substitution, Unification and Generalization in Meta-Logic", school = "University of Pennsylvania", year = "1996", address = "Philadelphia, PA, USA", } @Unpublished{liang99unp, author = "Chuck Liang", title = "A Formulation of Deterministic Bottom-Up Parsing and Parser Generation in Logic Programming", note = "https://www2.trincoll.edu/~cliang/parsergen/eosparse.ps.gz", year = "1999", } @InProceedings{libal15cade, author = "Tomer Libal", title = "Regular Patterns in Second-Order Unification", booktitle = "Automated Deduction - {CADE-25} - 25th International Conference on Automated Deduction, Berlin, Germany, August 1-7, 2015, Proceedings", pages = "557--571", year = "2015", } @InProceedings{libal16fscd, author = "Tomer Libal and Dale Miller", title = "Functions-as-constructors Higher-order Unification", booktitle = "1st International Conference on Formal Structures for Computation and Deduction (FSCD 2016)", year = "2016", editor = "D. Kesner and B. Pientka", pages = "26:1--26:17", doi = "10.4230/LIPIcs.FSCD.2016.0", ISBN = "978-3-9597701-0-1", pdf = "https://hal.inria.fr/hal-01379683/file/fscd16.pdf", } @InProceedings{libal16gandalf, title = "{Certification of Prefixed Tableau Proofs for Modal Logic}", author = "Tomer Libal and Marco Volpe", URL = "https://hal.archives-ouvertes.fr/hal-01379625", booktitle = "{the Seventh International Symposium on Games, Automata, Logics and Formal Verification (GandALF 2016)}", address = "Catania, Italy", series = "EPTCS", number = "226", pages = "257--271", year = "2016", month = Sep, doi = "10.4204/EPTCS.226.18", pdf = "https://hal.archives-ouvertes.fr/hal-01379625/file/LibVol-GandALF16.pdf", hal_id = "hal-01379625", hal_version = "v1", } @Article{libal19mscs, title = "A general proof certification framework for modal logic", volume = "29", doi = "10.1017/S0960129518000440", number = "8", journal = "Mathematical Structures in Computer Science", publisher = "Cambridge University Press", author = "Tomer Libal and Marco Volpe", year = "2019", pages = "1344--1378", } @Article{libal22amai, author = "Tomer Libal and Dale Miller", title = "Functions-as-constructors higher-order unification: extended pattern unification", journal = "Annals of Mathematics and Artificial Intelligence", year = "2022", pages = "455--479", volume = "90", number = "5", note = "Appears in the \emph{Special Issue on Theoretical and Practical Aspects of Unification}", doi = "10.1007/s10472-021-09774-y", } @InProceedings{licata08lics, author = "Daniel R. Licata and Noam Zeilberger and Robert Harper", title = "Focusing on Binding and Computation", booktitle = lics08, year = "2008", editor = "F. Pfenning", publisher = "IEEE Computer Society Press", pages = "241--252", } @TechReport{licata08tr, author = "Daniel R. Licata and Noam Zeilberger and Robert Harper", title = "Focusing on Binding and Computation", institution = "Department of Computer Science, Carnegie Mellon University", year = "2008", number = "CMU-CS-08-101", } @InProceedings{licata09icfp, author = "Daniel R. Licata and Robert Harper", title = "A Universe of Binding and Computation", booktitle = "Proceedings of the 14th ACM SIGPLAN International Conference on Functional Programming", series = "ICFP '09", year = "2009", ISBN = "978-1-60558-332-7", location = "Edinburgh, Scotland", pages = "123--134", URL = "https://doi.acm.org/10.1145/1596550.1596571", doi = "10.1145/1596550.1596571", publisher = "ACM", address = "New York, NY, USA", } @InProceedings{lifschitz08aaai, author = "Vladimir Lifschitz", title = "What is answer set programming?", booktitle = "Proceedings of the 23rd National Conference on Artificial Intelligence", year = "2008", volume = "3", pages = "1594--1597", publisher = "AAAI Press", } @InCollection{lifschitz96csli, author = "Vladimir Lifschitz", title = "Foundations of Logic Programming", booktitle = "Principles of Knowledge Representation", publisher = "{CSLI} Publications", year = "1996", editor = "Gerhard Brewka", pages = "69--127", address = "Stanford, California", } @Article{lincoln92apal, author = "P. Lincoln and J. Mitchell and A. Scedrov and N. Shankar", title = "Decision Problems for Propositional Linear Logic", journal = apal, volume = "56", year = "1992", pages = "239--311", } @Article{lincoln93apal, author = "Patrick Lincoln and Andre Scedrov and Natarajan Shankar", title = "Linearizing intuitionistic implication", journal = apal, pages = "151--177", year = "1993", } @Unpublished{lincoln93tr, author = "P. Lincoln and V. Saraswat", title = "Higher-order, linear, concurrent constraint programming", month = jan, year = "1993", note = "ftp://parcftp.xerox.com/pub/ccp/lcc/hlcc.dvi", } @InProceedings{lincoln94lics, author = "Patrick Lincoln and N. Shankar", title = "Proof Search in First-Order Linear Logic and Other Cut-Free Sequent Calculi", pages = "282--291", booktitle = "Logic in Computer Science ({LICS} '94)", month = jul, publisher = "IEEE Computer Society Press", address = "Los Alamitos, Ca., USA", year = "1994", } @InProceedings{lincoln95all, author = "Patrick Lincoln", title = "Deciding provability of linear logic formulas", booktitle = "Proceedings of the Workshop on Advances in Linear Logic", editor = "J.-Y. Girard and Y. Lafont and L. Regnier", year = "1995", pages = "197--210", publisher = "Cambridge University Press", address = "New York, NY, USA", } @TechReport{lingenfelder86, author = "Christoph Lingenfelder", title = "Transformation of Refutation Graphs into Natural Deduction Proofs", number = "SEKI-Report SR-86-10", institution = "University of Kaiserslautern", month = dec, year = "1986", } @Article{lipton18tcs, author = "James Lipton and Susana Nieva", title = "Kripke Semantics for Higher-Order Type Theory Applied to Constraint Logic Programming Languages", journal = "Theoretical Computer Science", year = "2018", pages = "1--37", volume = "712", } @InProceedings{lipton90msri, author = "James Lipton", title = "Constructive Kripke Semantics and Realizability", booktitle = "Proceedings of the {\em Logic for Computer Science}, the Math.\ Sci.\ Research Institute, Berkeley", month = nov, year = "1990", } @PhdThesis{lipton90phd, author = "James Lipton", title = "Relating Kripke Models and Realizability", school = "Cornell University", year = "1990", } @TechReport{lipton90tra, author = "James Lipton", title = "Constructive Kripke Models, Realizability and Deduction", institution = "Cornell University", type = "MSI Technical Report", year = "1990", } @TechReport{lipton90trb, author = "James Lipton", title = "Logic Programming in Constructive Type Theory", institution = "Cornell University", type = "Computer Science Technical Report", year = "1990", } @TechReport{lisitsa03tr, author = "Alexei Lisitsa", title = "{$\lambda$leanTAP}: Lean Deduction in {$\lambda$Prolog}", institution = "University of Liverpool, Department of Computer Science", year = "2003", number = "ULCS-03-017", URL = "https://www.csc.liv.ac.uk/research/techreports/tr2003/ulcs-03-017.ps", } @Article{liskov75, author = "B. Liskov and S. Zilles", title = "Specification Techniques for Data Abstractions", journal = "{IEEE} Transactions on Software Engineering", volume = "1", number = "1", pages = "7--19", year = "1975", } @Article{lloyd84jlp, author = "J. Lloyd and R. Topor", title = "Making {Prolog} More Expressive", journal = "Journal of Logic Programming", volume = "1", number = "3", month = oct, year = "1984", pages = "225--240", } @Book{lloyd87book, title = "Foundations of Logic Programming, 2nd Edition", author = "John W. Lloyd", publisher = "Springer", year = "1987", ISBN = "3-540-18199-7", edition = "2", } @Article{lloyd91jlp, title = "Partial evaluation in logic programming", journal = "The Journal of Logic Programming", volume = "11", number = "3", pages = "217--242", year = "1991", doi = "10.1016/0743-1066(91)90027-M", URL = "https://www.sciencedirect.com/science/article/pii/074310669190027M", author = "J. W. Lloyd and J. C. Shepherdson", } @InProceedings{lobo89iclp, author = "J. Lobo and J. Minker and A. Rajasekar", title = "Extending the Semantics of Logic Programs to Disjunctive Logic Programs", pages = "255--267", editor = "G. Levi and M. Martelli", booktitle = "Sixth International Logic Programming Conference", address = "Lisbon, Portugal", publisher = "MIT Press", month = jun, year = "1989", } @Book{lobo92book, author = "J. Lobo and J. Minker and A. Rajasekar", title = "Foundations of disjunctive logic programming", publisher = "MIT Press", year = "1992", } @InProceedings{loddo00lpar, author = "Jean-Vincent Loddo and Roberto {Di Cosmo}", title = "Playing Logic Programs with the Alpha-Beta Algorithm", booktitle = "Logic for Programming and Automated Reasoning (LPAR)", series = lncs, number = "1955", publisher = pub-sv, year = "2000", pages = "207--224", } @PhdThesis{loddo02phd, author = "Jean-Vincent Loddo", title = "{G}\'en\'eralisation des Jeux Combinatoires et Applications aux Langages Logiques", school = "Universit\'e Paris VII", year = "2002", } @Book{loeckx84, author = "Jacques Loeckx and Kurt Sieber", title = "The Foundations of Program Verification", publisher = "Wiley", year = "1984", } @Misc{logipedia22web, title = "Logipedia in a nutshell", key = "Logipedia", howpublished = "\url{https://logipedia.inria.fr/about/about.php}", year = "2022", } @InProceedings{lopez05ppdp, title = "Monadic concurrent linear logic programming", author = "Pablo L{\'o}pez and Frank Pfenning and Jeff Polakow and Kevin Watkins", year = "2005", booktitle = "Proceedings of the 7th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP)", publisher = "ACM", editor = "Pedro Barahona and Amy P. Felty", pages = "35--46", doi = "10.1145/1069778", } @InProceedings{lopez97agp, author = "Pablo L\'opez and Ernesto Pimentel", title = "A Lazy Splitting System for {Forum}", booktitle = "{AGP'97: Joint Conference on Declarative Programming}", year = "1997", } @Unpublished{lopez98uma, author = "Pablo L\'opez and Ernesto Pimentel", title = "The {UMA Forum} Linear Logic Programming Language", note = "implementation", year = "1998", month = Jan, } @InCollection{lorenzen61im, author = "Paul Lorenzen", title = "Ein dialogisches Konstruktivit{\"a}tskriterium", booktitle = "Infinitistic Methods: Proceed. Symp. Foundations of Math.", pages = "193--200", publisher = "PWN", year = "1961", } @Article{loveland68jacm, title = "Mechanical theorem-proving by model elimination", author = "Donald W Loveland", journal = "Journal of the ACM (JACM)", volume = "15", number = "2", pages = "236--251", year = "1968", publisher = "ACM", } @InProceedings{loveland70lnm, author = "D. W. Loveland", title = "A Linear Format for Resolution", booktitle = "Symposium on Automatic Demonstration", series = "Lecture Notes in Mathematics", number = "125", year = "1970", publisher = "Springer Verlag", address = "Berlin", pages = "147--162", } @InProceedings{loveland87iclp, author = "D. W. Loveland", title = "{Near-Horn} {PROLOG}", booktitle = "Proceedings of the Fourth International Conference on Logic Programming", year = "1987", editor = "Jean-Louis Lassez", publisher = "The MIT Press", address = "Melbourne", pages = "456--469", series = "MIT Press Series in Logic Programming", } @InCollection{loveland91cl, author = "Donald W. Loveland and David W. Reed", title = "A Near-{Horn} {Prolog} for Compilation", booktitle = "Computational Logic - Essays in Honor of Alan Robinson", publisher = "MIT Press", year = "1991", editor = "Jean-Louis Lassez and Gordon Plotkin", pages = "542--564", } @Unpublished{loveland91private, author = "Donald Loveland", year = "1991", title = "Private communication", } @TechReport{loveland94tr, author = "Donald W. Loveland and Gopalan Nadathur", title = "Proof Procedures for Logic Programming", month = may, year = "1994", institution = "Department of Computer Science, Duke University", number = "CS-1994-19", note = "To appear in {\it Handbook of Logic in Artificial Intelligence and Logic Programming}, D. Gabbay, C. Hogger and A. Robinson (eds.), Oxford University Press.", } @InProceedings{lowe96tacas, author = "Gavin Lowe", title = "Breaking and Fixing the {Needham-Schroeder} Public-Key Protocol Using {FDR}", booktitle = "Proc.\ Workshop on Tools and Algorithms for Construction and Analysis of Systems (TACAS)", editor = "Tiziana Margaria and Bernhard Steffen", pages = "147--166", year = "1996", month = mar, series = lncs, volume = "1055", publisher = "Springer", } @TechReport{lucchesi72tr, author = "C. L. Lucchesi", title = "The Undecidability of Unification for Third Order Languages", institution = "Dept of Applied Analysis and Computer Science, University of Waterloo", number = "Report C S R R 2059", year = "1972", } @InProceedings{luckham70lnm, author = "D. Luckham", title = "Refinement Theorems in Resolution Theory", booktitle = "Symposium on Automatic Demonstration", series = "Lecture Notes in Mathematics", number = "125", year = "1970", publisher = "Springer Verlag", address = "Berlin", pages = "163--190", } @Unpublished{lutovac.unp, title = "A Contribution to Automated-oriented Reasoning about Permutability of Sequent Calculi Rules", author = "Tatjana Lutovac and James Harland", year = "2011", note = "Submitted", } @InProceedings{lynch04csl, author = "Christopher Lynch", title = "Unsound Theorem Proving", booktitle = "Procedings of the 13th Annual EACS Conference on Computer Science Logic", pages = "473--487", year = "2004", doi = "10.1007/978-3-540-30124-0\_36", editor = "Jerzy Marcinkowski and Andrzej Tarlecki", series = "Lecture Notes in Computer Science", volume = "3210", publisher = "Springer", } @Book{mackenzie01mit, author = "Donald MacKenzie", title = "Mechanizing Proof", publisher = "MIT Press", year = "2001", } @Book{maclane71, author = "S. MacLane", title = "Categories for the Working Mathematician", publisher = "Springer", address = "New York", series = "Graduate Texts in Mathematics", year = "1971", } @Unpublished{macqueen88sml, author = "David B. MacQueen", title = "References and Weak Polymorphism", year = "1988", note = "Standard ML of New Jersey compiler release notes", } @InProceedings{madiot14concur, author = "Jean{-}Marie Madiot and Damien Pous and Davide Sangiorgi", title = "Bisimulations Up-to: Beyond First-Order Transition Systems", booktitle = "Proceedings of the 25th International Conference on Concurrency Theory (CONCUR)", year = "2014", pages = "93--108", doi = "10.1007/978-3-662-44584-6\_8", editor = "Paolo Baldan and Daniele Gorla", series = lncs, year = "2014", volume = "8704", publisher = pub-sv, } @Article{maehara54nmj, author = "S. Maehara", title = "Eine Darstellung der intuitionistischen Logik in der klassischen", journal = "Nagoya Mathematical Journal", year = "1954", pages = "45--64", } @Article{maehara55jmsj, author = "S. Maehara", title = "The predicate calculus with $\epsilon$-symbol", journal = "Journal of the Mathematical Society of Japan", year = "1955", volume = "7", number = "4", pages = "323--344", } @Book{maes87, editor = "P. Maes and D. Nardi", title = "Meta-Level Architectures and Reflection", publisher = "North-Holland", year = "1987", } @InCollection{magnusson94tpp, author = "Lena Magnusson and Bengt Nordstr{\"o}m", title = "The {ALF} proof editor and its proof engine", editor = "Henk Barendregt and Tobias Nipkow", booktitle = "Types for Proofs and Programs", publisher = "Springer", series = lncs, number = "806", year = "1994", pages = "213--237", } @Article{mahboubi21lmcs, author = "Assia Mahboubi and Thomas Sibut-Pinote", title = "A formal proof of the irrationality of $\zeta(3)$", journal = "Logical Methods in Computer Science", year = "2021", volume = "17", number = "1", pages = "1--25", doi = "10.23638/LMCS-17(1:16)2021", } @InProceedings{maher88lics, author = "Michael J. Maher", title = "Complete Axiomatizations of the Algebras of Finite Rational and Infinite Trees", booktitle = lics88, pages = "348--357", year = "1988", } @InCollection{maier18dlp, author = "David Maier and K. Tuncay Tekle and Michael Kifer and David S. Warren", title = "Datalog: Concepts, History, and Outlook", booktitle = "Declarative Logic Programming", editor = "Michael Kifer and Yanhong Annie Liu", year = "2018", ISBN = "978-1-970001-99-0", pages = "3--100", URL = "https://doi.org/10.1145/3191315.3191317", doi = "10.1145/3191315.3191317", publisher = "Association for Computing Machinery and Morgan \&\#38; Claypool", address = "New York, NY, USA", } @Book{maier88book, author = "David Maier and David S. Warren", title = "Computing with Logic: Logic Programming with {Prolog}", publisher = "Addison-Wesley", address = "Reading, MA", year = "1988", } @Article{mairson04jfp, author = "Harry G. Mairson", title = "Linear lambda calculus and {PTIME}-completeness", journal = "J. Funct. Program.", volume = "14", number = "6", year = "2004", ISSN = "0956-7968", pages = "623--633", doi = "10.1017/S0956796804005131", publisher = "Cambridge University Press", address = "New York, NY, USA", } @InProceedings{makarov97lfcs, author = "Evgeny Makarov", title = "A Proof Procedure for Hereditary {Harrop} Formulas with Free Equality", booktitle = "LFCS '97: Proceedings of the 4th International Symposium on Logical Foundations of Computer Science", year = "1997", pages = "203--213", publisher = "Springer", address = "London, UK", } @InProceedings{maksimovic15itp, author = "Petar Maksimovi\'c and Alan Schmitt", title = "{HOC}ore in Coq", booktitle = "Interactive Theorem Proving - 6th International Conference, {ITP} 2015, Nanjing, China, August 24-27, 2015, Proceedings", pages = "278--293", year = "2015", URL = "https://doi.org/10.1007/978-3-319-22102-1\_19", doi = "10.1007/978-3-319-22102-1\_19", number = "9236", series = lncs, publisher = pub-sv, } @InProceedings{malesieux98jicslp, author = "Fr\'ed\'eric Mal\'esieux and Olivier Ridoux and Patrice Boizumault", title = "Abstract compilation of {$\lambda$Prolog}", booktitle = "Proceedings of the 1998 Joint International Conference and Symposium on Logic Programming", editor = "Joxan Jaffar", pages = "130--144", year = "1998", } @InProceedings{manighetti21types, author = "Matteo Manighetti and Dale Miller and Alberto Momigliano", title = "{Two Applications of Logic Programming to Coq}", booktitle = "26th International Conference on Types for Proofs and Programs (TYPES 2020)", pages = "10:1--10:19", series = "Leibniz International Proceedings in Informatics (LIPIcs)", ISBN = "978-3-9597718-2-5", ISSN = "1868-8969", year = "2021", volume = "188", editor = "Ugo de'Liguoro and Stefano Berardi and Thorsten Altenkirch", publisher = "Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik", address = "Dagstuhl, Germany", URL = "https://drops.dagstuhl.de/opus/volltexte/2021/13889", doi = "10.4230/LIPIcs.TYPES.2020.10", } @TechReport{manighetti22hal, author = "Matteo Manighetti and Dale Miller", title = "Computational logic based on linear logic and fixed points", institution = "HAL", year = "2022", number = "hal-03579451", URL = "https://hal.inria.fr/hal-03579451", } @PhdThesis{manighetti22phd, author = "Matteo Manighetti", title = "Developing proof theory for proof exchange", school = "Institut Polytechnique de Paris", year = "2022", URL = "https://theses.hal.science/tel-04289251", } @Book{manna12book, title = "Temporal verification of reactive systems: safety", author = "Zohar Manna and Amir Pnueli", year = "2012", publisher = "Springer Science \& Business Media", } @Article{manna80, author = "Zohar Manna and Richard Waldinger", title = "A Deductive Approach to Program Synthesis", journal = "{ACM} Transactions on Programming Languages and Systems", volume = "2", number = "1", year = "1980", pages = "90--121", } @Book{manna85, author = "Zohar Manna and Richard Waldinger", title = "The Logical Basis for Computer Programming", publisher = "Addison Wesley", volume = "1", year = "1985", } @InProceedings{mantovani21lopstr, author = "Marco Mantovani and Alberto Momigliano", title = "Towards Substructural Property-Based Testing", booktitle = "Logic-Based Program Synthesis and Transformation: 31st International Symposium (LOPSTR 2021)", year = "2021", doi = "10.1007/978-3-030-98869-2_6", pages = "92--112", publisher = "Springer", } @Article{maraist99tcs, author = "John Maraist and Martin Odersky and David N. Turner and Philip Wadler", title = "Call-by-Name, Call-by-Value, Call-by-Need and the Linear Lambda Calculus", journal = "Theoretical Computer Science", publisher = "Elsevier Publishers B.V.", year = "1999", volume = "228", number = "1--2", pages = "175--210", } @Book{marek93book, author = "W. Marek and M. Truszczy\'{n}ski", title = "{Nonmonotonic Logics: Context-Dependent Reasoning}", year = "1993", publisher = "Berlin: Springer-Verlag", } @InProceedings{marin16aiml, author = "Sonia Marin and Dale Miller and Marco Volpe", title = "A focused framework for emulating modal proof systems", URL = "https://hal.archives-ouvertes.fr/hal-01379624", booktitle = "{11th Conference on Advances in Modal Logic}", address = "Budapest, Hungary", editor = "Lev Beklemishev and St{\'e}phane Demri and Andr{\'a}s M{\'a}t{\'e}", publisher = "{College Publications}", series = "Advances in Modal Logic", number = "11", pages = "469--488", year = "2016", month = Aug, keywords = "Focusing ; Labeled proof systems ; Modal logic ; Sequent calculi", pdf = "https://hal.archives-ouvertes.fr/hal-01379624/file/aiml2016.pdf", hal_id = "hal-01379624", hal_version = "v1", } @PhdThesis{marin18phd, author = "Sonia Marin", title = "Modal proof theory through a focused telescope", school = "University of Paris-Saclay", year = "2018", month = jan, } @Article{marin22apal, author = "Sonia Marin and Dale Miller and Elaine Pimentel and Marco Volpe", title = "From axioms to synthetic inference rules via focusing", journal = apal, doi = "10.1016/j.apal.2022.103091", volume = "173", number = "5", pages = "1--32", year = "2022", } @InCollection{marion09games, author = "Mathieu Marion", title = "Why Play Logical Games?", editor = "Ahti-Veikko Pietarinen Ondrej Majer and Tero Tulenheimo", booktitle = "Games: Unifying Logic, Language, and Philosophy", publisher = "Springer", year = "2009", volume = "15", series = "Logic, Epistemology, and The Unity of Science", pages = "3--26", } @Book{marsan95book, author = "M. Ajmone Marsan and G. Balbo and G. Conte and S. Donatelli and G. Francenschinis", title = "Modelling with Generalised Stochastic {P}etri Nets", publisher = "Wiley and Sons", year = "1995", series = "Wiley Series in Parallel Computing", } @Article{martelli82, author = "Alberto Martelli and Ugo Montanari", title = "An Efficient Unification Algorithm", journal = "ACM Transactions on Programming Languages and Systems", volume = "4", number = "2", month = apr, year = "1982", pages = "258--282", } @InProceedings{marti-oliet91sri, author = "N.~Marti-Oliet and Jos\'e Meseguer", title = "From petri nets to linear logic through categories: {A} survey", institution = "SRI International", number = "SRI-CSL-91-07", month = apr, year = "1991", } @InProceedings{martin-lof71sls, author = "Per Martin-L{\"{o}}f", title = "Hauptsatz for the intuitionistic theory of iterated inductive definitions", booktitle = "Proceedings of the Second Scandinavian Logic Symposium", editor = "J. E. Fenstad", publisher = "North-Holland", series = "Studies in Logic and the Foundations of Mathematics", volume = "63", pages = "179--216", year = "1971", } @Article{martini94jsl, author = "Simone Martini and Andrea Masini", title = "A Modal View of Linear Logic", journal = "Journal of Symbolic Logic", volume = "59", number = "3", year = "1994", pages = "888--899", } @InProceedings{martini95all, author = "Simone Martini and Andrea Masini", title = "On the fine structure of the exponential rule", booktitle = "Advances in linear logic", editor = "J.-Y. Girard and Y. Lafont and L. Regnier", year = "1995", pages = "197--210", publisher = "Cambridge University Press", address = "New York, NY, USA", } @InProceedings{martinlof82, author = "Per Martin-L{\"{o}}f", title = "Constructive Mathematics and Computer Programming", booktitle = "Sixth International Congress for Logic, Methodology, and Philosophy of Science", pages = "153--175", publisher = "North-Holland", address = "Amsterdam", year = "1982", } @Book{martinlof84, author = "Per Martin-L{\"{o}}f", title = "Intuitionistic Type Theory", publisher = "Bibliopolis", address = "Napoli", series = "Studies in Proof Theory Lecture Notes", year = "1984", } @InCollection{martinlof85, author = "Per Martin-L{\"{o}}f", editor = "C. A. R. Hoare and J. C. Shepherdson", title = "Constructive Mathematics and Computer Programming", booktitle = "Mathematical Logic and Programming Languages", pages = "167--184", publisher = "Prentice-Hall", year = "1985", } @InCollection{martinlof94, author = "Per Martin-L{\"o}f", title = "Analytic and Synthetic Judgements in Type Theory", booktitle = "Kant and Contemporary Epistemology", publisher = "Kluwer Academic Publishers", year = "1994", editor = "P. Parrini", pages = "87--99", } @Article{martinlof96, author = "Per Martin-L{\"o}f", title = "On the Meanings of the Logical Constants and the Justifications of the Logical Laws", journal = "Nordic Journal of Philosophical Logic", year = "1996", volume = "1", number = "1", pages = "11--60", URL = "https://www.hf.uio.no/filosofi/njpl/vol1no1/meaning/meaning.html", note = "Lecture notes to a short course at Universit{\`a} degli Studi di Siena, April 1983", } @Article{maslov64danssr, author = "S. Yu Maslov", title = "An inverse method of establishing deducibility in the classical predicate calculus", journal = "Dokl. Akad. Nauk. SSSR", year = "1964", volume = "159", pages = "17--20", } @InProceedings{mason92lics, author = "Ian A. Mason and Carolyn L. Talcott", title = "References, Local Variables and Operational Reasoning", editor = "A. Scedrov", booktitle = lics92, pages = "186--197", year = "1992", } @InProceedings{masseron90fst, author = "M.~Masseron and C.~Tollu and J.~Vauzielles", title = "Generating plans in linear logic", booktitle = "Foundations of Software Technology and Theoretical Computer Science", year = "1990", publisher = "Springer", series = lncs, pages = "63--75", } @Article{masseron93tcsA, author = "M. Masseron and C. Tollu and J. Vauzeilles", title = "Generating Plans in Linear Logic: {I}. Actions as proofs", journal = "Theoretical Computer Science", volume = "113", month = jun, year = "1993", note = "To appear.", } @Article{masseron93tcsB, author = "M. Masseron", title = "Generating Plans in Linear Logic : {II}. {A} geometry of conjunctive actions", journal = "Theoretical Computer Science", volume = "113", month = jun, year = "1993", note = "To appear.", } @InProceedings{matiyasevich05cie, author = "Yuri Matiyasevich", title = "Hilbert’s Tenth Problem and Paradigms of Computation", booktitle = "CiE: Computing in Europe", year = "2005", editor = "S. B. Cooper and B. L{\"o}we and L. Torenvliet", number = "3526", series = lncs, pages = "310--321", publisher = "Springer", } @Book{matiyasevich93book, title = "Hilbert's Tenth Problem", author = "Yu. V. Matiyasevich", publisher = "MIT Press", address = "Cambridge, Massachusetts", year = "1993", } @InCollection{matthes98csl, author = "Ralph Matthes", title = "Monotone Fixed-Point Types and Strong Normalization", booktitle = csl98, volume = "1584", publisher = pub-sv, address = "Berlin", editor = "Georg Gottlob and Etienne Grandjean and Katrin Seyr", pages = "298--312", year = "1999", series = lncs, } @PhdThesis{matthes98phd, author = "Ralph Matthes", title = "Extensions of System {F} by Iteration and Primitive Recursion on Monotone Inductive Types", school = "Ludwig-Maximilians Universit{\"a}t", year = "1998", month = may, pdf = "https://www.irit.fr/~Ralph.Matthes/dissertation/matthesdiss.pdf", } @InCollection{matthews93le, author = "Sean Matthews and Alan Smaill and David Basin", title = "Experience with ${FS}_0$ as a framework theory", editor = "G. Huet and G. D. Plotkin", booktitle = "Logical Environments", publisher = "Cambridge University Press", year = "1993", pages = "61--82", } @InProceedings{matthews97cade, author = "Se\'{a}n Matthews", title = "A practical implementation of simple consequence relations using inductive definitions", booktitle = cade97, publisher = "Springer", month = jul, year = "1997", } @InProceedings{mauny86, author = "M. Mauny and A. Su\'{a}rez", title = "Implementing Functional Languages in the Categorical Abstract Machine", booktitle = "Proceedings of the 1986 Symposium on Lisp and Functional Programming", year = "1986", } @Article{mcallester02jacm, author = "David A. McAllester", title = "On the complexity analysis of static analyses", journal = "J. ACM", volume = "49", number = "4", year = "2002", pages = "512--537", } @InProceedings{mcallester03rta, author = "D. McAllester", title = "A Logical Algorithm for {ML} Type Inference", pages = "436--451", year = "2003", editor = "R. Nieuwenhuis", booktitle = "Rewriting Techniques and Applications, 14th International Conference, {RTA}-03", address = "Valencia, Spain", series = lncs, volume = "2706", publisher = "Springer", } @InProceedings{mcbride04haskell, title = "Functional pearl: {I} am not a number - {I} am a free variable", author = "Conor McBride and James McKinna", booktitle = "Proceedings of the ACM SIGPLAN Workshop on Haskell, Haskell 2004, Snowbird, UT, USA, September 22-22, 2004", publisher = "ACM", year = "2004", editor = "Henrik Nilsson", pages = "1--9", URL = "https://doi.acm.org/10.1145/1017472.1017477", } @PhdThesis{mccabe89phd, author = "F. G. McCabe", title = "Logic and Objects: Language, application, and implementation", school = "Imperial College of Science and Technology", year = "1989", } @InCollection{mccarthy63ip, title = "Towards a Mathematical Science of Computation", author = "J. McCarthy", pages = "21--28", booktitle = "Information Processing", publisher = "North-Holland", editor = "C. M. Popplewell", year = "1963", } @InCollection{mccarthy69, author = "J. McCarthy and P. J. Hayes", editor = "B. Meltzer and D. Michie", title = "Some Philosophical Problems From the Standpoint of Artificial Intelligence", booktitle = "Machine Intelligence", volume = "4", publisher = "Edinburgh University Press", address = "Edinburgh", year = "1969", } @TechReport{mccarthy82tr, author = "John McCarthy", title = "Coloring maps and the Kowalski doctrine", year = "1982", month = apr, number = "STAN-CS-82-903", URL = "https://www-formal.stanford.edu/jmc/coloring/coloring.html", publisher = "Stanford University", address = "Stanford, CA, USA", } @InCollection{mccarthy89, author = "John McCarthy", booktitle = "Philosophical Logic and Artificial Intelligence", editor = "Richmond Thomason", publisher = "Kluwer Academic", title = "Artificial Intelligence, Logic and Formalizing Common Sense", year = "1989", URL = "https://www-formal.stanford.edu/jmc/ailogic.dvi", } @TechReport{mccarty87, author = "Charles McCarty", title = "{Variations on a Thesis: Intuitionism and Computability}", number = "CSR-245-87", institution = "University of Edinburgh", month = aug, year = "1987", } @Article{mccarty88a, author = "L. T. McCarty", title = "Clausal Intuitionistic Logic {I}. {Fixed} Point Semantics", journal = "Journal of Logic Programming", volume = "5", year = "1988", pages = "1--31", } @Article{mccarty88b, author = "L. T. McCarty", title = "Clausal Intuitionistic Logic {II}. {Tableau} Proof Procedure", journal = "Journal of Logic Programming", volume = "5", year = "1988", pages = "93--132", } @Article{mccreight08entcs, title = "A Meta Linear Logical Framework", author = "Andrew McCreight and Carsten Sch{\"u}rmann", journal = entcs, year = "2008", volume = "199", pages = "129--147", } @InCollection{mccune00car, title = "{IVY}: {A} preprocessor and proof checker for first-order logic", author = "William McCune and Olga Shumsky", booktitle = "Computer-Aided reasoning", pages = "265--281", year = "2000", publisher = "Springer", } @TechReport{mccune03tr, author = "William McCune", title = "Mace4 Reference Manual and Guide", institution = "CoRR", number = "cs.SC/0310055", year = "2003", URL = "https://arxiv.org/abs/cs.SC/0310055", } @Article{mcdowell00tcs, author = "Raymond McDowell and Dale Miller", title = "Cut-elimination for a logic with definitions and induction", journal = "Theoretical Computer Science", volume = "232", pages = "91--119", year = "2000", doi = "10.1016/S0304-3975(99)00171-1", } @Article{mcdowell02tocl, author = "Raymond McDowell and Dale Miller", title = "Reasoning with Higher-Order Abstract Syntax in a Logical Framework", journal = tocl, year = "2002", volume = "3", number = "1", pages = "80--136", doi = "10.1145/504077.504080", pdf = "https://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/mcdowell01.pdf", } @Article{mcdowell03tcs, author = "Raymond McDowell and Dale Miller and Catuscia Palamidessi", title = "Encoding transition systems in sequent calculus", journal = "Theoretical Computer Science", year = "2003", volume = "294", number = "3", pages = "411--437", doi = "10.1016/S0304-3975(01)00168-2", } @Article{mcdowell96llw, author = "Raymond McDowell and Dale Miller and Catuscia Palamidessi", title = "Encoding Transition Systems in Sequent Calculus: Preliminary Report", journal = entcs, volume = "3", year = "1996", } % pdf = "https://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/tcs97.pdf", % ps = "https://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/tcs97.ps", @InProceedings{mcdowell97lics, author = "Raymond McDowell and Dale Miller", title = "A Logic for Reasoning with Higher-Order Abstract Syntax", year = "1997", booktitle = lics97, editor = "Glynn Winskel", month = jul, pages = "434--445", address = "Warsaw, Poland", organization = "IEEE Computer Society Press", } @PhdThesis{mcdowell97phd, author = "Raymond McDowell", title = "Reasoning in a Logic with Definitions and Induction", school = "University of Pennsylvania", year = "1997", month = dec, } @InProceedings{mcevoy95plilp, author = "Hugh McEvoy and Pieter H. Hartel", title = "Local Linear Logic for Locality Consciousness in Multiset Transformation", booktitle = "PLILP", year = "1995", pages = "357--379", } @InProceedings{mckinley08clac, author = "Richard McKinley", title = "Herbrand expansion proofs and proof identity", booktitle = "Classical Logic and Computation (CL\&C) 2008, participant's proceedings", URL = "https://wwwhomes.doc.ic.ac.uk/~svb/CLaC08/programme.html", year = "2008", } @InProceedings{mckinley10lpar, author = "Richard McKinley", title = "Expansion Nets: Proof-Nets for Propositional Classical Logic", year = "2010", pages = "535--549", editor = "Christian G. Ferm{\"u}ller and Andrei Voronkov", booktitle = "LPAR: Logic for Programming, Artificial Intelligence, and Reasoning", publisher = "Springer", series = lncs, volume = "6397", address = "Yogyakarta, Indonesia", month = oct, } @Article{mckinley13tocl, author = "Richard McKinley", title = "Proof Nets for {H}erbrand's Theorem", journal = tocl, year = "2013", volume = "14", number = "1", note = "To appear", } @Article{mckinna99jar, author = "James McKinna and Robert Pollack", title = "Some Lambda Calculus and Type Theory Formalized", journal = "Journal of Automated Reasoning", year = "1999", volume = "23", number = "3", pages = "373--409", } @InProceedings{mclaughlin08lpar, author = "Sean McLaughlin and Frank Pfenning", title = "Imogen: Focusing the Polarized Focused Inverse Method for Intuitionistic Propositional Logic", booktitle = "15th International Conference on Logic, Programming, Artificial Intelligence and Reasoning (LPAR)", year = "2008", editor = "Iliano Cervesato and Helmut Veith and Andrei Voronkov", month = nov, pages = "174--181", series = lncs, volume = "5330", URL = "https://www.cs.cmu.edu/~seanmcl/papers/McLaughlin-LPAR-2008.pdf", } @InProceedings{mclaughlin09ijcar, author = "Sean McLaughlin and Frank Pfenning", editor = "Renate A. Schmidt", booktitle = "Proceedings of the 22nd International Conference on Automated Deduction", series = lncs, volume = "5663", publisher = pub-sv, pages = "230--244", doi = "10.1007/978-3-642-02959-2\_19", title = "Efficient Intuitionistic Theorem Proving with the Polarized Inverse Method", year = "2009", } @Article{meadows96jlp, author = "Catherine Meadows", title = "The {NRL} Protocol Analyzer: An Overview", journal = "Journal of Logic Programming", year = "1996", volume = "26", number = "2", pages = "113--131", month = feb, } @TechReport{mehats09hal, URL = "https://hal.inria.fr/hal-00649591", institution = "INRIA", number = "hal-00649591", title = "{Non-crossing tree realizations of ordered degree sequences}", author = "Laurent M\'ehats and Lutz Stra{\ss}burger", pages = "15", type = "Research Report", year = "2009", month = Dec, pdf = "https://hal.inria.fr/hal-00649591/PDF/noncrosstree-17-12-09.pdf", } @InProceedings{mehats16lacl, title = "{Non-crossing Tree Realizations of Ordered Degree Sequences}", author = "Laurent Mehats and Lutz Stra{\ss}burger", URL = "https://hal.inria.fr/hal-01417567", booktitle = "{LACL 2016 - 9th International Conference Logical Aspects of Computational Linguistics - Celebrating 20 Years of LACL (1996--2016)}", address = "Nancy, France", editor = "Maxime Amblard and Philippe de Groote and Sylvain Pogodalla and Christian Retor{\'e}", publisher = "{Springer}", series = lncs, volume = "10054", year = "2016", month = Dec, doi = "10.1007/978-3-662-53826-5\_13", keywords = "Proof nets ; Non-crossing trees ; Integer sequences ; Catalan’s triangle ; Pascal-Catalan-tetrahedron", hal_id = "hal-01417567", hal_version = "v1", } @InProceedings{meier00cade, author = "Andreas Meier", title = "System Description: {TRAMP}: Transformation of Machine-Found Proofs into {ND}-Proofs at the Assertion Level.", booktitle = "CADE", year = "2000", pages = "460--464", } @InProceedings{meijer88, author = "Eric Meijer", title = "A Taxonomy of Function Evaluating Machines", booktitle = "Proceedings of the Workshop on Implementation of Lazy Functional Languages", year = "1988", editor = "T. Johnsson and S. {Peyton Jones} and K. Karlsson", pages = "235--265", organization = "Programming Methodology Group", } @InProceedings{meijer95fpca, title = "Bananas in Space: Extending Fold and Unfold to Exponential Types", author = "Erik Meijer and Graham Hutton", year = "1995", series = "FPCA", pages = "324--333", note = "https://www.iscm.ulst.ac.uk/~george/subjects/fp/papers.html", } @InProceedings{melham91bra, author = "T. F. Melham", title = "A Mechanized Theory of the $\pi$-calculus in {HOL}", booktitle = "Informal Proceedings of the Second Logical Framework Workshop", editor = "G. Huet and G. Plotkin and N. Jones", month = may, year = "1991", } @InProceedings{melham92hol, author = "Thomas F. Melham", title = "{A} Package for Inductive Relation Definitions in {HOL}", year = "1992", editor = "{M. Archer, J. J. Joyce, K. N. Levitt} and P. J. Windley", pages = "350--357", publisher = "IEEE Computer Society Press", booktitle = "Proceedings of the 1991 International Workshop on the HOL Theorem Proving System and its Applications, Davis, August 1991", } @Article{melham95njc, author = "T. F. Melham", title = "A Mechanized Theory of the $\pi$-calculus in {HOL}", journal = "Nordic Journal of Computing", year = "1995", volume = "1", number = "1", pages = "50--76", } @Article{mellies04tcs, author = "Paul-Andr\'e Melli\`es", title = "Asynchronous games 2: The true concurrency of innocence", journal = "Theoretical Computer Science", volume = "358", number = "2--3", year = "2004", pages = "200--228", } @InProceedings{mellies16lics, title = "{A bifibrational reconstruction of Lawvere's presheaf hyperdoctrine}", author = "Paul-Andr{\'e} Melli{\`e}s and Noam Zeilberger", URL = "https://hal.archives-ouvertes.fr/hal-01261955", booktitle = "{IEEE/ACM Logic in Computer Science (LICS) 2016}", address = "New York, United States", series = "Proceedings of LICS'16", year = "2016", month = Jun, keywords = "Lawvere’s presheaf hyperdoctrine ; monoidal closed bifibrations ; type refinement systems ; monoidal closed chiralities ; linear logic", hal_id = "hal-01261955", hal_version = "v1", } @Article{mellies182018, author = "Paul-Andr\'e Melli\`es and Nicolas Tabareau and Christine Tasson", title = "An explicit formula for the free exponential modality of linear logic", journal = "Mathematical Structures in Computer Science", year = "2018", volume = "28", number = "7", pages = "1253--1286", } @PhdThesis{mendler87phd, author = "Paul Francis Mendler", title = "Inductive Definition in Type Theory", school = "Cornell University", year = "1987", } @Article{mendler91apal, author = "N. P. Mendler", title = "Inductive Types and Type Constraints in the Second Order Lambda Calculus", journal = apal, year = "1991", volume = "51", number = "1", pages = "159--172", } @Article{meng06ic, author = "Jia Meng and Claire Quigley and Lawrence C. Paulson", title = "Automation for interactive proof: first prototype", journal = "Inf. Comput.", volume = "204", number = "10", year = "2006", ISSN = "0890-5401", pages = "1575--1596", doi = "10.1016/j.ic.2005.05.010", publisher = "Academic Press, Inc.", address = "Duluth, MN, USA", } @PhdThesis{meng15phd, author = "Jia Meng", title = "The integration of higher order interactive proof with first order automatic theorem proving", school = "University of Cambridge, Computer Laboratory", year = "2015", URL = "https://www.cl.cam.ac.uk/techreports/UCAM-CL-TR-872.pdf", key = "UCAM-CL-TR-872", } @InProceedings{merkle87crypto, title = "A Digital Signature Based on a Conventional Encryption Function", author = "Ralph C. Merkle", pages = "369--378", booktitle = "Advances in Cryptology---CRYPTO~'87", series = lncs, volume = "293", year = "1987", month = aug, editor = "Carl Pomerance", publisher = "Springer-Verlag, 1988", } @Article{meyer81, author = "Albert Meyer", title = "What is a Model of the Lambda Calculus?", journal = "Information and Control", volume = "52", number = "1", pages = "87--122", year = "1981", } @InProceedings{meyer88popl, author = "Albert R. Meyer and Kurt Sieber", title = "Towards Fully Abstract Semantics for Local Variables: Preliminary Report", booktitle = "Proc.\ $15^{th}$ Annual {ACM} Symp. on Principles of Programming Languages", year = "1988", pages = "191--203", address = "San Diego", publisher = "ACM", } @TechReport{michaylov89, author = "Spiro Michaylov and Frank Pfenning", title = "Compiling the Polymorphic {$\lambda$}-Calculus", institution = "School of Computer Science, Carnegie Mellon University", address = "Pittsburgh, Pennsylvania", type = "Ergo Report", number = "89-088", month = nov, year = "1989", } @InProceedings{michaylov91, author = "Spiro Michaylov and Frank Pfenning", title = "Natural Semantics and Some of its Meta-Theory in {Elf}", booktitle = "Extensions of Logic Programming", editor = "Lars-Henrik Eriksson and Lars Hallnäs and Peter Schroeder-Heister", publisher = "Springer", series = lncs, year = "1992", } @InProceedings{michaylov92lpw, author = "Spiro Michaylov and Frank Pfenning", title = "An Empirical Study of the Runtime Behavior of Higher-Order Logic Programs", booktitle = "Conference Record of the Workshop on the {$\lambda$Prolog} Programming Language", address = "Philadelphia", month = jul, year = "1992", } @InProceedings{millen84ssp, author = "Jonathan K. Millen", title = "The Interrogator: {A} tool for cryptographic protocol security", booktitle = "Proceedings of the 1984 IEEE Symposium on Security and Privacy", pages = "134--141", year = "1984", month = apr, publisher = "IEEE Computer Society", } @Unpublished{miller.sml, author = "Dale Miller", title = "Semantics of a simple meta-logic", month = mar, year = "1990", note = "Unpublished draft", } @InProceedings{miller00cl, author = "Dale Miller", title = "Abstract Syntax for Variable Binders: An Overview", booktitle = "CL 2000: Computational Logic", pages = "239--253", year = "2000", editor = "John Lloyd and {\em et al.}", number = "1861", series = lnai, publisher = "Springer", URL = "https://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/cl2000.pdf", } @InProceedings{miller01entcs, author = "Dale Miller", title = "Encoding Generic Judgments: Preliminary results", series = "ENTCS", volume = "58", publisher = "Elsevier Science Publishers", editor = "R. L. Crole and S. J. Ambler and A. Momigliano", booktitle = "Proceedings of the MERLIN 2001 Workshop, Siena", year = "2001", } @InProceedings{miller02amast, author = "Dale Miller", title = "Higher-order quantification and proof search", booktitle = "Proceedings of AMAST 2002", pages = "60--74", year = "2002", editor = "H\'el\`ene Kirchner and Christophe Ringeissen", number = "2422", series = lncs, pdf = "https://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/amast02.pdf", } @InProceedings{miller02fsttcs, author = "Dale Miller and Alwen Tiu", title = "Encoding Generic Judgments", booktitle = "Proceedings of FSTTCS", pages = "18--32", year = "2002", publisher = "Springer", series = lncs, number = "2556", month = dec, URL = "https://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/fsttcs02.pdf", } @Misc{miller02llw, author = "Dale Miller", title = "Higher-order quantification and proof search: an extended abstract", month = jul, year = "2002", note = "Presented at Linear Logic 2002, FLoC, Copenhagen", } @InProceedings{miller02tableaux, author = "Dale Miller and Elaine Pimentel", title = "Using linear logic to reason about sequent systems", pages = "2--23", editor = "Uwe Egly and Christian G. Ferm{\"u}ller", booktitle = "International Conference on Automated Reasoning with Analytic Tableaux and Related Methods", publisher = "Springer", series = lncs, volume = "2381", year = "2002", URL = "https://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/tableaux02.pdf", } @InProceedings{miller03fcs, author = "Dale Miller", title = "Encryption as an Abstract Data-Type: An extended abstract", booktitle = "Proceedings of FCS'03: Foundations of Computer Security", editor = "Iliano Cervesato", pages = "18--29", year = "2003", series = entcs, volume = "84", publisher = "Elsevier", doi = "10.1016/S1571-0661(04)80841-7", URL = "https://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/fcs03.pdf", } @InProceedings{miller03lics, author = "Dale Miller and Alwen Tiu", title = "A Proof Theory for Generic Judgments: An extended abstract", booktitle = lics03, pages = "118--127", editor = "Phokion Kolaitis", year = "2003", month = jun, publisher = "IEEE", URL = "https://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/lics03.pdf", } @InProceedings{miller03tphols, author = "Dale Miller", title = "Reasoning about proof search specifications: An abstract", booktitle = "Theorem Proving in Higher Order Logics: 16th International Conference, TPHOLs 2003", pages = "204", year = "2003", volume = "2758", series = lncs, publisher = "Springer", note = "Invited speaker", URL = "https://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/tphols03talk.pdf", } @InProceedings{miller03unif, author = "Dale Miller", title = "Definitions, Unification, and the Sequent Calculus", booktitle = "Proceedings of the 17th International Workshop on Unification, UNIF'03", pages = "1--2", year = "2003", editor = "J. Levy and M. Kohlhase and J. Niehren and M. Villaret", series = "Technical Report DSIC-II/12/03", month = jun, organization = "Departamento de Sistemas Inform{\`a}tics i Computaci{\'o} Universidad Polit{\`e}cnica de Val{\`e}ncia", note = "Invited talk", } @InProceedings{miller03wollic, author = "Dale Miller", title = "Encryption as an abstract data type", booktitle = "WoLLIC'2003, 10th Workshop on Logic, Language, Information and Computation", series = entcs, volume = "84", publisher = "Elsevier", editor = "Ruy de Queiroz and Elaine Pimentel and Lucilia Figueiredo", note = "Invited talk", year = "2003", } @InProceedings{miller04csl, author = "Dale Miller", title = "Bindings, mobility of bindings, and the $\nabla$-quantifier", booktitle = "18th International Conference on Computer Science Logic {(CSL)} 2004", pages = "24", year = "2004", editor = "Jerzy Marcinkowski and Andrzej Tarlecki", volume = "3210", series = lncs, pdf = "https://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/csl04talk.pdf", doi = "10.1007/978-3-540-30124-0\_4", } @InCollection{miller04lc, author = "Dale Miller and Elaine Pimentel", title = "Linear logic as a framework for specifying sequent calculus", booktitle = "Logic Colloquium '99: Proceedings of the Annual European Summer Meeting of the Association for Symbolic Logic", publisher = "A K Peters Ltd", series = "Lecture Notes in Logic", editor = "Jan van Eijck and Vincent van Oostrom and Albert Visser", pages = "111--135", year = "2004", URL = "https://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/lc99.pdf", } @InCollection{miller04llcs, author = "Dale Miller", editor = "Thomas Ehrhard and Jean-Yves Girard and Paul Ruet and Phil Scott", booktitle = "Linear Logic in Computer Science", title = "Overview of linear logic programming", publisher = "Cambridge University Press", series = "London Mathematical Society Lecture Note", volume = "316", year = "2004", pages = "119--150", URL = "https://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/llp.pdf", } @InProceedings{miller05apc, author = "Dale Miller", title = "A Proof Theoretic Approach to Operational Semantics", year = "2005", pages = "172--175", booktitle = "Algebraic Process Calculi: The First Twenty Five Years and Beyond", editor = "Luca Aceto and Andrew D. Gordon", month = aug, organization = "Bertinoro, Italy", URL = "ftp://ftp.daimi.au.dk/pub/BRICS/BRICS/Reports/NS/05/3/BRICS-NS-05-3.pdf", } @InProceedings{miller05galop, author = "Dale Miller and Alexis Saurin", title = "A game semantics for proof search: Preliminary results", booktitle = "GaLoP 2005: Games for Logic and Programming Languages", editor = "Dan Ghica and Guy McCusker", year = "2005", } @Article{miller05tocl, author = "Dale Miller and Alwen Tiu", title = "A proof theory for generic judgments", journal = tocl, editor = "Phokion Kolaitis", month = oct, volume = "6", number = "4", doi = "10.1145/1094622.1094628", pages = "749--783", publisher = "ACM Press", address = "New York, NY, USA", year = "2005", } @Misc{miller06alp, author = "Dale Miller", title = "Logic and Logic Programming: {A} Personal Account", howpublished = "ALP Newsletter", month = feb, year = "2006", note = "Vol.\ 19, No.\ 1", URL = "https://www.cs.kuleuven.ac.be/~dtai/projects/ALP/newsletter/feb06/nav/articles/Dale/dale.pdf", } % URL = "https://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/tocl-nabla.pdf", @InProceedings{miller06ijcar, author = "Dale Miller", title = "Representing and reasoning with operational semantics", booktitle = "Proceedings of IJCAR: International Joint Conference on Automated Reasoning", month = aug, year = "2006", pages = "4--20", editor = "U. Furbach and N. Shankar", series = lnai, volume = "4130", publisher = "Springer", URL = "https://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/ijcar06.pdf", } @InProceedings{miller06mfps, author = "Dale Miller and Alexis Saurin", title = "A game semantics for proof search: Preliminary results", booktitle = "Proceedings of the Mathematical Foundations of Programming Semantics (MFPS05)", pages = "543--563", number = "155", series = entcs, year = "2006", pdf = "https://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/mfps05.pdf", } @InProceedings{miller06ppdp, author = "Dale Miller", title = "Collection analysis for {Horn} clause programs", booktitle = "Proceedings of PPDP 2006: 8th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming", month = jul, pages = "179--188", year = "2006", URL = "https://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/ppdp06.pdf", doi = "10.1145/1140335.1140357", } @InProceedings{miller07csla, author = "Dale Miller and Vivek Nigam", title = "Incorporating tables into proofs", booktitle = csl07, editor = "J. Duparc and T. A. Henzinger", year = "2007", volume = "4646", series = lncs, publisher = pub-sv, pages = "466--480", pdf = "https://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/csl07nigam.pdf", doi = "10.1007/978-3-540-74915-8\_35", } @InProceedings{miller07cslb, author = "Dale Miller and Alexis Saurin", title = "From proofs to focused proofs: a modular proof of focalization in Linear Logic", booktitle = csl07, editor = "J. Duparc and T. A. Henzinger", volume = "4646", series = lncs, publisher = pub-sv, pages = "405--419", year = "2007", pdf = "https://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/csl07saurin.pdf", } @InCollection{miller08andrews, author = "Dale Miller", title = "A Proof-Theoretic Approach to the Static Analysis of Logic Programs", booktitle = "Reasoning in Simple Type Theory: Festschrift in Honor of Peter B. Andrews on His 70th Birthday", publisher = "College Publications", editor = "Christoph Benzm{\"u}ller and Chad E. Brown and J{\"o}rg Siekmann and Richard Statman", year = "2008", series = "Studies in Logic", number = "17", pages = "423--442", pdf = "https://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/andrews-festschrift-2007.pdf", } @Article{miller08beatcs, author = "Dale Miller", title = "Formalizing operational semantic specifications in logic", journal = "Concurrency Column of the Bulletin of the EATCS", year = "2008", editor = "Luca Aceto", month = oct, pdf = "https://www.ru.is/faculty/luca/BEATCS/miller.pdf", } @Unpublished{miller08unp, author = "Dale Miller and Vivek Nigam", title = "Proofs with tables", note = "Available via the authors web pages", year = "2008", } @InProceedings{miller09wflp, author = "Dale Miller", title = "Formalizing Operational Semantic Specifications in Logic", booktitle = "Proceedings of the 17th International Workshop on Functional and (Constraint) Logic Programming (WFLP 2008)", volume = "246", pages = "147--165", year = "2009", month = aug, doi = "10.1016/j.entcs.2009.07.020", } @InProceedings{miller10aplas, author = "Dale Miller", title = "Reasoning about Computations Using Two-Levels of Logic", year = "2010", booktitle = "{P}roceedings of the 8th {A}sian {S}ymposium on {P}rogramming {L}anguages and {S}ystems ({APLAS}'10)", editor = "K. Ueda", number = "6461", series = lncs, pages = "34--46", URL = "https://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/aplas10.pdf", } @InProceedings{miller10bcs, author = "Dale Miller", title = "Finding unity in computational logic", year = "2010", booktitle = "Proceedings of the 2010 ACM-BCS Visions of Computer Science Conference", series = "ACM-BCS '10", month = apr, pages = "3:1--3:13", publisher = "British Computer Society", URL = "https://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/unity2010.pdf", } @InProceedings{miller11cpp, author = "Dale Miller", title = "A proposal for broad spectrum proof certificates", booktitle = "CPP: First International Conference on Certified Programs and Proofs", year = "2011", editor = "J.-P. Jouannaud and Z. Shao", series = lncs, volume = "7086", pages = "54--69", doi = "10.1007/978-3-642-25379-9\_6", URL = "https://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/cpp11.pdf", } @Unpublished{miller11erc, author = "Dale Miller", title = "{ProofCert}: Broad Spectrum Proof Certificates", note = "An ERC Advanced Grant funded for the five years 2012-2016", URL = "https://www.lix.polytechnique.fr/Labo/Dale.Miller/ProofCert.pdf", month = feb, year = "2011", } @Proceedings{miller12fics, title = "Proceedings 8th Workshop on Fixed Points in Computer Science", year = "2012", editor = "Dale Miller and Zolt\'{a}n \'{E}sik", doi = "10.4204/EPTCS.77", URL = "https://eptcs.org/Published/FICS2012/Proceedings.pdf", volume = "77", series = eptcs, } @Book{miller12proghol, author = "Dale Miller and Gopalan Nadathur", title = "Programming with Higher-Order Logic", publisher = "Cambridge University Press", year = "2012", month = jun, doi = "10.1017/CBO9781139021326", } @InProceedings{miller13cpp, author = "Dale Miller and Alwen Tiu", title = "Extracting Proofs from Tabled Proof Search", booktitle = cpp13, year = "2013", editor = "Georges Gonthier and Michael Norrish", month = dec, publisher = pub-sv, series = lncs, number = "8307", pages = "194--210", URL = "https://hal.inria.fr/hal-00863561/", address = "Melburne, Australia", } @InProceedings{miller13lfmtp, author = "Dale Miller", title = "Foundational Proof Certificates: Making Proof Universal and Permanent", booktitle = "Proceedings of the 2013 ACM SIGPLAN Workshop on Logical Frameworks~\& Meta-Languages: Theory~\& Practice, LFMTP'13", pages = "1", year = "2013", editor = "Alberto Momigliano and Brigitte Pientka and Randy Pollack", month = sep, publisher = "ACM", URL = "https://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/lfmtp13.pdf", doi = "10.1145/2503887.2503894", } @Article{miller13tcs, author = "Dale Miller and Elaine Pimentel", title = "A formal framework for specifying sequent calculus proof systems", journal = tcs, year = "2013", doi = "10.1016/j.tcs.2012.12.008", volume = "474", pages = "98--116", URL = "https://hal.inria.fr/hal-00787586", } @TechReport{miller13tr, author = "Dale Miller and Alwen Tiu", title = "Extracting Proofs from Tabled Proof Search: Extended version", institution = "INRIA-HAL", year = "2013", URL = "https://hal.inria.fr/hal-00863561", } @InProceedings{miller14clmps, author = "Dale Miller", title = "Communicating and trusting proofs: The case for broad spectrum proof certificates", booktitle = "Logic, Methodology, and Philosophy of Science. Proceedings of the Fourteenth International Congress", year = "2014", editor = "P. Schroeder-Heister and W. Hodges and G. Heinzmann and P. E. Bour", pages = "323--342", publisher = "College Publications", } @InCollection{miller15appa, author = "Dale Miller", title = "Foundational Proof Certificates", pages = "150--163", year = "2015", month = jan, booktitle = "All about Proofs, Proofs for All", editor = "David Delahaye and Bruno Woltzenlogel Paleo", publisher = "College Publications", address = "London, UK", series = "Mathematical Logic and Foundations", volume = "55", ISBN = "978-1-84890-166-7", URL = "https://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/appa2014.pdf", } @InProceedings{miller15lopstr, author = "Dale Miller", title = "Proof Checking and Logic Programming", booktitle = lopstr15, year = "2015", editor = "Moreno Falaschi", doi = "10.1007/978-3-319-27436-2\_1", series = lncs, number = "9527", publisher = "Springer", pages = "3--17", } @InProceedings{miller15lpar, author = "Dale Miller and Marco Volpe", title = "Focused labeled proof systems for modal logic", booktitle = "Logic for Programming, Artificial Intelligence, and Reasoning (LPAR)", year = "2015", editor = "Martin Davis and Ansgar Fehnker and Annabelle McIver and Andrei Voronkov", series = lncs, number = "9450", doi = "10.1007/978-3-662-48899-7\_19", pages = "266--280", month = nov, } @InProceedings{miller15ppdp, author = "Dale Miller", title = "Proof Checking and Logic Programming", booktitle = ppdp15, year = "2015", editor = "Elvira Albert", pages = "18", month = jul, doi = "10.1145/2790449.2790510", publisher = "ACM", } @InCollection{miller17epsa, booktitle = "Towards an Encyclopaedia of Proof Systems", editor = "Bruno Woltzenlogel Paleo", title = "Focused {LK}", author = "Dale Miller", pages = "66--67", publisher = "College Publications", address = "London, UK", URL = "https://github.com/ProofSystem/Encyclopedia/blob/master/main.pdf", year = "2017", month = jan, edition = "1", } @InCollection{miller17epsb, booktitle = "Towards an Encyclopaedia of Proof Systems", editor = "Bruno Woltzenlogel Paleo", title = "Focused {LJ}", author = "Dale Miller", pages = "68--69", publisher = "College Publications", address = "London, UK", URL = "https://github.com/ProofSystem/Encyclopedia/blob/master/main.pdf", year = "2017", month = jan, edition = "1", } @InCollection{miller17epsc, booktitle = "Towards an Encyclopaedia of Proof Systems", editor = "Bruno Woltzenlogel Paleo", title = "Expansion Proofs", author = "Dale Miller", pages = "18", publisher = "College Publications", address = "London, UK", URL = "https://github.com/ProofSystem/Encyclopedia/blob/master/main.pdf", year = "2017", month = jan, edition = "1", } @Article{miller17fac, author = "Dale Miller", title = "Proof checking and logic programming", journal = "Formal Aspects of Computing", year = "2017", pages = "383--399", volume = "29", number = "3", doi = "10.1007/s00165-016-0393-z", URL = "https://dx.doi.org/10.1007/s00165-016-0393-z", pdf = "https://hal.inria.fr/hal-01390901/file/paper.pdf", } @Misc{miller18hapop, author = "Dale Miller", title = "{Influences between logic programming and proof theory}", URL = "https://inria.hal.science/hal-01900891", howpublished = "{HaPoP 2018: Fourth Symposium on the History and Philosophy of Programming}", year = "2018", month = mar, } @InProceedings{miller18types, author = "Dale Miller", URL = "https://hal.inria.fr/hal-01615681", title = "{Mechanized Metatheory Revisited: An Extended Abstract (Invited Paper)}", booktitle = "22nd International Conference on Types for Proofs and Programs (TYPES 2016)", pages = "1:1--1:16", series = "Leibniz International Proceedings in Informatics (LIPIcs)", year = "2018", volume = "97", editor = "Silvia Ghilezan and Herman Geuvers and Jelena Ivetić", publisher = "Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik", address = "Dagstuhl, Germany", doi = "10.4230/LIPIcs.TYPES.2016.1", } @InCollection{miller19catuscia, author = "Dale Miller", title = "My colleague, wife, and friend", booktitle = "The Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy. Essays Dedicated to Catuscia Palamidessi on the Occasion of Her 60th Birthday", publisher = "pub-sv", year = "2019", editor = "M\'ario S. Alvim and Kostas Chatzikokolakis and Carlos Olarte and Frank Valencia", number = "11769", series = "lncs", pages = "xv--xvii", doi = "10.1007/978-3-030-31175-9", month = nov, } @Article{miller19jar, author = "Dale Miller", title = "Mechanized Metatheory Revisited", journal = "Journal of Automated Reasoning", year = "2019", month = oct, volume = "63", number = "3", doi = "10.1007/s10817-018-9483-3", pages = "625--665", } @InProceedings{miller20icdcit, author = "Dale Miller", title = "A distributed and trusted web of formal proofs", booktitle = "Distributed Computing and Internet Technology (ICDCIT)", year = "2020", editor = "D. V. Hung and M. D'Souza", number = "11969", series = lncs, publisher = "Springer", pages = "21--40", doi = "10.1007/978-3-030-36987-3\_2", URL = "https://doi.org/10.1007/978-3-030-36987-3\_2", } @InCollection{miller20scedrov, author = "Dale Miller", title = "Andre and the Early Days of Penn’s Logic and Computation Group", booktitle = "Logic, Language, and Security", publisher = "pub-sv", year = "2020", editor = "Vivek Nigam et al.", number = "12300", series = "lncs", doi = "10.1007/978-3-030-62077-6_6", } @Article{miller21pt, author = "Dale Miller", title = "Reciprocal influences between logic programming and proof theory", journal = "Philosophy \& Technology", volume = "34", number = "1", pages = "75--104", month = mar, year = "2021", doi = "10.1007/s13347-019-00370-x", publisher = "Springer", } @Article{miller22amai, author = "Dale Miller and Alexandre Viel", title = "Proof search when equality is a logical connective", journal = "Annals of Mathematics and Artificial Intelligence", year = "2022", volume = "90", number = "5", pages = "523--535", doi = "10.1007/s10472-021-09764-0", note = "\emph{Special Issue on Theoretical and Practical Aspects of Unification}", } @Misc{miller22blog, author = "Dale Miller", title = "{LK} vs {LJ}: An origin story for linear logic", howpublished = "Proof Theory Blog", month = jul, year = "2022", URL = "https://prooftheory.blog/2022/07/06/lk-vs-lj-an-origin-story-for-linear-logic/", } @Article{miller22tplp, author = "Dale Miller", title = "A Survey of the Proof-Theoretic Foundations of Logic Programming", journal = tplp, volume = "22", number = "6", year = "2022", month = oct, pages = "859--904", doi = "10.1017/S1471068421000533", publisher = "Cambridge University Press", note = "Published online November 2021", } @TechReport{miller22tr, author = "Dale Miller and Jui-Hsuan Wu", title = "A positive perspective on term representations: Extended paper", institution = "Inria", year = "2022", URL = "https://hal.inria.fr/hal-03843587", } @Unpublished{miller22unp, author = "Dale Miller", title = "Proof theory, proof search, and logic programming", note = "Unpublished monograph", URL = "https://www.lix.polytechnique.fr/Labo/Dale.Miller/mpri/ln2022-v1.pdf", month = dec, year = "2022", } @InProceedings{miller23csl, author = "Dale Miller and Jui-Hsuan Wu", title = "A positive perspective on term representations", booktitle = "31st EACSL Annual Conference on Computer Science Logic (CSL 2023)", year = "2023", editor = "Bartek Klin and Elaine Pimentel", volume = "252", series = lipics, doi = "10.4230/LIPIcs.CSL.2023.3", pages = "3:1--3:21", publisher = "Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik", address = "Dagstuhl, Germany", } @InProceedings{miller23lics, author = "Dale Miller", title = "A system of inference based on proof search: an extended abstract", booktitle = "Thirty-Eighth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2023)", year = "2023", editor = "Igor Walukiewicz", doi = "10.1109/LICS56636.2023.10175827", pages = "1--11", } @InProceedings{miller82, author = "Dale A. Miller and Eve Longini Cohen and Peter B. Andrews", title = "A Look at {TPS}", booktitle = "Sixth Conference on Automated Deduction", address = "New York", publisher = "Springer", year = "1982", editor = "Donald W. Loveland", series = lncs, volume = "138", pages = "50--69", } @PhdThesis{miller83, author = "Dale Miller", title = "Proofs in Higher-order Logic", school = "Carnegie-Mellon University", month = aug, year = "1983", URL = "https://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/th.pdf", } @InProceedings{miller84, title = "Expansion Tree Proofs and Their Conversion to Natural Deduction Proofs", author = "Dale Miller", booktitle = "Seventh Conference on Automated Deduction", address = "Napa CA", month = may, year = "1984", pages = "375--393", publisher = "Springer", series = lncs, volume = "170", editor = "R. E. Shostak", } @Unpublished{miller85, title = "A computational logic approach to syntax and semantics", author = "Dale Miller and Gopalan Nadathur", month = may, year = "1985", note = "Presented at the Tenth Symposium of the Mathematical Foundations of Computer Science, IBM Japan", } @InProceedings{miller86aaai, title = "An integration of resolution and natural deduction theorem proving", author = "Dale Miller and Amy Felty", booktitle = "National Conference on Artificial Intelligence (AAAI-86)", address = "Philadelphia, PA", month = aug, year = "1986", editor = "Tom Kehler and Stan Rosenschein and Robert Filman and Peter F. Patel-Schneider", pages = "198--202", } @InProceedings{miller86acl, author = "Dale Miller and Gopalan Nadathur", title = "Some Uses of Higher-Order Logic in Computational Linguistics", booktitle = "Proceedings of the 24th Annual Meeting of the Association for Computational Linguistics", pages = "247--255", year = "1986", publisher = "Association for Computational Linguistics, Morristown, New Jersey", doi = "10.3115/981131.981165", } @InProceedings{miller86iclp, author = "Dale Miller and Gopalan Nadathur", title = "Higher-Order Logic Programming", booktitle = "{Proceedings of the Third International Logic Programming Conference}", pages = "448--462", editor = "Ehud Shapiro", address = "London", month = jun, year = "1986", series = lncs, volume = "225", publisher = "Springer", doi = "10.1007/3-540-16492-8\_94", } @InProceedings{miller86slp, author = "Dale Miller", title = "A Theory of Modules for Logic Programming", booktitle = "Third Annual IEEE Symposium on Logic Programming", address = "Salt Lake City, Utah", editor = "Robert M. Keller", pages = "106--114", month = sep, year = "1986", } @InProceedings{miller87lics, author = "Dale Miller and Gopalan Nadathur and Andre Scedrov", title = "Hereditary {Harrop} Formulas and Uniform Proof Systems", booktitle = lics87, pages = "98--105", editor = "David Gries", address = "Ithaca, NY", month = jun, year = "1987", } @InProceedings{miller87lmps, author = "Dale Miller", title = "Hereditary {Harrop} formulas and logic programming", booktitle = "Proceedings of the VIII International Congress of Logic, Methodology, and Philosophy of Science", address = "Moscow", pages = "153--156", month = aug, year = "1987", } @Unpublished{miller87lp, author = "Dale Miller and Gopalan Nadathur", title = "{$\lambda$Prolog Version 2.6}", month = aug, year = "1987", note = "Distribution in C-Prolog sources", } @Article{miller87sl, author = "Dale Miller", title = "A Compact Representation of Proofs", journal = "Studia Logica", volume = "46", number = "4", pages = "347--370", year = "1987", doi = "10.1007/BF00370646", } @InProceedings{miller87slp, author = "Dale Miller and Gopalan Nadathur", title = "A Logic Programming Approach to Manipulating Formulas and Programs", booktitle = "IEEE Symposium on Logic Programming", address = "San Francisco", editor = "Seif Haridi", pages = "379--388", month = sep, year = "1987", URL = "https://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/slp87.pdf", } @TechReport{miller88asflp, author = "Dale Miller", title = "Logic Programming Based on Higher-Order Hereditary {Harrop} Formulas", institution = "Computer Science Department, University of Pennsylvania", month = sep, year = "1988", number = "MS-CIS-88-77", note = "Transparencies for lectures at the Advanced School on Foundations of Logic Programming, Algehro, Sardinia", } @Unpublished{miller88lp, author = "Dale Miller and Gopalan Nadathur", title = "{$\lambda$Prolog Version 2.7}", month = jul, year = "1988", note = "Distribution in C-Prolog and Quintus sources", URL = "https://www.cs.cmu.edu/afs/cs/project/ai-repository/ai/lang/prolog/impl/prolog/lp/", } @InProceedings{miller89banff, author = "Dale Miller", title = "A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification: Extended Abstract", booktitle = "Proceedings of the 1989 Banff meeting on {``}Higher-Orders{''}", month = sep, year = "1989", editor = "Graham M. Birtwistle", address = "Banff, Canada", } @InProceedings{miller89iclp, author = "Dale Miller", title = "Lexical Scoping as Universal Quantification", editor = "G. Levi and M. Martelli", booktitle = "{Sixth International Logic Programming Conference}", address = "Lisbon, Portugal", publisher = "MIT Press", pages = "268--283", month = jun, year = "1989", URL = "https://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/iclp89.pdf", } @Article{miller89jlp, author = "Dale Miller", title = "A logical analysis of modules in logic programming", journal = "Journal of Logic Programming", volume = "6", number = "1-2", month = jan, year = "1989", pages = "79--108", doi = "10.1016/0743-1066(89)90031-9", } @InCollection{miller90abs, author = "Dale Miller", title = "Abstractions in logic programming", booktitle = "Logic and Computer Science", editor = "Piergiorgio Odifreddi", publisher = "Academic Press", pages = "329--359", year = "1990", URL = "https://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/AbsInLP.pdf", } @InProceedings{miller90tr, author = "Dale Miller", title = "An Extension to {ML} to Handle Bound Variables in Data Structures: Preliminary Report", month = jun, year = "1990", booktitle = "Proceedings of the Logical Frameworks BRA Workshop", address = "Antibes, France", pages = "323--335", note = "Available as UPenn CIS technical report MS-CIS-90-59", URL = "https://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/mll.pdf", } @Article{miller91alp, author = "Dale Miller", title = "Proof Theory as an Alternative to Model Theory", journal = "Newsletter of the Association for Logic Programming", year = "1991", month = aug, volume = "4", number = "3", note = "Guest editorial.", URL = "https://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/ProofTheoryAsAlternative.html", } @Article{miller91apal, author = "Dale Miller and Gopalan Nadathur and Frank Pfenning and Andre Scedrov", title = "Uniform Proofs as a Foundation for Logic Programming", journal = apal, year = "1991", volume = "51", number = "1--2", pages = "125--157", doi = "10.1016/0168-0072(91)90068-W", } @InProceedings{miller91elp, author = "Dale Miller", editor = "Lars-Henrik Eriksson and Lars Halln{\"a}s and Peter Schroeder-Heister", title = "A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification", booktitle = "{Extensions of Logic Programming: Second International Workshop, ELP '91, Stockholm, Sweden, January 27-29, 1991. Proceedings}", publisher = "Springer", series = lnai, volume = "475", year = "1991", pages = "253--281", } @InProceedings{miller91iclp, author = "Dale Miller", title = "Unification of Simply Typed Lambda-Terms as Logic Programming", editor = "Koichi Furukawa", booktitle = "Eighth International Logic Programming Conference", address = "Paris, France", publisher = "MIT Press", month = jun, year = "1991", pages = "255--269", } @Article{miller91jlc, author = "Dale Miller", title = "A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification", journal = jlc, volume = "1", number = "4", pages = "497--536", year = "1991", doi = "10.1093/logcom/1.4.497", } @InCollection{miller92encyclopedia, author = "Dale Miller", title = "Logic, Higher-order", booktitle = "Second Edition of the Encyclopedia of Artificial Intelligence", publisher = "Wiley", year = "1992", editor = "S. Shapiro", } @Article{miller92jsc, author = "Dale Miller", title = "Unification under a mixed prefix", year = "1992", journal = "Journal of Symbolic Computation", pages = "321--358", volume = "14", number = "4", doi = "10.1016/0747-7171(92)90011-R", pdf = "https://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/jsc92.pdf", } @Proceedings{miller92lllpproc, title = "Proceedings of the Workshop on Linear Logic and Logic Programming (Washington, {DC})", editor = "Dale Miller", month = nov, year = "1992", note = "Available electronically from ftp.cis.upenn.edu in pub/meetings/LL+LP-proceedings and as UPenn CIS Department technical report MS-CIS-92-80.", } @InProceedings{miller92llworkshop, author = "Dale Miller", title = "Linear Logic and Logic Programming: An Overview", booktitle = "Proceedings of the Workshop on Linear Logic and Logic Programming (Washington, DC)", editor = "Dale Miller", month = nov, year = "1992", note = "Available as UPenn CIS technical report MS-CIS-92-80 and electronically from ftp.cis.upenn.edu in pub/meetings/LL+LP-proceedings", } @InProceedings{miller92lpw, author = "Dale Miller", title = "A Proposal for Modules for {$\lambda$Prolog}: Preliminary Draft", booktitle = "Proceedings of the 1992 {$\lambda$Prolog Workshop}", editor = "Dale Miller", year = "1992", } @Proceedings{miller92lpwproc, editor = "Dale Miller", title = "Proceedings of the 1992 {$\lambda$Prolog} Workshop", year = "1992", note = "Available electronically from ftp.cis.upenn.edu in pub/meetings/?? and as UPenn CIS Department technical report MS-CIS-92-??.", } @InProceedings{miller92rclp, author = "Dale Miller", title = "Abstract Syntax and Logic Programming", booktitle = "{Logic Programming: Proceedings of the First Russian Conference on Logic Programming, 14-18 September 1990}", year = "1992", pages = "322--337", publisher = "Springer", series = lnai, number = "592", } @InProceedings{miller92welp, author = "Dale Miller", title = "The $\pi$-calculus as a theory in linear logic: Preliminary results", booktitle = welp92, editor = "E. Lamma and P. Mello", publisher = "Springer", address = "Bologna, Italy", series = lncs, number = "660", pages = "242--265", year = "1993", doi = "10.1007/3-540-56454-3\_13", } @InProceedings{miller93welp, author = "Dale Miller", title = "A Proposal for Modules in {$\lambda$Prolog}", booktitle = welp93, editor = "R. Dyckhoff", publisher = "Springer", series = lncs, number = "798", pages = "206--221", year = "1994", } % URL = "https://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/pic.pdf", @InProceedings{miller94lics, author = "Dale Miller", title = "A Multiple-Conclusion Meta-Logic", booktitle = lics94, editor = "S. Abramsky", address = "Paris", month = jul, year = "1994", publisher = "IEEE Computer Society", pages = "272--281", } @Article{miller95computnet, author = "Dale Miller", title = "A Survey of Linear Logic Programming", journal = "Computational Logic: The Newsletter of the European Network in Computational Logic", volume = "2", number = "2", pages = "63--67", year = "1995", month = dec, } @InProceedings{miller95gulp, author = "Dale Miller", title = "Observations about using logic as a specification language", booktitle = "Proceedings of GULP-PRODE'95: Joint Conference on Declarative Programming", editor = "M. Sessa", address = "Marina di Vietri (Salerno-Italy)", month = sep, year = "1995", } @Article{miller96tcs, author = "Dale Miller", title = "Forum: {A} Multiple-Conclusion Specification Logic", journal = "Theoretical Computer Science", year = "1996", pages = "201--232", volume = "165", number = "1", doi = "10.1016/0304-3975(96)00045-X", } @InCollection{miller97nato, author = "Dale Miller", booktitle = "Logic of Computation", title = "Logic Programming and Meta-Logic", publisher = "Springer", year = "1997", editor = "Helmut Schwichtenberg", volume = "157", series = "Nato ASI Series", pages = "265--308", } @Unpublished{miller98lpbook, author = "Dale Miller", title = "{$\lambda$Prolog}: an introduction to the language and its logic", URL = "https://www.lix.polytechnique.fr/Labo/Dale.Miller/lProlog/bk.pdf", year = "1998", note = "Incomplete draft.", } @InCollection{miller99nato, author = "Dale Miller", booktitle = "Computational Logic", title = "Sequent Calculus and the Specification of Computation", publisher = "Springer", year = "1999", editor = "Ulrich Berger and Helmut Schwichtenberg", volume = "165", series = "Nato ASI Series", pages = "399--444", } @Article{miller99surveys, author = "Dale Miller and Catuscia Palamidessi", title = "Foundational Aspects of Syntax", journal = "ACM Computing Surveys", publisher = "ACM", editor = "Pierpaolo Degano and Roberto Gorrieri and Alberto Marchetti-Spaccamela and Peter Wegner", year = "1999", volume = "31", month = sep, doi = "10.1145/333580.333590", } @Article{millin74fib, author = "D. A. Millin", title = "Problem {H}-237", journal = "The Fibonacci Quarterly", month = oct, year = "1974", volume = "12", number = "3", pages = "309", } @Article{milne79jacm, author = "G. Milne and R. Milner", title = "Concurrent Processes and Their Syntax", journal = "JACM", volume = "26", number = "2", year = "1979", pages = "302--321", } @Article{milner06, title = "Pure bigraphs: Structure and dynamics", journal = "Information and Computation", volume = "204", number = "1", pages = "60--122", year = "2006", note = "", ISSN = "0890-5401", doi = "10.1016/j.ic.2005.07.003", author = "Robin Milner", } @Article{milner07entcs, title = "Local Bigraphs and Confluence: Two Conjectures: (Extended Abstract)", author = "Robin Milner", journal = "Electr. Notes Theor. Comput. Sci", year = "2007", number = "3", volume = "175", pages = "65--73", } @Article{milner78jcss, author = "Robin Milner", title = "A Theory of Type Polymorphism in Programming", journal = jcss, volume = "17", number = "3", year = "1978", pages = "348--375", } @Article{milner79jacm, author = "Robin Milner", title = "Flowgraphs and Flow Algebras", journal = "JACM", volume = "26", number = "4", year = "1979", pages = "794--818", } @InProceedings{milner79mfcs, title = "{LCF}: {A} way of doing proofs with a machine", author = "Robin Milner", booktitle = "International Symposium on Mathematical Foundations of Computer Science", pages = "146--159", year = "1979", publisher = "Springer", } @Book{milner80lncs, author = "Robin Milner", title = "A Calculus of Communicating Systems", series = lncs, volume = "92", publisher = "Springer", address = "New York, NY", year = "1980", } @Article{milner83tcs, author = "R. Milner", title = "Calculi for Synchrony and Asynchrony", journal = "Theoretical Computer Science", year = "1983", volume = "25", pages = "267--310", } @Book{milner84lncs, author = "R. Milner", title = "Lectures on a Calculus for Communicating Systems", volume = "197", publisher = "Springer", series = lncs, address = "New York, NY", year = "1984", pages = "197--220", } @InProceedings{milner87, author = "Robin Milner", title = "Dialogue with a Proof System", booktitle = "TAPSOFT '87", editor = "H. Ehrig and {\em et al.}", pages = "271--275", publisher = "Springer", year = "1987", } @Book{milner89book, author = "Robin Milner", title = "Communication and Concurrency", publisher = "Prentice-Hall International", year = "1989", ISBN = "978-0-13-115007-2", } @TechReport{milner89trI, author = "Robin Milner and Joachim Parrow and David Walker", title = "A Calculus of Mobile Processes, {Part I}", institution = "University of Edinburgh", type = "LFCS Report Series", number = "ECS-LFCS-89-85", month = jun, year = "1989", } @TechReport{milner89trII, author = "Robin Milner and Joachim Parrow and David Walker", title = "A Calculus of Mobile Processes, {Part II}", institution = "University of Edinburgh", type = "LFCS Report Series", number = "ECS-LFCS-89-86", month = jun, year = "1989", } @InCollection{milner90icalp, author = "Robin Milner", title = "Functions as processes", booktitle = "Automata, Languages and Programming 17th Int. Coll.", location = "Warwick University, UK", series = lncs, volume = "443", pages = "167--180", publisher = "Springer", month = jul, year = "1990", } @Book{milner90sml, author = "Robin Milner and Mads Tofte and Robert Harper", title = "{The Definition of Standard ML}", publisher = "MIT Press", year = "1990", } @TechReport{milner90tr, author = "Robin Milner", title = "Functions as Processes", institution = "INRIA", type = "Research Report", number = "1154", year = "1990", } @Book{milner91sml, author = "Robin Milner and Mads Tofte", title = "{Commentary on Standard ML}", publisher = "MIT Press", year = "1991", } @TechReport{milner91tr, author = "Robin Milner and Joachim Parrow and David Walker", title = "Modal Logics for Mobile Processes", institution = "University of Edinburgh", type = "LFCS Report Series", number = "ECS-LFCS-91-136", month = apr, year = "1991", } @TechReport{milner91tra, author = "Robin Milner", title = "The Polyadic $\pi$-Calculus: {A} Tutorial", institution = "University of Edinburgh", type = "LFCS Report Series", number = "ECS-LFCS-91-180", month = oct, year = "1991", } @Article{milner92icI, author = "Robin Milner and Joachim Parrow and David Walker", title = "A Calculus of Mobile Processes, {Part I}", journal = "Information and Computation", pages = "1--40", volume = "100", number = "1", month = sep, year = "1992", doi = "10.1016/0890-5401(92)90008-4", } @Article{milner92icII, author = "Robin Milner and Joachim Parrow and David Walker", title = "A Calculus of Mobile Processes, {Part II}", journal = "Information and Computation", volume = "100", number = "1", pages = "41--77", year = "1992", doi = "10.1016/0890-5401(92)90009-5", } @Article{milner92mscs, author = "Robin Milner", title = "Functions as Processes", journal = "Mathematical Structures in Computer Science", volume = "2", pages = "119--141", year = "1992", } @Article{milner93cacm, title = "Turing Award Lecture: Elements of Interaction", author = "Robin Milner", journal = cacm, year = "1993", number = "1", volume = "36", pages = "78--89", doi = "10.1145/151233.151240", } @Article{milner93tcs, author = "Robin Milner and Joachim Parrow and David Walker", title = "Modal Logics for Mobile Processes", journal = "Theoretical Computer Science", year = "1993", volume = "114", number = "1", pages = "149--171", } @Book{milner97def, author = "Robin Milner and Mads Tofte and Robert Harper and David MacQueen", year = "1997", title = "The {Definition} of {Standard ML} (Revised)", publisher = "The MIT Press", } @Book{milner99book, author = "Robin Milner", title = "Communicating and Mobile Systems: The $\pi$-Calculus", publisher = "Cambridge University Press", address = "New York, NY, USA", year = "1999", } @InProceedings{mimram10cie, author = "Samuel Mimram", title = "Focusing in Asynchronous Games", booktitle = "CiE: Programs, Proofs, Processes", pages = "331--341", editor = "Fernando Ferreira and Benedikt L{\"o}we and Elvira Mayordomo and Lu\'{\i}s Mendes Gomes", publisher = "Springer", series = lncs, volume = "6158", year = "2010", } @InCollection{minker02lncs, author = "Jack Minker and Dietmar Seipel", title = "Disjunctive Logic Programming: {A} Survey and Assessment", booktitle = "Computational {Logic}: {Logic} {Programming} and {Beyond}", journal = "Lecture Notes in Computer Science", publisher = "Springer", volume = "2407", pages = "472--511", year = "2002", } @Article{minker90jlp, author = "J. Minker and A. Rajasekar", title = "A fixpoint semantics for disjunctive logic programs", journal = "Journal of Logic Programming", year = "1990", volume = "9", number = "1", pages = "45--74", } @Book{mints00book, author = "Grigori Mints", title = "A Short Introduction to Intuitionistic Logic", publisher = "Kluwer Academic Publishers", year = "2000", } @InProceedings{mints90colog, author = "G.~Mints", booktitle = "Proc.\ {COLOG-88}, Tallin", pages = "198--231", publisher = "Springer", series = lncs, title = "Gentzen-Type Systems and Resolution Rules, Part 1: Propositional Logic", volume = "417", year = "1990", } @Article{mints90jlp, author = "Grigori Mints and Enn Tyugu", title = "Propositional Logic Programming and {Priz} System", journal = "J. Logic Programming", volume = "9", number = "2{\&}3", pages = "179--193", year = "1990", URL = "https://doi.org/10.1016/0743-1066(90)90039-8", doi = "10.1016/0743-1066(90)90039-8", } @Article{mints92bit, author = "G. Mints", title = "Complexity of subclasses of the intuitionistic propositional calculus", journal = "BIT Numerical Mathematics", year = "1992", volume = "32", number = "1", pages = "64--69", } @InProceedings{mitchell85, author = "John Mitchell and Albert Meyer", title = "Second-order Logical Relations", booktitle = "Logics of Programs", editor = "R. Parikh", publisher = "Springer", series = lncs, volume = "193", pages = "225--236", year = "1985", } @InProceedings{mitchell86lfp1, author = "John Mitchell", title = "Representation Independence and Data Abstraction", booktitle = "Proceedings of the ACM Lisp and Functional Programming Conference", pages = "263--276", year = "1986", } @InProceedings{mitchell86lfp2, author = "John C. Mitchell", title = "A Type Inference Approach to Reduction Properties and Semantics of Polymorphic Expressions", booktitle = "{ACM} Symposium on {LISP} and Functional Programming", pages = "308--319", year = "1986", } @InProceedings{mitchell87lics, author = "John C. Mitchell and Eugenio Moggi", title = "Kripke-style models for typed lambda calculus", booktitle = lics87, pages = "303--314", address = "Ithaca, NY", month = jun, year = "1987", } @Article{mitchell88toplas, author = "J. C. Mitchell and G. D. Plotkin", title = "Abstract types have existential type", journal = "ACM Transactions on Programming Languages and Systems", volume = "10", number = "3", year = "1988", pages = "470--502", publisher = "ACM Press", address = "New York, NY, USA", } @InCollection{mitchell90handbook, author = "John C. Mitchell", title = "Type Systems for Programming Languages", booktitle = "Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics", pages = "365--458", publisher = "Elsevier and MIT Press", year = "1990", editor = "Jan van Leeuwen", } @Article{mitchell91apal, author = "John C. Mitchell and Eugenio Moggi", title = "Kripke-style Models for Typed Lambda Calculus", journal = apal, volume = "51", number = "1-2", pages = "99--124", year = "1991", } @Book{mitchell96book, author = "John C. Mitchell", title = "Foundations for Programming Languages", publisher = "MIT Press", year = "1996", series = "Foundations of Computing", ISBN = "0-262-13321-0", } @Article{mitchell96ic, title = "Standard {ML--NJ} Weak Polymorphism and Imperative Constructs", author = "John Mitchell and Ramesh Viswanathan", pages = "102--116", journal = "Information and Computation", month = jun, year = "1996", volume = "127", number = "2", } @Misc{mobius05cordis, author = "Gilles Barthes and others", title = "Mobius: Mobility, Ubiquity and Security for small Devices", note = "\url{https://cordis.europa.eu/project/rcn/80614\_en.html}", URL = "https://cordis.europa.eu/project/rcn/80614\_en.html", howpublished = "Cordis website", year = "2005", } @PhdThesis{mollerfeld02phd, title = "Generalized inductive definitions", author = "Michael Möllerfeld", editor = "Wolfram Pohlers", year = "2002", edition = "[Electronic ed.]", URL = "https://nbn-resolving.de/urn:nbn:de:hbz:6-85659549572", } @InProceedings{momigliano02lfm, author = "Alberto Momigliano and Simon Ambler and Roy Crole", title = "A Hybrid Encoding of {Howe's} Method for Establishing Congruence of Bisimilarity", booktitle = "LFM'02", year = "2002", volume = "70", number = "2", publisher = "Springer", series = entcs, } @InProceedings{momigliano03fossacs, author = "Alberto Momigliano and Simon Ambler", title = "Multi-level meta-reasoning with Higher Order Abstract Syntax", booktitle = "FOSSACS'03", year = "2003", editor = "A.~Gordon", volume = "2620", pages = "375--392", series = lncs, publisher = "Springer", } @Article{momigliano03tocl, author = "Alberto Momigliano and Frank Pfenning", title = "Higher-order pattern complement and strict $\lambda$-calculus", journal = tocl, year = "2003", volume = "4", number = "4", pages = "493--529", month = oct, } @InProceedings{momigliano03types, author = "Alberto Momigliano and Alwen Tiu", title = "Induction and Co-induction in Sequent Calculus", booktitle = "Post-proceedings of TYPES 2003", editor = "Mario Coppo and Stefano Berardi and Ferruccio Damiani", pages = "293--308", year = "2003", month = jan, series = lncs, number = "3085", pdf = "https://www.lix.polytechnique.fr/Labo/Alwen.Tiu/linc.pdf", } @Article{momigliano08corr, author = "Alwen Tiu and Alberto Momigliano", title = "Induction and Co-induction in Sequent Calculus", journal = "CoRR", year = "2008", URL = "https://arxiv.org/abs/0812.4727", } @Article{momigliano12jal, author = "Alberto Momigliano and Alwen Tiu", title = "Induction and Co-induction in Sequent Calculus", journal = "Journal of Applied Logic", year = "2012", volume = "10", pages = "330--367", } @InProceedings{momigliano12lfmtp, author = "Alberto Momigliano", title = "A supposedly fun thing {I} may have to do again: a {HOAS} encoding of {Howe's} method", booktitle = "Proceedings of LFMTP'12", year = "2012", pages = "33--42", publisher = "ACM", doi = "10.1145/3426425.3426936", } @Misc{momigliano17dalefest, author = "Alberto Momigliano and Brigitte Pientka and David Thibodeau", title = "A case-study in programming coinductive proofs: {Howe's} method", howpublished = "Submitted", year = "2017", } @Article{momigliano19mscs, title = "A case study in programming coinductive proofs: Howe’s method", volume = "29", doi = "10.1017/S0960129518000415", number = "8", journal = "Mathematical Structures in Computer Science", publisher = "Cambridge University Press", author = "Alberto Momigliano and Brigitte Pientka and David Thibodeau", year = "2019", pages = "1309--1343", } @Book{monk76, author = "J. Donald Monk", title = "Mathematical Logic", series = "Graduate Texts in Mathematics", publisher = "Springer", year = "1976", } @InCollection{montague74, author = "Richard Montague", title = "The Proper Treatment of Quantification in Ordinary English", booktitle = "Formal Philosophy: Selected Papers of Richard Montague", publisher = "Yale University Press", year = "1974", } @InProceedings{montanari92caap, author = "U.~Montanari and F.~Rossi", title = "Graph grammars as context-dependent rewriting systems: {A} partial ordering semantics", booktitle = "Proc. CAAP'92, Rennes", month = mar, year = "1992", } @InProceedings{monteiro89iclp, author = "L. Monteiro and A. Porto", title = "Contextual Logic Programming", booktitle = "Proceedings of the 6th International Conference on Logic Programming, Lisbon", publisher = "MIT Press", year = "1989", } @Article{monteiro94jlc, author = "Eric Monteiro", title = "Linear Logic as {CSP}", journal = jlc, volume = "4", number = "4", pages = "405--421", year = "1994", } @Article{moore89jar, author = "J. Strother Moore", title = "A mechanically verified language implementation", journal = jar, year = "1989", volume = "5", number = "4", pages = "461--492", } @InCollection{moortgat96handbook, author = "Michael Moortgat", title = "Categorial Type Logics", booktitle = "{Handbook of Logic and Language}", publisher = "Elsevier", address = "Amsterdam", editor = "Johan {van Benthem} and Alice {ter Meulen}", pages = "93--177", year = "1996", } @InProceedings{moran00imprecise, author = "S{\o}ren B. Lassen Andrew Moran and Simon Peyton Jones", title = "Imprecise Exceptions, Co-Inductively", booktitle = entcs, volume = "26", publisher = "Elsevier Science Publishers", editor = "Andrew Gordon and Andrew Pitts", year = "2000", } @InProceedings{morrill95cacl, author = "Glyn Morrill", title = "Higher-order Linear Logic Programming of Categorial Deduction", booktitle = "{7th Conference of the Association for Computational Linguistics}", address = "Dublin, Ireland", pages = "133--140", year = "1995", } @Article{morrisett99toplas, author = "Greg Morrisett and David Walker and Karl Crary and Neal Glew", title = "From System {F} to Typed Assembly Language", journal = "ACM Transactions on Programming Languages and Systems", year = "1999", volume = "21", number = "3", pages = "528--569", month = may, } @InCollection{moschovakis21sep, author = "Joan Moschovakis", title = "{Intuitionistic Logic}", booktitle = "The {Stanford} Encyclopedia of Philosophy", editor = "Edward N. Zalta", howpublished = "\url{https://plato.stanford.edu/archives/fall2021/entries/logic-intuitionistic/}", year = "2021", edition = "{F}all 2021", publisher = "Metaphysics Research Lab, Stanford University", } @Book{mosses92, author = "P. Mosses", title = "Action Semantics", series = "Tracts in Theoretical Computer Science", publisher = "Cambridge University Press", year = "1992", } @MastersThesis{mottl00mse, author = "Markus Mottl", title = "Automating Functional Program Transformation", school = "University of Edinburgh", year = "2000", month = sep, URL = "https://publish.inf.ed.ac.uk/publications/thesis/online/IM000106.pdf", } @InProceedings{moura08wrk, title = "Proofs and Refutations, and {Z3}", author = "Leonardo Mendon{\c c}a de Moura and Nikolaj Bj{\o}rner", booktitle = "Proceedings of the Combined KEAPPA - IWIL Workshops", pages = "123--132", publisher = "CEUR-WS.org", year = "2008", volume = "418", editor = "Piotr Rudnicki and Geoff Sutcliffe and Boris Konev and Renate A. Schmidt and Stephan Schulz", series = "CEUR Workshop Proceedings", URL = "https://ceur-ws.org/Vol-418/paper10.pdf", } @InProceedings{mousavi05concur, author = "Mohammad Reza Mousavi and Murdoch J. Gabbay and Michel A. Reniers", title = "{SOS} for Higher Order Precesses", booktitle = "CONCUR", pages = "308--322", editor = "Mart\'{\i}n Abadi and Luca de Alfaro", publisher = "Springer", series = lncs, volume = "3653", year = "2005", } @InProceedings{muller19cicm, title = "The {Coq} library as a theory graph", author = "Dennis M{\"u}ller and Florian Rabe and Claudio Sacerdoti Coen", booktitle = "Intelligent Computer Mathematics: 12th International Conference, CICM 2019, Prague, Czech Republic, July 8--12, 2019, Proceedings 12", pages = "171--186", year = "2019", organization = "Springer", } @InProceedings{munch-maccagnoni15lics, author = "Guillaume Munch-Maccagnoni and Gabriel Scherer", title = "Polarised Intermediate Representation of Lambda Calculus with Sums", booktitle = lics15, year = "2015", pages = "127--140", doi = "10.1109/LICS.2015.22", publisher = "{IEEE} Computer Society", } @InProceedings{mundhenk10rp, author = "Martin Mundhenk and Felix Wei{\ss}", title = "The Complexity of Model Checking for Intuitionistic Logics and Their Modal Companions", booktitle = "4th International Workshop on Reachability Problems", series = lncs, volume = "6227", pages = "146--160", publisher = pub-sv, year = "2010", doi = "10.1007/978-3-642-15349-5\_10", } @Article{mycroft84ai, author = "A. Mycroft and R. A. O'Keefe", title = "A polymorphic type system for {Prolog}", journal = "Artificial Intelligence", volume = "23", pages = "295--307", year = "1984", } % URL = "https://hal.inria.fr/hal-01160579v2", @Article{nadathur00tcs, author = "Gopalan Nadathur", title = "Correspondences between classical, intuitionistic and uniform provability", journal = tcs, year = "2000", volume = "232", pages = "273--298", } @Article{nadathur02, author = "Gopalan Nadathur", title = "The Suspension Notation for Lambda Terms and its Use in Metalanguage Implementations", journal = "Electr. Notes Theor. Comput. Sci.", volume = "67", year = "2002", pages = "35--48", } @InProceedings{nadathur05iclp, author = "Gopalan Nadathur and Natalie Linnell", title = "Practical Higher-Order Pattern Unification With On-the-Fly Raising", editor = "Maurizio Gabbrielli and Gopal Gupta", booktitle = "{ICLP 2005: 21st International Logic Programming Conference}", address = "Sitges, Spain", publisher = "Springer", series = lncs, volume = "3668", pages = "371--386", month = oct, year = "2005", } @InProceedings{nadathur05lpar, title = "Optimizing the Runtime Processing of Types in Polymorphic Logic Programming Languages", author = "Gopalan Nadathur and Xiaochu Qi", booktitle = lpar05, publisher = "Springer", month = dec, year = "2005", volume = "3835", editor = "G. Sutcliffe and A. Voronkov", pages = "110--124", series = lncs, } @Article{nadathur05tplp, author = "Gopalan Nadathur", title = "A Treatment of Higher-Order Features in Logic Programming", journal = "Theory and Practice of Logic Programming", year = "2005", volume = "5", number = "3", pages = "305--354", } @PhdThesis{nadathur87phd, author = "Gopalan Nadathur", title = "A Higher-Order Logic as the Basis for Logic Programming", school = "University of Pennsylvania", month = may, year = "1987", } @InProceedings{nadathur88iclp, author = "Gopalan Nadathur and Dale Miller", title = "An {Overview} of {$\lambda$Prolog}", editor = "Kenneth A. Bowen and Robert A. Kowalski", booktitle = "{Fifth International Logic Programming Conference}", address = "Seattle", publisher = "MIT Press", pages = "810--827", month = aug, year = "1988", URL = "https://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/iclp88.pdf", } @InProceedings{nadathur89naclp, author = "Gopalan Nadathur and Bharat Jayaraman", title = "Towards a {WAM} Model for {$\lambda$Prolog}", booktitle = "Proceedings of the North American Conference on Logic Programming", editor = "Ewing Lusk and Ross Overbeek", pages = "1180--1198", address = "Cleveland, Ohio", publisher = "MIT Press", month = oct, year = "1989", } @Article{nadathur90jacm, author = "Gopalan Nadathur and Dale Miller", title = "Higher-order {Horn} Clauses", journal = "Journal of the ACM", volume = "37", number = "4", month = oct, year = "1990", pages = "777--814", doi = "10.1145/96559.96570", } @InProceedings{nadathur90lfp, author = "Gopalan Nadathur and Debra Sue Wilson", title = "A Representation of lambda terms suitable for operations on their intensions", booktitle = "Proc.\ of the 1990 ACM Conf.\ on Lisp and Functional Programming", editor = "M. Wand", publisher = "ACM Press", pages = "341--348", year = "1990", } @TechReport{nadathur92tr, author = "Gopalan Nadathur and Bharat Jayaraman and Debra~Sue Wilson", title = "Implementation Considerations for Higher-Order Features in Logic Programming", month = jun, year = "1993", institution = "Department of Computer Science, Duke University", number = "CS-1993-16", } @InCollection{nadathur92types, author = "Gopalan Nadathur and Frank Pfenning", title = "The type system of a higher-order logic programming language", pages = "245--283", booktitle = "Types in Logic Programming", editor = "Frank Pfenning", year = "1992", publisher = "MIT Press", } @Article{nadathur93jar, author = "Gopalan Nadathur", title = "A Proof Procedure for the Logic of Hereditary {Harrop} Formulas", journal = "Journal of Automated Reasoning", volume = "11", number = "1", year = "1993", month = aug, pages = "115--145", doi = "10.1007/BF00881902", } @TechReport{nadathur93trb, author = "Gopalan Nadathur and Bharat Jayaraman and Debra~Sue Wilson", title = "Implementation Considerations for Higher-Order Features in Logic Programming", month = jun, year = "1993", institution = "Department of Computer Science, Duke University", number = "CS-1993-16", } @Article{nadathur94jlp, author = "Gopalan Nadathur and Bharat Jayaraman and Keehang Kwon", title = "Scoping Constructs in Logic Programming: Implementation Problems and their Solution", journal = "Journal of Logic Programming", volume = "25", number = "2", month = nov, year = "1995", pages = "119--161", } @TechReport{nadathur94tr, author = "Gopalan Nadathur and Dale Miller", title = "Higher-Order Logic Programming", institution = "Department of Computer Science, Duke University", year = "1994", number = "CS-1994-38", } @TechReport{nadathur94tra, author = "Gopalan Nadathur and Debra Sue Wilson", title = "A Notation for Lambda Terms {I}: {A} Generalization of Environments (Revised)", month = jan, year = "1994", institution = "Department of Computer Science, Duke University", number = "CS-1994-03", } @TechReport{nadathur94trb, author = "Gopalan Nadathur", title = "A Notation for Lambda Terms {II}: Refinements and Applications", month = jan, year = "1994", institution = "Department of Computer Science, Duke University", number = "CS-1994-01", } @Article{nadathur95jlp, author = "Gopalan Nadathur and Bharat Jayaraman and Keehang Kwon", title = "Scoping Constructs in Logic Programming: Implementation Problems and their Solution", year = "1995", month = nov, volume = "25", number = "2", pages = "119--161", journal = "Journal of Logic Programming", URL = "https://doi.org/10.1016/0743-1066(95)00037-K", doi = "10.1016/0743-1066(95)00037-K", } @InProceedings{nadathur95lics, author = "Gopalan Nadathur and Donald Loveland", title = "Uniform Proofs and Disjunctive Logic Programming", editor = "D. Kozen", booktitle = lics95, year = "1995", publisher = "IEEE Computer Society Press", address = "San Diego, California", month = jun, pages = "148--155", } @TechReport{nadathur96tra, author = "Gopalan Nadathur", title = "Uniform Provability in Classical Logic", month = mar, year = "1996", institution = "Department of Computer Science, University of Chicago", number = "TR-96-09", note = "To appear in {\it Journal of Logic and Computation}", } @TechReport{nadathur96trb, author = "Gopalan Nadathur", title = "A Fine-Grained Notation for Lambda Terms and Its Use in Intensional Operations", month = may, year = "1996", institution = "Department of Computer Science, University of Chicago", number = "TR-96-13", note = "To appear in {\it Journal of Functional and Logic Programming}", } @TechReport{nadathur97tra, author = "Gopalan Nadathur and Debra Sue Wilson", title = "A Notation for Lambda Terms: {A} Generalization of Environments", month = jan, year = "1997", institution = "Department of Computer Science, University of Chicago", number = "CS-1997-01", note = "To appear in {\it Theoretical Computer Science}", } @TechReport{nadathur97trb, author = "Gopalan Nadathur", title = "Correspondences between classical, intuitionistic and uniform provability", month = nov, year = "1997", institution = "Department of Computer Science, University of Chicago", number = "TR-97-12", } @TechReport{nadathur97trc, author = "Gopalan Nadathur and Guanshan Tong", title = "Realizing Modularity in $\lambda${P}rolog", month = aug, year = "1997", institution = "Department of Computer Science, University of Chicago", number = "TR-97-07", } @InCollection{nadathur98handbook, author = "Gopalan Nadathur and Dale Miller", booktitle = "{Handbook of Logic in Artificial Intelligence and Logic Programming}", title = "Higher-order Logic Programming", publisher = "Clarendon Press, Oxford", year = "1998", editor = "Dov M. Gabbay and C. J. Hogger and J. A. Robinson", volume = "5", pages = "499--590", } @InCollection{nadathur98handbook2, author = "Gopalan Nadathur and Donald W. Loveland", booktitle = "{Handbook of Logic in Artificial Intelligence and Logic Programming}", title = "Proof Procedures for Logic Programming", publisher = "Clarendon Press, Oxford", year = "1998", editor = "Dov M. Gabbay and C. J. Hogger and J. A. Robinson", volume = "5", pages = "163--234", } @Article{nadathur98jlc, author = "Gopalan Nadathur", title = "Uniform Provability in Classical Logic", journal = jlc, year = "1998", volume = "8", number = "2", pages = "209--229", } @Article{nadathur98tcs, author = "Gopalan Nadathur and Debra Sue Wilson", title = "A Notation for Lambda Terms: {A} Generalization of Environments", journal = tcs, year = "1998", volume = "198", number = "1-2", pages = "49--98", } @InProceedings{nadathur99cade, author = "Gopalan Nadathur and Dustin J. Mitchell", title = "System Description: {Teyjus} --- {A} Compiler and Abstract Machine Based Implementation of {$\lambda$Prolog}", editor = "H. Ganzinger", pages = "287--291", booktitle = cade99, year = "1999", series = lnai, number = "1632", publisher = "Springer", address = "Trento", doi = "10.1007/3-540-48660-7_25", } @Article{nadathur99jflp, author = "Gopalan Nadathur", title = "A Fine-Grained Notation for Lambda Terms and Its Use in Intensional Operations", journal = "Journal of Functional and Logic Programming", volume = "1999", number = "2", publisher = "MIT Press", month = mar, year = "1999", } @Article{nadathur99jflpb, author = "G.~Nadathur and G.~Tong", title = "Realizing Modularity in $\lambda${P}rolog", journal = "Journal of Functional and Logic Programming", volume = "1999", number = "9", publisher = "MIT Press", month = apr, year = "1999", } @Article{nakano94apal, author = "Hiroshi Nakano", title = "A Constructive Logic behind the Catch/Throw Mechanism", journal = apal, volume = "69", number = "2--3", pages = "269--301", year = "1994", } @Article{nanevski08tocl, author = "Aleksandar Nanevski and Frank Pfenning and Brigitte Pientka", title = "Contextual Modal Type Theory", journal = tocl, year = "2008", number = "3", volume = "9", pages = "1--49", } @Unpublished{narboux08nominal, title = "Nominal Formalisations of Typical {SOS} Proofs", author = "Julien Narboux and Christian Urban", year = "2008", URL = "https://dpt-info.u-strasbg.fr/~narboux/papers/SOS.pdf", } @InProceedings{naumowicz09tphol, author = "Adam Naumowicz and Artur Korni\l owicz", title = "A Brief Overview of {Mizar}", booktitle = "Theorem Proving in Higher Order Logics", year = "2009", editor = "Stefan Berghofer and Tobias Nipkow and Christian Urban and Makarius Wenzel", volume = "5674", series = lncs, pages = "67--72", doi = "10.1007/978-3-642-03359-9\_5", } @InProceedings{necula01popl, author = "George C. Necula and Shree Prakash Rahul", title = "Oracle-based checking of untrusted software", booktitle = popl01, editor = "Chris Hankin and Dave Schmidt", year = "2001", pages = "142--154", publisher = "ACM", } @InProceedings{necula96osdi, author = "George C. Necula and Peter Lee", title = "Safe Kernel Extensions Without Run-Time Checking", booktitle = "Proceedings of Operating Systems Design and Implementation (OSDI)", address = "Seattle, WA", organization = "USENIX Assoc.", pages = "229--243", year = "1996", month = oct, } @InProceedings{necula97popl, author = "George C. Necula", title = "Proof-Carrying Code", booktitle = "24th Symposium on Principles of Programming Languages 97", address = "Paris, France", publisher = "ACM", pages = "106--119", year = "1997", } @InProceedings{necula98lics, author = "George C. Necula and Peter Lee", title = "Efficient Representation and Validation of Proofs", booktitle = lics98, year = "1998", pages = "93--104", publisher = "IEEE Computer Society Press", address = "Los Alamitos, CA", } @Book{negri01spt, author = "Sara Negri and Jan {von Plato}", title = "Structural Proof Theory", publisher = "Cambridge University Press", year = "2001", } @Article{negri03aml, author = "Sara Negri", title = "Contraction-free sequent calculi for geometric theories with an application to {Barr's} theorem", journal = "Archive for Mathematical Logic", year = "2003", volume = "42", pages = "389--401", doi = "10.1007/s001530100124", } @Article{negri05jphil, author = "Sara Negri", title = "Proof Analysis in Modal Logic", journal = "Journal of Philosophical Logic", volume = "34", number = "5-6", year = "2005", pages = "507--544", doi = "10.1007/s10992-005-2267-3", } @InProceedings{negri05proof, title = "Proof analysis in non-classical logics", author = "Sara Negri", booktitle = "Logic Colloquium", series = "Lecture Notes in Logic", volume = "28", pages = "107--128", year = "2005", } @Article{negri14lu, author = "Sara Negri", title = "Proofs and Countermodels in Non-Classical Logics", journal = "Logica Universalis", volume = "8", number = "1", pages = "25--60", year = "2014", doi = "10.1007/s11787-014-0097-1", } @Article{negri16jlc, author = "Sara Negri", title = "Proof analysis beyond geometric theories: from rule systems to systems of rules", journal = "Journal of Logic and Computation", year = "2016", pages = "513--537", volume = "26", number = "2", doi = "10.1093/LOGCOM/EXU037", } @Article{negri98bsl, title = "Cut elimination in the presence of axioms", author = "Sara Negri and Jan {von Plato}", journal = "Bulletin of Symbolic Logic", year = "1998", number = "4", volume = "4", pages = "418--435", doi = "10.2307/420956", } @Article{negri99aml, title = "Sequent calculus proof theory of intuitionistic apartness and order relations", author = "Sara Negri", journal = "Arch. Math. Log", year = "1999", number = "8", volume = "38", pages = "521--547", } @Book{nelson93maa, author = "Roger B. Nelson", title = "Proofs Without Words: Exercises in Visual Thinking", publisher = "Mathematical Association of America", year = "1993", } @TechReport{nerode89a, author = "Anil Nerode", title = "Lectures on Intuitionistic Logic {II}", institution = "Cornell University", type = "MSI Technical Report 89-56", year = "1989", } @Article{nerode90lcs, title = "Some Lectures on Intuitionistic Logic", author = "Anil Nerode", journal = "Logic and Computer Science", publisher = "Springer", series = lnm, volume = "1429", pages = "12--59", year = "1990", } @InProceedings{nestmann96concur, author = "Uwe ~Nestmann and Benjamin C. Pierce", title = "Decoding choice encodings", booktitle = "Proc. of CONCUR'96", volume = "1119", series = lncs, year = "1996", publisher = "Springer", pages = "179--194", } @Article{nguyen02jar, author = "Quang Huy Nguyen and Claude Kirchner and H{\'e}l{\`e}ne Kirchner", title = "External Rewriting for Skeptical Proof Assistants", journal = jar, volume = "29", number = "3-4", year = "2002", ISSN = "0168-7433", pages = "309--336", publisher = "Kluwer Academic Publishers", address = "Hingham, MA, USA", } @Article{nielson88scp, author = "H. Nielson and F. Nielson", title = "Automatic Binding Time Analysis for a Typed $\lambda$-Calculus", journal = "Science of Computer Programming", volume = "10", number = "2", pages = "139--176", year = "1988", } @Article{nielson88tcs, author = "F. Nielson and H. Nielson", title = "Two-Level Semantics and Code Generation", journal = tcs, volume = "56", year = "1988", pages = "59--133", } @Book{nielson92, author = "Hanne Riis Nielson and Flemming Nielson", title = "Semantics with Applications: {A} Formal Introduction", publisher = "Wiley", year = "1992", } @InProceedings{nigam08cie, author = "Vivek Nigam", title = "Using tables to construct non-redundant proofs", booktitle = "CiE 2008: Abstracts and extended abstracts of unpublished papers", year = "2008", pdf = "https://www.lix.polytechnique.fr/~nigam/docs/nigam_Non_Redundant_Proofs.pdf", } @InProceedings{nigam08ijcar, author = "Vivek Nigam and Dale Miller", title = "Focusing in linear meta-logic", booktitle = "Proceedings of IJCAR: International Joint Conference on Automated Reasoning", year = "2008", editor = "Alessandro Armando and Peter Baumgartner and Gilles Dowek", URL = "https://hal.inria.fr/inria-00281631/en/", publisher = pub-sv, series = lnai, pages = "507--522", volume = "5195", } @Unpublished{nigam08tr, author = "Vivek Nigam and Dale Miller", title = "Focusing in linear meta-logic: Extended Report", URL = "https://hal.inria.fr/inria-00281631", year = "2008", note = "Technical report", } @PhdThesis{nigam09phd, author = "Vivek Nigam", title = "Exploiting non-canonicity in the sequent calculus", school = "Ecole Polytechnique", year = "2009", month = sep, URL = "https://www.nigam.info/thesis/Vivek_Nigam_phd.pdf", } @InProceedings{nigam09ppdp, author = "Vivek Nigam and Dale Miller", title = "Algorithmic specifications in linear logic with subexponentials", booktitle = ppdp09, editor = "Ant\'onio Porto and Francisco Javier L\'opez-Fraguas", pages = "129--140", year = "2009", publisher = "ACM", doi = "10.1145/1599410.1599427", } @Article{nigam10jar, author = "Vivek Nigam and Dale Miller", title = "A framework for proof systems", volume = "45", number = "2", journal = jar, pages = "157--188", year = "2010", URL = "https://springerlink.com/content/m12014474287n423/", pdf = "https://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/nigam-ijcar.pdf", } @InProceedings{nigam10lsfa, author = "Vivek Nigam and Elaine Pimentel and Giselle Reis", title = "Specifying proof systems in linear logic with subexponentials", year = "2011", volume = "269", pages = "109--123", booktitle = "Proceedings of the Fifth Logical and Semantic Frameworks, with Applications Workshop (LSFA 2010)", series = entcs, publisher = "Elsevier", } @Article{nigam14jlc, author = "Vivek Nigam and Elaine Pimentel and Giselle Reis", title = "An extended framework for specifying and reasoning about proof systems", journal = jlc, publisher = "Oxford University Press", doi = "10.1093/logcom/exu029", year = "2014", } @Article{nigam14tcs, author = "Vivek Nigam", title = "A framework for linear authorization logics", journal = "Theoretical Computer Science", year = "2014", volume = "536", pages = "21--41", } @Article{nigam17tcs, title = "On subexponentials, focusing and modalities in concurrent systems", author = "Vivek Nigam and Carlos Olarte and Elaine Pimentel", journal = "Theoretical Computer Science", year = "2017", volume = "693", pages = "35--58", } @TechReport{nigam19fortiss, author = "Vivek Nigam and Tewodros Beyene and Dian Balta and Taha Cherfia and Harald Ruess", title = "Cyberlogic: Foundations and Applications for Evidential Transactions", institution = "fortiss", year = "2019", note = "A white paper", } @Book{nilsson80, author = "Nils Nilsson", title = "Principles of Artificial Intelligence", publisher = "Tioga", address = "Palo Alto", year = "1980", } @Book{nipkow02book, author = "Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel", title = "Isabelle/{HOL} --- {A} Proof Assistant for Higher-Order Logic", publisher = "Springer", series = lncs, number = "2283", year = "2002", } @InProceedings{nipkow91lics, author = "Tobias Nipkow", title = "Higher-Order Critical Pairs", booktitle = lics91, publisher = "IEEE", editor = "G. Kahn", month = jul, year = "1991", pages = "342--349", } @InProceedings{nipkow93lics, title = "Functional Unification of Higher-Order Patterns", author = "Tobias Nipkow", pages = "64--74", booktitle = lics93, publisher = "IEEE", editor = "M. Vardi", month = jun, year = "1993", } @InCollection{nonnengart01handbook, author = "Andreas Nonnengart and Christoph Weidenbach", title = "Computing Small Clause Normal Forms", pages = "335--367", chapter = "6", volume = "I", editor = "Alan Robinson and Andrei Voronkov", booktitle = "Handbook of Automated Reasoning", publisher = "Elsevier Science B.V.", year = "2001", } @Book{nordstrom90, author = "Bengt Nordstrom and Kent Petersson and Jan M. Smith", title = "Programming in Martin-{L}{\"o}f's type theory : an introduction", publisher = "Oxford: Clarendon", year = "1990", series = "International Series of Monographs on Computer Science", } @Article{nour00aml, title = "Mixed logic and storage operators", author = "Karim Nour", journal = "Archive for Mathematical Logic", year = "2000", number = "4", volume = "39", pages = "261--280", doi = "10.1007/s001530050147", } @Article{nour03jancl, title = "Propositional mixed logic: its syntax and semantics", author = "Karim Nour and Abir Nour", journal = "Journal of Applied Non-Classical Logics", year = "2003", number = "3-4", volume = "13", pages = "377--390", } @PhdThesis{novakovic11phd, author = "Novak Novakovi{\'c}", title = "{S}{\'e}mantique Alg{\'e}brique des Ressources pour la Logique Classique", school = "Institut National Polytechnique de Lorraine", year = "2011", } @InProceedings{novakovic11tacl, author = "Novak Novakovi{\'c} and Fran{\c{c}}ois Lamarche", title = "Frobenius algebras and classical proof nets", booktitle = "Fifth International Conference on Topology, Algebra, and Categories in Logic (TACL)", pages = "235--238", year = "2011", address = "Marseilles, France", month = jul, } @Misc{novakovic13, author = "Novak Novakovi\'{c} and Lutz Stra{\ss}burger", title = "On the Power of Substitution in the Calculus of Structures", year = "2013", note = "Submitted", } @Article{nystrom2011uefi, author = "{Nystrom et al}", title = "{UEFI} Networking and Pre-{OS} Security", journal = "Intel Technology Journal - UEFI Today: Boostrapping the Continuum", volume = "15", number = "1", pages = "80--101", year = "2011", month = oct, } @Misc{ocaml.website, author = "{OC}aml", year = "2018", howpublished = "\url{https://ocaml.org/}", key = "ocaml", } @InProceedings{ogata02csl, author = "Ichiro Ogata", title = "A Proof Theoretical Account of Continuation Passing Style", booktitle = "Compute Science Logic, {CSL}", pages = "490--505", year = "2002", } @InProceedings{ogata98asian, author = "Ichiro Ogata", title = "Cut Elimination for Classical Proofs as Continuation Passing Style Computation", booktitle = "Fourth Asian Computing Science Conference (ASIAN '98)", volume = "1538", pages = "61--78", year = "1998", publisher = "Springer", booktitle = "ASIAN", editor = "Jieh Hsiang and Atsushi Ohori", series = "Lecture Notes in Computer Science", } @InProceedings{ohearn91ctcs, author = "P. W. O'Hearn", title = "Linear Logic and Interference Control: Preliminary Report", booktitle = "{Proceedings of the Conference on Category Theory and Computer Science}", address = "Paris, France", year = "1991", editor = "S. Abramsky and P.-L. Curien and A. M. Pitts D. H. Pitt and A. Poign{\'e} and D. E. Rydeheard", pages = "74--93", publisher = "Springer", series = lncs, volume = "530", } @InProceedings{ohearn93popl, author = "Peter W. O'Hearn and Robert D. Tennent", title = "Relational Parametricity and Local Variables", booktitle = "Proc. $20^{th}$ Annual {ACM} Symposium on Principles of Programming Languages", pages = "171--184", year = "1993", publisher = "ACM", } @Article{ohearn99bsl, author = "P. O'Hearn and D. Pym", title = "The logic of bunched implications", journal = "Bulletin of Symbolic Logic", year = "1999", volume = "5", number = "2", pages = "215--244", month = jun, } @Article{okada99tcs, title = "Phase Semantic Cut-Elimination and Normalization Proofs of First- and Higher-Order Linear Logic", author = "Mitsuhiro Okada", journal = "Theor. Comput. Sci", year = "1999", number = "1-2", volume = "227", pages = "333--396", doi = "10.1016/S0304-3975(99)00058-4", } @InProceedings{okeefe85slp, author = "Richard A. O'Keefe", title = "Towards an Algebra for Constructing Logic Programs", booktitle = "Proceedings of the IEEE Symposium on Logic Programming", editor = "J. Cohen and J. Connery", year = "1985", pages = "152--160", publisher = "IEEE Computer Society Press", } @Book{okeefe90book, author = "Richard A. O'Keefe", title = "The Craft of {Prolog}", publisher = "MIT Press", year = "1990", } @Article{olarte15lsfa, author = "Carlos Olarte and Elaine Pimentel", title = "Proving Concurrent Constraint Programming Correct, Revisited", journal = "Electronic Notes in Theoretical Computer Science", volume = "312", number = "0", pages = "179--195", year = "2015", note = "Ninth Workshop on Logical and Semantic Frameworks, with Applications (LSFA 2014)", doi = "10.1016/j.entcs.2015.04.011", URL = "https://www.sciencedirect.com/science/article/pii/S1571066115000158", } @Article{olarte15tcs, author = "Carlos Olarte and Vivek Nigam and Elaine Pimentel", title = "Subexponential concurrent constraint programming", journal = tcs, year = "2015", doi = "10.1016/j.tcs.2015.06.031", volume = "606", month = nov, pages = "98--120", publisher = "Elsevier", } @Article{olarte23jlamp, author = "Carlos Olarte and Elaine Pimentel and Camilo Rocha", title = "A rewriting logic approach to specification, proof-search, and meta-proofs in sequent systems", journal = "Journal of Logical and Algebraic Methods in Programming", year = "2023", doi = "10.1016/j.jlamp.2022.100827", volume = "130", } @InProceedings{ong96popl, author = "C.{-}H. Luke Ong and Charles A. Stewart", title = "A {Curry-Howard} Foundation for Functional Computation with Control", booktitle = "Conference Record of POPL'97: The 24th {ACM} {SIGPLAN-SIGACT} Symposium on Principles of Programming Languages, Paris, France, 15-17 January 1997", pages = "215--227", year = "1997", URL = "https://doi.acm.org/10.1145/263699.263722", doi = "10.1145/263699.263722", publisher = "ACM", } @InCollection{ono98msj, author = "Hiroakira Ono", title = "Proof-theoretic methods in nonclassical logic. An Introduction", booktitle = "Theories of Types and Proofs", publisher = "Mathematical Society of Japan", year = "1998", editor = "M. Takahashi and M. Okada and M. Dezani-Ciancaglini", volume = "2", series = "Mathematical Society of Japan Memoirs", pages = "207--254", } @Article{orevkov79zns, author = "V. P. Orevkov", title = "Lower bounds for lengthening of proofs after cut-elimination", journal = "Zapiski Nauchnykh Seminarov LOMI", year = "1979", volume = "88", pages = "137--162", note = "English translation in: \cite{Orevkov79e}", } @Article{orevkov82jsm, author = "V. P. Orevkov", title = "Lower bounds for lengthening of proofs after cut-elimination", journal = "J. Soviet Mathematics", year = "1982", volume = "20", pages = "2337--2350", } @Article{otten03jsc, author = "Jens Otten and Wolfgang Bibel", title = "{{\tt leanCoP}}: lean connection-based theorem proving", journal = "Journal of Symbolic Computation", volume = "36", number = "1--2", pages = "139--161", month = jul, year = "2003", } @InProceedings{owre92cade, author = "{S.} Owre and {J.} {M.} Rushby and and {N.} Shankar", title = "{PVS:} {A} Prototype Verification System", booktitle = cade92, year = "1992", editor = "Deepak Kapur", series = lnai, volume = "607", pages = "748--752", month = jun, publisher = "Springer", URL = "https://www.csl.sri.com/papers/cade92-pvs/", } @InProceedings{owre96cav, author = "S. Owre and S. Rajan and J. M. Rushby and N. Shankar and M. K. Srivas", title = "{PVS:} Combining Specification, Proof Checking, and Model Checking", booktitle = "Computer-Aided Verification, {CAV} '96", year = "1996", editor = "Rajeev Alur and Thomas {A.} Henzinger", series = "Lecture Notes in Computer Science", number = "1102", pages = "411--414", address = "New Brunswick, {NJ}", month = jul # "/" # aug, publisher = "Springer-Verlag", URL = "https://www.csl.sri.com/papers/pvs-cav96/", } @InProceedings{pacholski97cp, author = "Leszek Pacholski and Andreas Podelski", title = "Set Constraints: {A} Pearl in Research on Constraints", booktitle = "Principles and Practice of Constraint Programming - CP97", pages = "549--562", year = "1997", number = "1330", series = lncs, publisher = "Springer", } @Article{padovani00mscs, title = "Decidability of fourth-order matching", author = "Vincent Padovani", journal = "Mathematical Structures in Computer Science", year = "2000", number = "3", volume = "10", pages = "361--372", } @Article{padovani22fair, title = "On the Fair Termination of Client-Server Sessions", author = "Luca Padovani", journal = "arXiv preprint arXiv:2212.05457", year = "2022", } @TechReport{pagani08tr, author = "Michele Pagani and Alexis Saurin", title = "Stream Associative Nets and Lambda-mu-calculus", institution = "INRIA", year = "2008", number = "6431", month = jan, URL = "https://hal.inria.fr/inria-00221221/en", } @InProceedings{palamidessi90, author = "C. Palamidessi", title = "Algebraic properties of idempotent substitutions", booktitle = "Proc. of the 17th ICALP", editor = "M. S. Paterson", year = "1990", pages = "386--399", publisher = "Springer", series = lncs, volume = "443", } @Proceedings{palamidessi97express, title = "Proceedings of {EXPRESS}'97", year = "1997", editor = "Catuscia Palamidessi and Joachim Parrow", volume = "7", series = entcs, publisher = "Elsevier Science B.V.", URL = "https://www.elsevier.nl/locate/entcs/volume7.html", } @InProceedings{palamidessi97jfplc, author = "Catuscia Palamidessi", title = "Constraint Programming for Concurrent and Distributed Computing", booktitle = "Proc. of the JFPLC-UNIF '97", editor = "Herm\`es", year = "1997", pages = "11--20", note = "Invited talk.", } @InProceedings{palamidessi97popl, author = "Catuscia Palamidessi", title = "Comparing the expressive power of the Synchronous and the Asynchronous $\pi$-calculus", booktitle = "Proceedings of the 24th ACM Symposium on Principles of Programming Languages", year = "1997", publisher = "ACM", pages = "256--265", } @InProceedings{parent95mpc, author = "C. Parent", title = "Synthesizing proofs from programs in the Calculus of Inductive Constructions", booktitle = "Third International Conference on the Mathematics of Program Construction", series = lncs, number = "947", publisher = "Springer", month = jul, year = "1995", } @PhdThesis{parent95phd, author = "C. Parent", title = "Synth\`ese de preuves de programmes dans le Calcul des Constructions Inductives", school = "\'Ecole Normale Sup\'erieure de Lyon", type = "th\`ese d'Universite", month = jan, year = "1995", } @InProceedings{parent95tphol, author = "C. Parent", title = "Natural proofs versus programs optimization in the Calculus of Inductive Constructions", booktitle = "Theorem Proving in Higher-Order Logic", year = "1996", note = "Poster Session", } @PhdThesis{pareschi89phd, author = "Remo Pareschi", year = "1989", title = "Type-driven Natural Language Analysis", school = "University of Edinburgh", } @InProceedings{pareschi90iclp, title = "Extending Definite Clause Grammars with Scoping Constructs", author = "Remo Pareschi and Dale Miller", year = "1990", booktitle = "{1990 International Conference in Logic Programming}", month = jun, pages = "373--389", publisher = "MIT Press", editor = "David H. D. Warren and Peter Szeredi", } @InProceedings{parigot92lpar, author = "Michel Parigot", title = "$\lambda\mu$-Calculus: An Algorithmic Interpretation of Classical Natural Deduction", booktitle = lpar92, pages = "190--201", year = "1992", volume = "624", series = lncs, publisher = "Springer", } @InProceedings{parigot92rclp, author = "Michel Parigot", title = "Free Deduction: An Analysis of ``Computations'' in Classical Logic", booktitle = "Proceedings of the First Russian Conference on Logic Programming", year = "1992", pages = "361--380", series = lnai, number = "592", publisher = "Springer", } @InProceedings{parigot93lics, title = "Strong Normalization for Second Order Classical Natural Deduction", author = "Michel Parigot", pages = "39--46", booktitle = lics93, publisher = "IEEE", editor = "M. Vardi", month = jun, year = "1993", } @Article{parikh73tacm, author = "R. J. Parikh", title = "Some results on the length of proofs", journal = "Transactions of the ACM", year = "1973", volume = "177", pages = "29--36", } @Misc{parinati.website, title = "{P}arinati", author = "Zachary Snow", year = "2010", howpublished = "\url{https://www.cs.umn.edu/~snow/parinati}", key = "zzz", } @InProceedings{paris78lc, author = "J. B. Paris and L. A. S. Kerby", title = "${\Sigma}_n$-Collection Schemas in Arithmetic", booktitle = "Logic Colloquium '77", year = "1978", editor = "A. Macintyre and L. Pacholski and J. Paris", volume = "96", series = "Studies in logic and the foundations of mathematics", pages = "199--209", publisher = "North-Holland", } @InProceedings{park05popl, author = "Sungoo Park and Frank Pfenning and Sebastian Thrun", title = "A probabilistic language based upon sampling function", booktitle = popl05, pages = "171--182", year = "2005", publisher = "ACM", } @InProceedings{park81tcs, author = "D. Park", title = "Concurrency and automata on infinite sequences", volume = "104", year = "1981", booktitle = "Theoretical Computer Science: 5th {GI}-Conference", editor = "P. Deussen", pages = "167--183", address = "Karlsruhe, Germany", series = lncs, } @InCollection{parrow01handbook, author = "Joachim Parrow", editor = "Bergstra and Ponse and Smolka", booktitle = "Handbook of Process Algebra", title = "An Introduction to the pi-Calculus", publisher = "Elsevier", year = "2001", pages = "479--543", } @InProceedings{parrow98lics, author = "Joachim Parrow and Bjorn Victor", title = "The Fusion Calculus: Expressiveness and Symmetry in Mobile Processes", booktitle = lics98, pages = "176--185", year = "1998", } @Article{passy91ic, author = "S. Passy and T. Tinchev", title = "An essay in combinatory dynamic logic", journal = "Information and Computation", year = "1991", volume = "93", pages = "263--332", } @Article{paterson78jcss, author = "M. S. Paterson and M. N. Wegman", key = "Paterson and Wegman 78", title = "Linear Unification", journal = jcss, volume = "16", year = "1978", pages = "158--167", } @Article{paul16rand, title = "{The Russian ``Firehose of Falsehood'' Propaganda Model}", author = "Christopher Paul and Miriam Matthews", journal = "Rand Corporation", volume = "2", number = "7", pages = "1--10", year = "2016", publisher = "JSTOR", URL = "https://www.rand.org/pubs/perspectives/PE198.html", } @InProceedings{paulin93tlca, author = "Christine Paulin-Mohring", title = "Inductive Definitions in the System {Coq}: Rules and Properties", editor = "M. Bezem and J. F. Groote", pages = "328--345", booktitle = "Proceedings of the International Conference on Typed Lambda Calculi and Applications", year = "1993", publisher = "Springer", series = lncs, volume = "664", address = "Utrecht, The Netherlands", month = mar, } @PhdThesis{paulin96hdr, author = "Christine Paulin-Mohring", title = "{D}{\'e}finitions Inductives en Th{\'e}orie des Types d'Ordre Sup{\'e}rieur", school = "Universit{\'e} Claude Bernard Lyon I", year = "1996", month = DEC, type = "Habilitation {\`a} diriger les recherches", URL = "https://www.lri.fr/~paulin/PUBLIS/habilitation.ps.gz", } @InCollection{paulson07tphol, title = "Source-level proof reconstruction for interactive theorem proving", author = "Lawrence C Paulson and Kong Woei Susanto", booktitle = "Theorem Proving in Higher Order Logics", pages = "232--245", year = "2007", publisher = "Springer", } @InProceedings{paulson10iwil, author = "Lawrence C. Paulson and Jasmin Christian Blanchette", title = "Three years of experience with Sledgehammer, a Practical Link Between Automatic and Interactive Theorem Provers.", booktitle = "IWIL-LPAR", year = "2010", pages = "1--11", } @Article{paulson83scp, author = "Lawrence C. Paulson", title = "A Higher-Order Implementation of Rewriting", journal = "Science of Computer Programming", volume = "3", number = "2", pages = "119--149", year = "1983", } @InCollection{paulson84mtcc, author = "Larry Paulson", title = "Compiler {G}eneration from {D}enotational {S}emantics", editor = "Bernard Lorho", booktitle = "Methods and Tools for Compiler Construction", pages = "219--250", publisher = "Cambridge Univ. Press", year = "1984", } @Article{paulson86jlp, author = "Lawrence C. Paulson", title = "Natural Deduction as Higher-Order Resolution", journal = "Journal of Logic Programming", volume = "3", year = "1986", pages = "237--258", } @Book{paulson87book, author = "Lawrence C. Paulson", title = "Logic and Computation: Interactive Proof with Cambridge {LCF}", publisher = "Cambridge University Press", year = "1987", } @Article{paulson89jar, author = "Lawrence C. Paulson", title = "The foundation of a generic theorem prover", journal = jar, year = "1989", volume = "5", pages = "363--397", month = sep, doi = "10.1007/BF00248324", } @InCollection{paulson90abs, author = "Lawrence C. Paulson", title = "Isabelle: The Next 700 Theorem Provers", booktitle = "Logic and Computer Science", editor = "Piergiorgio Odifreddi", publisher = "Academic Press", pages = "361--386", year = "1990", } @Book{paulson94book, author = "Lawrence C. Paulson", title = "Isabelle: {A} Generic Theorem Prover", publisher = "Springer", series = "Science \& Business Media", number = "828", year = "1994", } @Article{paulson96jar, author = "Lawrence C. Paulson and Krzysztof Gr\c{a}bczewski", doi = "10.1007/BF00283132", journal = JAR, month = dec, number = "3", pages = "291--323", title = "Mechanizing Set Theory: Cardinal Arithmetic and the Axiom of Choice", volume = "17", year = "1996", } @Article{paulson97jlc, title = "Mechanizing Coinduction and Corecursion in Higher-order Logic", author = "Lawrence C. Paulson", pages = "175--204", journal = jlc, year = "1997", month = apr, volume = "7", number = "2", } @Article{paulson97wos, author = "Lawrence C. Paulson", title = "Generic automatic proof tools", booktitle = "Automated reasoning and its applications: essays in honor of {Larry Wos}", year = "1997", ISBN = "0-262-22055-5", pages = "23--47", publisher = "MIT Press", address = "Cambridge, MA, USA", } @Article{paulson98jcs, author = "Lawrence C. Paulson", title = "The inductive approach to verifying cryptographic protocols", journal = "Journal of Computer Security", year = "1998", volume = "6", pages = "85--128", } @Article{paulson99jucs, author = "Lawrence C. Paulson", title = "A Generic Tableau Prover and its Integration with Isabelle.", journal = "J. UCS", volume = "5", number = "3", year = "1999", pages = "73--87", URL = "https://www.jucs.org/jucs_5_3/a_generic_tableau_prover", } @InCollection{pavlovi98cmcs, author = "Du{\v{s}}ko Pavlovi{\'c}", title = "Guarded Induction on Final Coalgebras", editor = "B. Jacobs and L. Moss and H. Reichel and J. Rutten", booktitle = "Proceedings 1st Workshop on Coalgebraic Methods in Computer Science, CMCS'98, Lisbon, Portugal, 28--29 March 1998", series = entcs, volume = "11", publisher = "Elsevier", address = "Amsterdam", year = "1998", } @InCollection{pavlovi98lics, author = "D. Pavlovi{\'c} and M. H. Escard{\'o}", title = "Calculus in Coinductive Form", booktitle = lics98, publisher = "IEEE Computer Society Press", address = "Los Alamitos, CA", year = "1998", } @Book{peano89, author = "Giuseppe Peano", year = "1889", title = "Arithmetices principia, nova methodo exposita", publisher = "Fratres Bocca", address = "Turin", } @Article{peltier03extracting, author = "Nicolas Peltier", title = "Extracting models from clause sets saturated under semantic refinements of the resolution rule", journal = "Information and Computation", volume = "181", number = "2", pages = "99--130", year = "2003", note = "", ISSN = "0890-5401", doi = "10.1016/S0890-5401(03)00016-6", } @Article{pereira80ai, author = "Fernando C. N. Pereira and David H. D. Warren", year = "1980", title = "Definite Clauses for Language Analysis", journal = "Artificial Intelligence", volume = "13", pages = "231--278", } @Article{pereira81ajcl, author = "Fernando Pereira", title = "Extraposition grammars", journal = "American Journal for Computational Linguistics", year = "1981", volume = "7", pages = "243--256", } @Book{pereira87, author = "Fernando C. N. Pereira and Stuart M. Shieber", title = "{Prolog} and Natural-Language Analysis", publisher = "CLSI", address = "Stanford, CA", volume = "10", year = "1987", } @Manual{pereira88manual, title = "{C}-{Prolog} User's Manual, Version 1.5", author = "Fernando Pereira", month = jun, year = "1988", URL = "https://www.cs.duke.edu/csl/docs/cprolog.html", } @InProceedings{pereira90jelia, author = "Fernando C. N. Pereira", title = "Semantic Interpretation as Higher-Order Deduction", booktitle = "Logics in {AI}: European Workshop {JELIA}'90", year = "1991", editor = "Jan van Eijck", publisher = "Springer, Berlin, Germany", address = "Amsterdam, Holland", series = lnai, number = "478", pages = "78--96", } @InProceedings{pereira90naclp, author = "Fernando C. N. Pereira", title = "Prolog and Natural-Language Analysis: into the Third Decade", booktitle = "Proceedings of the 1990 North American Conference on Logic Programming", year = "1990", publisher = "MIT Press", } @InProceedings{pereira90wlai, author = "Fernando C. N. Pereira", title = "Semantic Interpretation as Higher-Order Deduction", booktitle = "Proceedings of the Second European Workshop on Logics and AI", month = sep, year = "1990", publisher = "Springer", } @Article{perlis82sigplan, author = "Alan J. Perlis", journal = "ACM SIGPLAN Notices", month = sep, pages = "7--13", title = "Epigrams on Programming", year = "1982", volume = "17", number = "9", URL = "https://doi.acm.org/10.1145/947955.1083808", } @InProceedings{petersen03popl, author = "Leaf Petersen and Robert Harper and Karl Crary and Frank Pfenning", title = "A type theory for memory allocation and data layout", booktitle = "POPL", pages = "172--184", year = "2003", publisher = "ACM", } @InCollection{petrolo11ludics, title = "Negative translations and duality: toward a unified approach", author = "Mattia Petrolo", booktitle = "Ludics, dialogue and interaction", pages = "188--204", year = "2011", publisher = "Springer", } @Article{pettorossi94jlp, author = "A. Pettorossi and M. Proietti", title = "Transformation of Logic Programs: Foundations and Techniques", journal = "Journal of Logic Programming", volume = "19/20", pages = "261--320", year = "1994", } @Unpublished{pfenning.cd, author = "Frank Pfenning", title = "Computation and Deduction", note = "To be published by Cambridge University Press", } @Article{pfenning00ic, author = "Frank Pfenning", title = "Structural Cut Elimination {I}. Intuitionistic and Classical Logic", journal = "Information and Computation", year = "2000", volume = "157", number = "1/2", pages = "84--141", month = mar, } @InCollection{pfenning01handbook, author = "Frank Pfenning", editor = "John Alan Robinson and Andrei Voronkov", title = "Logical Frameworks", booktitle = "Handbook of Automated Reasoning (in 2 volumes)", pages = "1063--1147", publisher = "Elsevier and {MIT} Press", year = "2001", } @Article{pfenning01mscs, author = "Frank Pfenning and Rowan Davies", title = "A Judgmental Reconstruction of Modal Logic", journal = "Mathematical Structures in Computer Science", year = "2001", volume = "11", pages = "511--540", } @Unpublished{pfenning04ln, author = "Frank Pfenning", title = "Automated Theorem Proving", note = "Lecture notes", month = mar, year = "2004", } @InCollection{pfenning08andrews, author = "Frank Pfenning", title = "Church and {Curry}: {Combining} Intrinsic and Extrinsic Typing", booktitle = "Reasoning in Simple Type Theory: Festschrift in Honor of Peter B. Andrews on His 70th Birthday", publisher = "College Publications", editor = "Christoph Benzm{\"u}ller and Chad E. Brown and J{\"o}rg Siekmann and Richard Statman", year = "2008", series = "Studies in Logic", number = "17", pages = "303--338", } @InProceedings{pfenning09lics, author = "Frank Pfenning and Robert J. Simmons", title = "Substructural Operational Semantics as Ordered Logic Programming", booktitle = lics09, pages = "101--110", year = "2009", month = aug, } @InProceedings{pfenning84, title = "Analytic and Non-analytic Proofs", author = "Frank Pfenning", booktitle = "Seventh International Conference on Automated Deduction", address = "Napa, CA", month = may, year = "1984", pages = "394--413", publisher = "Springer", series = lncs, volume = "170", editor = "R. E. Shostak", } @PhdThesis{pfenning87phd, author = "Frank Pfenning", title = "Proof Transformations in Higher-Order Logic", school = "Carnegie Mellon University", month = jan, year = "1987", } @TechReport{pfenning88cmu, author = "Frank Pfenning and Peter Lee", title = "{LEAP}: {A} Language with Eval and Polymorphism", institution = "Carnegie Mellon University", address = "Pittsburgh, Pennsylvania", type = "Ergo Report", number = "88-065", month = jul, year = "1988", } @InProceedings{pfenning88lfp, author = "Frank Pfenning", title = "Partial Polymorphic Type Inference and Higher-Order Unification", booktitle = "Proceedings of the {ACM} Lisp and Functional Programming Conference", year = "1988", publisher = "ACM", } @InProceedings{pfenning88pldi, author = "Frank Pfenning and Conal Elliott", title = "Higher-Order Abstract Syntax", booktitle = "Proceedings of the {ACM}-{SIGPLAN} Conference on Programming Language Design and Implementation", pages = "199--208", publisher = "ACM Press", month = jun, year = "1988", } @InProceedings{pfenning89lics, author = "Frank Pfenning", title = "Elf: {A} Language for Logic Definition and Verified Metaprogramming", booktitle = lics89, pages = "313--321", address = "Monterey, CA", month = jun, year = "1989", publisher = "IEEE", } @InCollection{pfenning90lc, author = "Frank Pfenning", title = "Program Development through Proof Transformation", booktitle = "Logic and Computation", editor = "Wilfried Sieg", publisher = "AMS", address = "Providence, Rhode Island", series = "Contemporary Mathematics", year = "1990", } @InProceedings{pfenning91lf, author = "Frank Pfenning", title = "Logic Programming in the {LF} Logical Framework", booktitle = "Logical Frameworks", editor = "G\'{e}rard Huet and G. Plotkin", publisher = "Cambridge University Press", pages = "149--181", year = "1991", } @InProceedings{pfenning91lics, author = "Frank Pfenning", title = "Unification and Anti-Unification in the {Calculus} of {Constructions}", booktitle = lics91, publisher = "IEEE", month = jul, editor = "G. Kahn", year = "1991", pages = "74--85", } @Unpublished{pfenning91unp, author = "Frank Pfenning", title = "A Module Calculus Based on Logic Programs as Signatures", note = "Extended abstract", year = "1991", } @InProceedings{pfenning92cade, author = "Frank Pfenning and Ekkehard Rohwedder", title = "Implementing the Meta-Theory of Deductive Systems", month = jun, year = "1992", pages = "537--551", series = lncs, number = "607", publisher = "Springer", booktitle = "Proceedings of the 1992 Conference on Automated Deduction", } @TechReport{pfenning92tr, author = "Frank Pfenning", title = "A proof of the {C}hurch-{R}osser theorem and its representation in a logical framework", institution = "School of Computer Science, Carnegie Mellon University", address = "Pittsburgh, Pennsylvania", number = "CMU-CS-92-186", month = sep, year = "1992", } @Book{pfenning92types, title = "Types in Logic Programming", publisher = "MIT Press", year = "1992", editor = "Frank Pfenning", } @Article{pfenning93fi, author = "Frank Pfenning", title = "On the Undecidability of Partial Polymorphic Type Reconstruction", journal = "Fundam. Informaticae", volume = "19", number = "1/2", pages = "185--199", year = "1993", } @InProceedings{pfenning94cade, author = "F. Pfenning", title = "Elf: {A} meta-language for deductive systems (System Description)", editor = "Alan Bundy", booktitle = "12th International Conference on Automated Deduction", publisher = "Springer-Verlag", series = lnai, volume = "814", pages = "811--815", year = "1994", } @InProceedings{pfenning95lics, title = "Structural Cut Elimination", author = "Frank Pfenning", pages = "156--166", booktitle = lics95, year = "1995", address = "San Diego, California", organization = "IEEE Computer Society Press", } @InProceedings{pfenning96ctap, author = "Frank Pfenning", title = "The practice of logical frameworks", booktitle = "Proceedings of the Colloquium on Trees in Algebra and Programming", pages = "119--134", year = "1996", editor = "H\'el\`ene Kirchner", series = lncs, volume = "1059", publisher = "Springer", } @InProceedings{pfenning99cade, author = "Frank Pfenning and Carsten Sch{\"u}rmann", title = "System Description: {Twelf} --- {A} Meta-Logical Framework for Deductive Systems", editor = "H. Ganzinger", pages = "202--206", booktitle = cade99, year = "1999", publisher = "Springer", series = lnai, number = "1632", address = "Trento", doi = "10.1007/3-540-48660-7\_14", } @InProceedings{pientka02iclp, title = "A Proof-Theoretic Foundation for Tabled Higher-Order Logic Programming", author = "Brigitte Pientka", booktitle = "Logic Programming, 18th International Conference, ICLP 2002, Copenhagen, Denmark, July 29 - August 1, 2002, Proceedings", publisher = "Springer", year = "2002", volume = "2401", editor = "Peter J. Stuckey", pages = "271--286", series = lncs, } @PhdThesis{pientka03phd, author = "Brigitte Pientka", title = "Tabled higher-order logic programming", school = "Carnegie Mellon University", month = dec, year = "2003", note = "CMU-CS-03-185", } @InProceedings{pientka05cade, author = "Brigitte Pientka", title = "Tabling for higher-order logic programming", booktitle = "20th International Conference on Automated Deduction, Talinn, Estonia", pages = "54--69", year = "2005", publisher = "Springer", } @InProceedings{pientka07tphols, author = "Brigitte Pientka", title = "Proof Pearl: The Power of Higher-Order Encodings in the Logical Framework {LF}", booktitle = "Proceedings of the 20th International Conference on Theorem Proving in Higher Order Logics (TPHOLs)", year = "2007", pages = "246--261", doi = "10.1007/978-3-540-74591-4\_19", editor = "Klaus Schneider and Jens Brandt", series = lncs, volume = "4732", publisher = pub-sv, } @InProceedings{pientka08popl, author = "Brigitte Pientka", title = "A type-theoretic foundation for programming with higher-order abstract syntax and first-class substitutions", booktitle = "35th Annual {ACM} Symposium on Principles of Programming Languages (POPL'08)", publisher = "ACM", pages = "371--382", year = "2008", } @InProceedings{pientka10ijcar, author = "Brigitte Pientka and Joshua Dunfield", title = "Beluga: {A} Framework for Programming and Reasoning with Deductive Systems (System Description)", booktitle = ijcar10, year = "2010", pages = "15--21", editor = "J. Giesl and R. H{\"a}hnle", series = lncs, number = "6173", } @Book{pierce02book, author = "Benjamin C. Pierce", ISBN = "0-262-16209-1", year = "2002", publisher = "{MIT Press}", title = "Types and Programming Languages", } @Book{pierce05book, editor = "Benjamin C. Pierce", title = "Advanced topics in types and programming languages", publisher = "MIT Press", pages = "xiii + 574", year = "2005", } @Book{pierce10online, author = "Benjamin C. Pierce and Arthur Azevedo de Amorim and Chris Casinghino and Marco Gaboardi and Michael Greenberg and C\u{a}t\u{a}lin Hriţcu and Vilhelm Sj{\"o}berg and Andrew Tolmach and Brent Yorgey", title = "Programming Language Foundations", publisher = "Online", year = "2010", volume = "2", URL = "https://www. cis. upenn. edu/bcpierce/sf/current/index.html", series = "Software Foundations", } @TechReport{pierce88tr, author = "Benjamin C. Pierce", title = "A Taste of Category Theory for Computer Scientists", institution = "Computer Science Dept, Carnegie Mellon University", address = "Pittsburgh", number = "CMU-CS-88-203", year = "1988", } @Unpublished{pierce96pictdef, author = "Benjamin C. Pierce and David N. Turner", title = "Pict Language Definition", year = "1996", note = "https://www.cl.cam.ac.uk/users/bcp1000/draft", } @InProceedings{pietrzykowski72acmconf, author = "T. Pietrzykowski and D. C. Jensen", title = "A complete mechanization of $\omega$-order type theory", booktitle = "ACM '72: Proceedings of the ACM annual conference", year = "1972", pages = "82--92", publisher = "ACM Press", address = "New York, NY, USA", doi = "10.1145/800193.805824", } @Article{pietrzykowski73jacm, author = "Tomasz Pietrzykowski", title = "A Complete Mechanization of Second-Order Type Theory", journal = "J. ACM", volume = "20", number = "2", year = "1973", ISSN = "0004-5411", pages = "333--364", doi = "10.1145/321752.321764", publisher = "ACM Press", address = "New York, NY, USA", } @PhdThesis{pimentel01phd, author = "Elaine Gouv\^{e}a Pimentel", title = "{L}\'{o}gica linear e a especifica\c c\~ao de sistemas computacionais", school = "Universidade Federal de Minas Gerais, Belo Horizonte, M.G., Brasil", year = "2001", month = dec, note = "Written in English", } @InProceedings{pimentel05lpar, author = "Elaine Pimentel and Dale Miller", title = "On the specification of sequent systems", booktitle = "LPAR 2005: 12th International Conference on Logic for Programming, Artificial Intelligence and Reasoning", year = "2005", pages = "352--366", series = lnai, number = "3835", pdf = "https://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/lpar05.pdf", } @InProceedings{pimentel16lsfa, author = "Elaine Pimentel and Vivek Nigam and {Jo\~{a}o} Neto", title = "Multi-focused Proofs with Different Polarity Assignments", doi = "10.1016/j.entcs.2016.06.011", booktitle = "Proc.\ of the Tenth Workshop on Logical and Semantic Frameworks, with Applications (LSFA 2015)", year = "2016", editor = "Mario Benevides and Rene Thiemann", volume = "323", series = entcs, pages = "163--179", month = jul, } @InProceedings{pinto95sg, title = "Loop-free construction of counter-models for intuitionistic propositional logic", author = "Luis Pinto and Roy Dyckhoff", booktitle = "Symposia Gaussiana", pages = "225--232", year = "1995", organization = "Walter de Gruyter, Berlin", } @InCollection{pistone16silfs, author = "Paolo Pistone", title = "On the “no deadlock criterion”: from {Herbrand’s} theorem to Geometry of Interaction", booktitle = "New Directions in Logic and the Philosophy of Science", publisher = "College Publications", year = "2016", editor = "Laura Felline and Antonio Ledda and Francesco Paoli and Emanuele Rossanese", volume = "3", series = "SILFS", pages = "205--218", } @Book{pitt85ctcp, editor = "David Pitt and Samson Abramsky and Axel Poigne and David Rydeheard", title = "{Category Theory and Computer Programming}", publisher = "Springer, New York", year = "1985", series = lncs, volume = "240", } @InProceedings{pitts00mpc, author = "A. M. Pitts and M. J. Gabbay", title = "{A Metalanguage for Programming with Bound Names Modulo Renaming}", booktitle = "Mathematics of Program Construction. 5th International Conference, MPC2000, Ponte de Lima, Portugal, July 2000. Proceedings", pages = "230--255", year = "2000", editor = "R. Backhouse and J. N. Oliveira", volume = "1837", series = lncs, publisher = "Springer, Heidelberg", } @Unpublished{pitts00unp, author = "Andrew M. Pitts and Murdoch J. Gabbay", title = "A Meta Language for Programming with Bound Names Modulo Renaming (Preliminary Report)", note = "Draft January 2000", } @Article{pitts03ic, author = "Andrew M. Pitts", title = "Nominal Logic, {A} First Order Theory of Names and Binding", journal = "Information and Computation", year = "2003", number = "2", volume = "186", pages = "165--193", } @Article{pitts06jacm, author = "Andrew M. Pitts", title = "Alpha-structural recursion and induction", journal = "J. ACM", year = "2006", volume = "53", number = "3", pages = "459--506", } @InCollection{pitts11howe, author = "Andrew M. Pitts", editor = "David Sangiorgi and Jan Rutten", booktitle = "Advanced Topics in Bisimulation and Coinduction", title = "Howe's method for higher-order languages", chapter = "5", publisher = "Cambridge University Press", year = "2011", pages = "197--232", } @InProceedings{pitts87ctcs, author = "A. M. Pitts", title = "Polymorphism Is Set Theoretic, Constructively", booktitle = "Category Theory and Computer Science, Proc.\ Edinburgh 1987", editor = "D. H. Pitt and A. Poign{\'e} and D. E. Rydeheard", series = lncs, publisher = "Springer, Berlin", volume = "283", year = "1987", pages = "12--39", } @InCollection{pitts95slc, author = "A. M. Pitts", title = "Operationally-Based Theories of Program Equivalence", booktitle = "Semantics and Logics of Computation", editor = "P. Dybjer and A. M. Pitts", publisher = "Cambridge University Press", year = "1995", note = "Based on lectures given at the CLICS-II Summer School on Semantics and Logics of Computation, Isaac Newton Institute for Mathematical Sciences, Cambridge UK, September 1995.", } @Article{plato01aml, author = "Jan \Plato{Plato}von Plato", title = "Natural Deduction with General Elimination Rules", journal = "Archive for Mathematical Logic", volume = "40", number = "7", pages = "541--567", year = "2001", doi = "10.1007/s001530100091", } @Article{plato08bsl, author = "Jan \Plato{Plato}von Plato and G. Gentzen", title = "Gentzen’s proof of normalization for natural deduction", journal = "Bulletin of Symbolic Logic", year = "2008", volume = "14", number = "2", pages = "240--257", month = jun, URL = "https://www.jstor.org/stable/20059973", } @Article{plato12bsl, title = "Gentzen's proof systems: byproducts in a work of genius", author = "Jan \Plato{Plato}von Plato", journal = "Bulletin of Symbolic logic", volume = "18", number = "3", pages = "313--367", year = "2012", publisher = "Cambridge University Press", doi = "10.2178/bsl/1344861886", } @InCollection{plato18sep, author = "Jan \Plato{Plato}von Plato", title = "The Development of Proof Theory", booktitle = "The Stanford Encyclopedia of Philosophy", editor = "Edward N. Zalta", howpublished = "\url{https://plato.stanford.edu/archives/win2018/entries/proof-theory-development/}", year = "2018", edition = "Winter 2018", publisher = "Metaphysics Research Lab, Stanford University", } @Article{plotkin04jlapa, author = "Gordon D. Plotkin", title = "The origins of structural operational semantics", journal = jlap, pages = "3--15", volume = "60", year = "2004", } @Article{plotkin04jlapb, title = "A structural approach to operational semantics", author = "Gordon D. Plotkin", journal = jlap, year = "2004", volume = "60-61", pages = "17--139", publisher = "Elsevier", } @Article{plotkin76, author = "Gordin Plotkin", title = "Call-by-Name, Call-by-Value and the $\lambda$-Calculus", journal = tcs, volume = "1", number = "1", pages = "125--159", year = "1976", } @Article{plotkin77, author = "G. D. Plotkin", title = "{LCF} as a Programming Language", journal = tcs, volume = "5", year = "1977", pages = "223--255", } @TechReport{plotkin81, author = "Gordon D. Plotkin", title = "A Structural Approach to Operational Semantics", institution = "Aarhus University", address = "Aarhus, Denmark", type = "{DAIMI}", number = "{FN}-19", month = sep, year = "1981", } @Book{pohlers89book, author = "W. Pohlers", address = "Berlin", publisher = "Springer", series = "Lecture Notes in Mathematics", title = "Proof theory: an introduction", volume = "1407", year = "1989", } @Book{poincare52book, author = "Henri Poincar\'e", title = "Science and Hypothesis", publisher = "Dover", year = "1952", } @InProceedings{polakow01flops, author = "Jeff Polakow and Kwangkeun Yi", title = "Proving Syntactic Properties of Exceptions in an Ordered Logical Framework", booktitle = "{Fifth International Symposium on Functional and Logic Programming (FLOPS 2001)}", year = "2001", address = "Tokyo, Japan", month = mar, } @PhdThesis{polakow01phd, author = "Jeff Polakow", title = "Ordered Linear Logic and Applications", school = "Department of Computer Science, Caregnie Mellon", year = "2001", month = aug, } @InProceedings{polakow99mfps, author = "Jeff Polakow and Frank Pfenning", title = "Relating Natural Deduction and Sequent Calculus for Intuitionistic Non-Commutative Linear Logic", booktitle = "{Proceedings of the 15th Conference on Mathematical Foundations of Programming Semantics}", address = "New Orleans, Louisiana", editor = "Andre Scedrov and Achim Jung", year = "1999", } @InProceedings{polakow99tlca, author = "Jeff Polakow and Frank Pfenning", title = "Natural Deduction for Intuitionistic Non-Commutative Linear Logic", booktitle = "{Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications} ({TLCA}'99)", publisher = "Springer", series = lncs, number = "1581", editor = "J.-Y. Girard", pages = "295--309", year = "1999", } @Unpublished{pollack88, author = "Randy Pollack", title = "The Theory of {LEGO}", month = oct, year = "1988", note = "Dissertation Proposal, University of Edinburgh", } @InCollection{pollack98oup, author = "Robert Pollack", editor = "G. Sambin and J. Smith", title = "How to believe a machine-checked proof", booktitle = "Twenty Five Years of Constructive Type Theory", publisher = "Oxford University Press", year = "1998", } @Misc{poplmark15url, key = "POPLMark", title = "The {POPLmark} {Challenge} webpage", howpublished = "\url{https://www.seas.upenn.edu/~plclub/poplmark/}", year = "2015", } @InCollection{portoraro23sep, author = "Frederic Portoraro", title = "{Automated Reasoning}", booktitle = "The {Stanford} Encyclopedia of Philosophy", editor = "Edward N. Zalta and Uri Nodelman", howpublished = "\url{https://plato.stanford.edu/archives/sum2023/entries/reasoning-automated/}", year = "2023", edition = "{S}ummer 2023", publisher = "Metaphysics Research Lab, Stanford University", } @Article{post46ams, author = "E. L. Post", title = "A Variant of a Recursively Unsolvable Problem", journal = "Bulletion of the American Mathematical Society", year = "1946", volume = "52", pages = "264--268", } @InProceedings{poswolsky08esop, author = "Adam Poswolsky and Carsten Sch{\"{u}}rmann", title = "Practical programming with higher-order encodings and dependent types", booktitle = "Proceedings of the European Symposium on Programming (ESOP 2008)", year = "2008", } @InProceedings{poswolsky08lfmtp, author = "Adam Poswolsky and Carsten Sch{\"u}rmann", title = "System Description: Delphin - {A} Functional Programming Language for Deductive Systems", journal = "Electr. Notes Theor. Comput. Sci.", volume = "228", pages = "113--120", booktitle = lfmtp08, year = "2008", editor = "A. Abel and C. Urban", } @InProceedings{pottier05wml, author = "Fran\c{c}ois Pottier", title = "An overview of {C}$\alpha$ml", booktitle = "ACM Workshop on ML", pages = "27--51", year = "2005", series = entcs, month = sep, } @InProceedings{pottier06ml, author = "Fran{\c{c}}ois Pottier", title = "An Overview of {C}$\alpha$ml", booktitle = "Proceedings of the ACM-SIGPLAN Workshop on ML (ML 2005)", series = "Electr. Notes Theor. Comput. Sci.", volume = "148", pages = "27--52", year = "2006", doi = "10.1016/j.entcs.2005.11.039", } @InProceedings{pottier07lics, title = "Static name control for {F}resh{ML}", author = "Fran{\c{c}}ois Pottier", booktitle = "22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007)", pages = "356--365", year = "2007", organization = "IEEE", } @Article{pottinger77, author = "Garrel Pottinger", title = "Normalization as a Homomorphic Image of Cut-Elim\-ina\-tion", journal = "Annals of Mathematical Logic", volume = "12", number = "3", year = "1977", pages = "223--357", } @InProceedings{pous06concur, author = "Damien Pous", title = "Weak Bisimulation Upto Elaboration", booktitle = "CONCUR", year = "2006", editor = "C. Baier and H. Hermanns", series = lncs, volume = "4137", pages = "390--405", publisher = pub-sv, } @InProceedings{pous07aplas, author = "Damien Pous", title = "Complete Lattices and Upto Techniques", booktitle = "APLAS", year = "2007", editor = "Zhong Shao", volume = "4807", series = lncs, pages = "351--366", month = nov, address = "Singapore", publisher = pub-sv, } @InCollection{pous11atbc, title = "Enhancements of the bisimulation proof method", author = "Damien Pous and Davide Sangiorgi", editor = "Davide Sangiorgi and Jan Rutten", booktitle = "Advanced Topics in Bisimulation and Coinduction", publisher = "Cambridge University Press", year = "2011", pages = "233--289", doi = "10.1017/CBO9780511792588.007", } @Article{pratt75siam, title = "Every Prime Has a Succinct Certificate", author = "Vaughan R. Pratt", pages = "214--220", journal = "SIAM Journal on Computing", year = "1975", month = sep, volume = "4", number = "3", } @Book{prawitz65, author = "Dag Prawitz", title = "Natural Deduction", publisher = "Almqvist $\&$ Wiksell", address = "Uppsala", year = "1965", } @Article{prawitz68jsl, author = "Dag Prawitz", title = "Hauptsatz for Higher Order Logic", journal = "Journal of Symbolic Logic", volume = "33", year = "1968", pages = "452--457", } @InProceedings{prawitz71, author = "Dag Prawitz", editor = "J. E. Fenstad", title = "Ideas and Results in Proof Theory", booktitle = "Proceedings of the Second Scandinavian Logic Symposium", pages = "235--307", publisher = "North-Holland", address = "Amsterdam", year = "1971", series = "Studies in Logic and the Foundations of Mathematics", volume = "63", } @PhdThesis{prehofer95phd, author = "Christian Prehofer", title = "Solving Higher-Order Equations: From Logic to Programming", school = "Technische Universit{\"a}t M{\"u}nchen", year = "1995", } @Article{priami95cj, author = "Corrado Priami", title = "Stochastic $\pi$-calculus", journal = "The Computer Journal", year = "1995", volume = "38", number = "6", pages = "578--589", } @InProceedings{primiero14pst, title = "A typed natural deduction calculus to reason about secure trust", author = "Giuseppe Primiero and Franco Raimondi", booktitle = "2014 Twelfth Annual International Conference on Privacy, Security and Trust, Toronto, ON, Canada, July 23-24, 2014", publisher = "IEEE Computer Society", year = "2014", editor = "Ali Miri and Urs Hengartner and Nen-Fu Huang and Audun J{\o}sang and Joaqu{\'i}n Garc{\'i}a-Alfaro", pages = "379--382", } @Article{prior60analysis, author = "A. N. Prior", title = "The Runabout Inference-Ticket", journal = "Analysis", year = "1960", volume = "21", number = "2", pages = "38--39", month = dec, } @Book{prior67book, author = "Arthur Prior", title = "Past, Present and Future", publisher = "Oxford University Press", year = "1967", } @Article{prior68nous, author = "Arthur Prior", title = "Now", journal = "Nous", year = "1968", volume = "2", pages = "101--119", } @Unpublished{prover9-mace4, author = "W. McCune", title = "Prover9 and Mace4", note = "\verb|https://www.cs.unm.edu/~mccune/prover9/|", year = "2010", } @InProceedings{przy90, author = "Teodor Przymusinski", title = "On Constructive Negation in Logic Programming", booktitle = "Proceedings of the North American Conference on Logic Programming", year = "1990", } @Misc{psyche, key = "Psyche", title = "Psyche: the {Proof-Search factorY for Collaborative HEuristics}", note = "Available at \url{https://www.lix.polytechnique.fr/~lengrand/Psyche}", year = "2012", } @InProceedings{puebla04pdcl, author = "German Puebla and Jes\'us Correas and Manuel V. Hermenegildo and Francisco Bueno and Maria J. Garc\'ia de la Banda and Kim Marriott and Peter J. Stuckey", title = "A Generic Framework for Context-Sensitive Analysis of Modular Programs", booktitle = "Program Development in Computational Logic", pages = "233--260", year = "2004", } @Book{pym04book, author = "David Pym and Eike Ritter", title = "Reductive Logic and Proof-search: proof theory, semantics, and control", publisher = "Oxford University Press", series = "Oxford Logic Guides", year = "2004", volume = "45", } @InProceedings{pym05galop, author = "David Pym and Eike Ritter", title = "A games semantics for reductive logic and proof-search", booktitle = "GaLoP 2005: Games for Logic and Programming Languages", pages = "107--123", year = "2005", editor = "Dan Ghica and Guy McCusker", } @Unpublished{pym88, author = "David Pym and Lincoln Wallen", title = "Effective Search for the Logical Framework", year = "1988", note = "Draft", } @PhdThesis{pym90, author = "David Pym", title = "Proofs, Search and Computation in General Logic", school = "LFCS, University of Edinburgh", year = "1990", } @Article{pym94jlp, author = "David Pym and James Harland", title = "The Uniform Proof-theoretic Foundation of Linear Logic Programming", journal = jlc, year = "1994", volume = "4", number = "2", pages = "175--207", doi = "10.1093/logcom/4.2.175", } @InProceedings{pym99lics, author = "David J. Pym", title = "On Bunched Predicate Logic", booktitle = lics99, publisher = "IEEE Computer Society Press", address = "Trento, Italy", editor = "G. Longo", pages = "183--192", year = "1999", } @PhdThesis{qi09phd, author = "X. Qi", title = "An Implementation of the Language $\lambda${Prolog} Organized around Higher-Order Pattern Unification", school = "University of Minnesota", year = "2009", } @InProceedings{qian93tapsoft, author = "Zhenyu Qian", title = "Linear Unification of Higher-Order Patterns", booktitle = "Proc.\ 1993 Coll.\ Trees in Algebra and Programming", editor = "J.-P. Jouannaud", year = "1993", publisher = "Springer", series = lncs, } @Article{qian96jlc, author = "Zhenyu Qian", title = "Unification of higher-Order patterns in linear time and space", journal = jlc, year = "1996", volume = "6", number = "3", pages = "315--341", } @InProceedings{queille82sp, title = "Specification and verification of concurrent systems in {CESAR}", author = "Jean-Pierre Queille and Joseph Sifakis", booktitle = "International Symposium on Programming, 5th Colloquium, Torino, Italy, April 6-8, 1982, Proceedings", publisher = "Springer", year = "1982", volume = "137", editor = "Mariangiola Dezani-Ciancaglini and Ugo Montanari", pages = "337--351", series = lncs, } @Unpublished{queiroz87, author = "Ruy de Queiroz and Tom Maibaum", title = "Proof Theory and Computer Programming", note = "Unpublished draft, Imperial College", month = jun, year = "1987", } @Book{quine40book, author = "W. V. O. Quine", title = "Mathematical Logic", publisher = "Harvard University Press", year = "1940", address = "Boston, MA", } @Article{rabe16lu, title = "The Future of Logic: Foundation-Independence", author = "Florian Rabe", journal = "Logica Universalis", pages = "1--20", volume = "10", number = "1", year = "2016", publisher = "Springer", } @Article{rabe17jlc, title = "How to identify, translate and combine logics?", author = "Florian Rabe", journal = jlc, year = "2017", number = "6", volume = "27", pages = "1753--1798", } @Misc{rabe22website, title = "The {MMT} {Language} and {System}", author = "Florian Rabe", year = "2022", howpublished = "\url{https://uniformal.github.io/}", key = "zzz", } @InProceedings{rajan95cav, author = "S. Rajan and Natarajan Shankar and Mandayam K. Srivas", title = "An Integration of Model Checking with Automated Proof Checking", booktitle = "CAV 1995", pages = "84--97", year = "1995", publisher = "Springer", } @Article{ralph20jlc, author = "Benjamin Ralph", title = "{Herbrand Proofs and Expansion Proofs as Decomposed Proofs}", journal = "Journal of Logic and Computation", year = "2020", month = oct, abstract = "{The reduction of undecidable first-order logic to decidable propositional logic via Herbrand’s theorem has long been of interest to theoretical computer science, with the notion of a Herbrand proof motivating the definition of expansion proofs. In this paper we construct simple deep inference systems for first-order logic, both with and without cut, such that ‘decomposed’ proofs—proofs where the contractive and non-contractive behaviour of the proof is separated—in each system correspond to either expansion proofs or Herbrand proofs. Translations between proofs in this system, expansion proofs and Herbrand proofs are given, retaining much of the structure in each direction.}", doi = "10.1093/logcom/exaa052", URL = "https://doi.org/10.1093/logcom/exaa052", } @InProceedings{ramakrishna97cav, author = "Y. S. Ramakrishna and C. R. Ramakrishnan and I. V. Ramakrishnan and Scott A. Smolka and Terrance Swift and David Scott Warren", title = "Efficient Model Checking Using Tabled Resolution", booktitle = "Proceedings of the 9th International Conference on Computer Aided Verification (CAV97)", pages = "143--154", year = "1997", number = "1254", series = lncs, } @Article{ramakrishnan02alp, title = "Model checking with tabled logic programming", author = "C Ramakrishnan", journal = "ALP News Letter", year = "2002", publisher = "Citeseer", } @InProceedings{ramakrishnan95iclp, author = "I. V. Ramakrishnan and Prasad Rao and Konstantinos Sagonas and Terrance Swift and David S. Warren", title = "Efficient Tabling Mechanisms for Logic Programs", pages = "697--714", editor = "Leon Sterling", booktitle = "Proceedings of the 12th International Conference on Logic Programming", month = jun, publisher = "MIT Press", address = "Cambridge", year = "1995", } @InProceedings{ramsey02popl, author = "Norman Ramsey and Avi Pfeffer", title = "Stochastic lambda calculus and monads of probability distributions", booktitle = popl02, pages = "154--165", year = "2002", publisher = "ACM", } @InCollection{rathjen20sep, author = "Michael Rathjen and Wilfried Sieg", title = "Proof Theory", booktitle = "The Stanford Encyclopedia of Philosophy", editor = "Edward N. Zalta", howpublished = "\url{https://plato.stanford.edu/archives/fall2020/entries/proof-theory/}", year = "2020", edition = "Fall 2020", publisher = "Metaphysics Research Lab, Stanford University", } @Article{raths07jar, author = "Thomas Raths and Jens Otten and Christoph Kreitz", title = "The {ILTP} Problem Library for Intuitionistic Logic", journal = "Journal of Automated Reasoning", publisher = "Springer Netherlands", pages = "261--271", volume = "38", number = "1", doi = "10.1007/s10817-006-9060-z", year = "2007", } @Article{read15rsl, title = "Semantic pollution and syntactic purity", author = "Stephen Read", journal = "The Review of Symbolic Logic", volume = "8", number = "4", pages = "649--661", year = "2015", publisher = "Cambridge Univ Press", } @Book{read88book, author = "Stephen Read", title = "Relevant Logic", publisher = "Blackwell, Oxford", year = "1988", } @InProceedings{reddy93welp, author = "Uday S. Reddy", title = "A typed foundation for directional logic programming", editor = "E. Lamma and P. Mello", pages = "150--167", booktitle = welp93, address = "Bologna, Italy", year = "1993", publisher = "Springer LNAI 660", URL = "ftp://cs.uiuc.edu/pub/reddy/papers/directional.ps.Z", } @InProceedings{reddy94iclp, author = "Uday S. Reddy", title = "Higher-order Aspects of Logic Programming", pages = "402--418", booktitle = "Logic Programming, 11th International Conference, S. Margherita Ligure, Italy", editor = "P. Van Hentenryck", year = "1994", publisher = "Mit Press", } @InProceedings{reed06hylo, author = "Jason Reed", title = "Hybridizing a Logical Framework", booktitle = "International Workshop on Hybrid Logic ({HyLo})", year = "2006", address = "Seattle, USA", month = aug, } @Article{reed92jlp, author = "David W. Reed and Donald W. Loveland", title = "A Comparison of Three {Prolog} Extensions", journal = "Journal of Logic Programming", month = jan, year = "1992", volume = "12", number = "1 \& 2", pages = "25--50", } @InProceedings{reger17arcade, author = "Giles Reger and Martin Suda", title = "Checkable Proofs for First-Order Theorem Proving", booktitle = "{ARCADE} 2017, 1st International Workshop on Automated Reasoning: Challenges, Applications, Directions, Exemplary Achievements", pages = "55--63", year = "2017", URL = "https://www.easychair.org/publications/paper/5W2B", editor = "Giles Reger and Dmitriy Traytel", series = "EPiC Series in Computing", volume = "51", publisher = "EasyChair", } @Misc{reis10lu, author = "Giselle Reis", title = "A linear logic prover used to check {LU} introduction rules", howpublished = "https://www.kontesti.me/~giselle/SELLF/lu/", month = oct, year = "2010", } @Misc{reis12tatu, author = "Giselle Reis and Vivek Nigam", title = "{TATU}: Online system for reasoning about sequent calculus specifications in linear logic with subexponentials", howpublished = "https://www.logic.at/people/giselle/tatu/", month = mar, year = "2010", } @InProceedings{reis15pxtp, author = "Giselle Reis", title = "Importing {SMT} and Connection proofs as expansion trees", year = "2015", URL = "https://arxiv.org/abs/1507.08715", note = "Proof Exchange for Theorem Proving (PxTP)", } @Article{reis19mscs, title = "Complexity of translations from resolution to sequent calculus", volume = "29", doi = "10.1017/S0960129518000476", number = "8", journal = "Mathematical Structures in Computer Science", publisher = "Cambridge University Press", author = "Giselle Reis and Bruno Woltzenlogel Paleo", year = "2019", pages = "1061--1091", } @InProceedings{remy89popl, author = "Didier R{\'e}my", title = "Records and Variants as a natural Extension of {ML}", booktitle = "Sixteenth Annual Symposium on Principles Of Programming Languages", year = "1989", publisher = "ACM", } @InProceedings{remy94tacs, author = "Didier R{\'e}my", title = "Programming Objects with {ML-ART}: An extension to {ML} with Abstract and Record Types", booktitle = "International Symposium on Theoretical Aspects of Computer Software", year = "1994", editor = "Masami Hagiya and John C. Mitchell", series = lncs, volume = "789", pages = "321--346", publisher = "Springer", address = "Sendai, Japan", month = apr, } @InProceedings{reppy91pldi, author = "John H. Reppy", title = "{CML}: {A} Higher-order Concurrent Language", booktitle = "ACM SIGPLAN Conference on Programming Language Design and Implementation", month = jun, year = "1991", pages = "293--305", } @InProceedings{retore97tlca, author = "Christian Retor{\'e}", title = "Pomset logic: a non-commutative extension of classical linear logic", booktitle = "Proceedings of {TLCA}", pages = "300--318", year = "1997", volume = "1210", publisher = "Springer", } @InProceedings{retore99roma, author = "Christian Retor{\'e}", title = "Pomset logic as a calculus of directed cographs", booktitle = "Dynamic Perspectives in Logic and Linguistics: Proof Theoretical Dimensions of Communication Processes", pages = "221--247", year = "1999", editor = "V.~M.~Abrusci and C.~Casadio", } @InProceedings{reynolds72acm, author = "John Reynolds", title = "Definitional Interpreters for Higher Order Programming Languages", booktitle = "ACM Conference Proceedings", pages = "717--740", publisher = "ACM", year = "1972", } @InProceedings{reynolds74cp, author = "John C. Reynolds", title = "Towards a Theory of Type Structure", booktitle = "Colloque sur la Programmation, Paris, France", publisher = "Springer", address = "New York", series = lncs, volume = "19", year = "1974", pages = "408--425", } @Article{riazanov02aicomm, author = "Alexandre Riazanov and Andrei Voronkov", title = "The design and implementation of {VAMPIRE}", journal = "AI Communications", year = "2002", volume = "15", number = "2-3", pages = "91--110", } @PhdThesis{ricci98phd, author = "Giorgia Ricci", title = "On the expressive powers of a Logic Programming presentation of Linear Logic ({FORUM})", school = "Department of Mathematics, Siena University", month = dec, year = "1998", } @InProceedings{ridge2005tphol, title = "A mechanically verified, sound and complete theorem prover for first order logic", author = "Tom Ridge and James Margetson", booktitle = "TPHOLs", volume = "3603", pages = "294--309", year = "2005", organization = "Springer", } @TechReport{ridoux91tr, author = "O. Ridoux", title = "{MALIv06}: Tutorial and Reference Manual", type = "Publication Interne", number = "611", institution = "IRISA", year = "1991", } @Book{robinson01book, author = "J. Alan Robinson and Andrei Voronkov", title = "Handbook of Automated Reasoning", publisher = "MIT Press", year = "2001", ISBN = "0-262-18221-1", } @Article{robinson03jlc, author = "E. P. Robinson", title = "Proof nets for classical logic", journal = jlc, year = "2003", volume = "13", number = "5", pages = "777--797", } @Article{robinson65jacm, author = "J. A. Robinson", title = "A Machine-Oriented Logic Based on the Resolution Principle", journal = "JACM", publisher = "ACM", volume = "12", month = jan, year = "1965", pages = "23--41", } @InCollection{robinson69mi, author = "J. A. Robinson", title = "Mechanizing Higher-Order Logic", booktitle = "Machine Intelligence 4", publisher = "Edinburgh University Press", year = "1969", pages = "151--170", } @InCollection{robinson70mi, author = "J. A. Robinson", title = "A Note on Mechanizing Higher Order Logic", booktitle = "Machine Intelligence 5", publisher = "Edinburgh University Press", year = "1970", pages = "121--135", } @InCollection{robinson83ar, title = "Paramodulation and theorem-proving in first-order theories with equality", author = "G Robinson and L Wos", booktitle = "Automation of Reasoning", pages = "298--313", year = "1983", publisher = "Springer", } @InCollection{robinson83sc, year = "1983", booktitle = "Automation of Reasoning", series = "Symbolic Computation", editor = "J{\" o}rg H. Siekmann and Graham Wrightson", doi = "10.1007/978-3-642-81955-1\_19", title = "Paramodulation and Theorem-Proving in First-Order Theories with Equality", URL = "https://dx.doi.org/10.1007/978-3-642-81955-1\_19", publisher = "Springer Berlin Heidelberg", author = "G. Robinson and L. Wos", pages = "298--313", } @InProceedings{roeckl01fossacs, author = "C. R{\"o}ckl and D. Hirschkoff and S. Berghofer", title = "Higher-Order Abstract Syntax with Induction in {Isabelle/HOL}: Formalizing the Pi-Calculus and Mechanizing the Theory of Contexts", booktitle = "Proc. FOSSACS'01", pages = "364--378", year = "2001", editor = "F. Honsell and M. Miculan", volume = "2030", series = lncs, publisher = "Springer", } @Article{roeckl03jfp, author = "C. R{\"o}ckl and D. Hirschkoff", title = "A Fully Adequate Shallow Embedding of the $\pi$-Calculus in {Isabelle/HOL} with Mechanized Syntax Analysis", journal = "Journal of Functional Programming", volume = "13", number = "2", pages = "415--451", year = "2003", } @InProceedings{rohwedder96esop, author = "Ekkehard Rohwedder and Frank Pfenning", title = "Mode and Termination Analysis for Higher-Order Logic Programs", booktitle = "Proceedings of the European Symposium on Programming", month = apr, year = "1996", pages = "296--310", } @InProceedings{rollins91iclp, author = "Eugene J. Rollins and Jeannette M. Wing", title = "Specifications as Search Keys for Software Libraries", pages = "173--187", booktitle = "Proceedings of the 1991 International Conference on Logic Programming", editor = "Koichi Furukawa", year = "1991", } @InProceedings{ross91alpuk, author = "Brian J. Ross", title = "Using Algebraic Semantics for Proving {Prolog} Program Termination and Transformation", booktitle = "Proceedings of the 1991 UK ALP meeting", address = "Edinburgh", month = apr, year = "1991", pages = "63--70", } @InProceedings{ross91iclp, author = "Brian J. Ross and Alan Smaill", title = "An Algebraic Semantics of {Prolog} Program Termination", editor = "Koichi Furukawa", booktitle = "Eighth International Logic Programming Conference", address = "Paris, France", publisher = "MIT Press", month = jun, year = "1991", pages = "316--330", } @PhdThesis{ross91phd, author = "Brian J. Ross", title = "An Algebraic Semantics of {Prolog} Control", school = "University of Edinburgh", year = "1991", note = "Fortcoming.", } @InProceedings{rouhling15frocos, title = "Axiomatic constraint systems for proof search modulo theories", author = "Damien Rouhling and Mahfuza Farooque and St\'ephane Graham-Lengrand and Assia Mahboubi and Jean-Marc Notin", editor = "Carsten Lutz and Silvio Ranise", booktitle = "Proceedings of the 9th International Symposium on Frontiers of Combining Systems (FroCoS'15)", series = "Lecture Notes in Computer Science", publisher = "Springer-Verlag", year = "2015", month = sep, place = "Wroclaw, Poland", } @InProceedings{roychoudhury00ppdp, author = "Abhik Roychoudhury and C. R. Ramakrishnan and I. V. Ramakrishnan", title = "Justifying proofs using memo tables", booktitle = "PPDP", year = "2000", pages = "178--189", } @Book{rudin86book, author = "Walter Rudin", title = "Real and Complex Analysis", publisher = "McGraw-Hill", year = "1986", edition = "3rd", } @InProceedings{ruess03hcssc, author = "Harald Rue\ss and Natarajan Shankar", title = "Introducing Cyberlogic", booktitle = "Proceedings of the 3rd Annual High Confidence Software and Systems Conference", year = "2003", address = "Baltimore, Maryland", } @Article{ruet00mscs, author = "Paul Ruet", title = "Non-commutative logic {II}: sequent calculus and phase semantics", journal = "Mathematical Structures in Computer Science", volume = "10", number = "2", pages = "277--312", year = "2000", } @InProceedings{ruet97csl, author = "P. Ruet and F. Fages", title = "Concurrent Constraint Programming and Non-Commutative Logic", booktitle = "Proceedings of the $11^{th}$ Conference on Computer Science Logic", series = lncs, editor = "Mogens Nielsen and Wolfgang Thomas", volume = "1414", year = "1997", publisher = "Springer", } @InProceedings{rushby05icfem, author = "John M. Rushby", editor = "Kung{-}Kiu Lau and Richard Banach", title = "An Evidential Tool Bus", booktitle = "Formal Methods and Software Engineering, 7th International Conference on Formal Engineering Methods, {ICFEM} 2005, Manchester, UK, November 1-4, 2005, Proceedings", series = lncs, volume = "3785", pages = "36--36", publisher = "Springer", year = "2005", doi = "10.1007/11576280\_3", } @Misc{russell02, author = "Bertrand Russell", title = "Letter to Frege", note = "Translated in \cite{vanheijenoort67book}", year = "1902", } @Article{russell08ajm, author = "Bertrand Russell", title = "Mathematical Logic as Based on the Theory of Types", journal = "American Journal of Mathematics", volume = "30", year = "1908", pages = "222--262", } @Article{rutten98ace, author = "J. J. M. M. Rutten", title = "Automata and Coinduction (an Exercise in Coalgebra)", journal = lncs, volume = "1466", year = "1998", } @TechReport{rutten98trwhile, year = "1998", type = "Technical Report", number = "SEN-R9826", institution = "CWI - Centrum voor Wiskunde en Informatica", title = "A note on coinduction and weak bisimilarity for while programs", URL = "ftp://ftp.cwi.nl/pub/CWIreports/SEN/SEN-R9826.ps.Z", author = "J. J. M. M. Rutten", month = oct, } @TechReport{rutten99tr, number = "SEN-R9921", institution = "CWI - Centrum voor Wiskunde en Informatica", title = "Coalgebra, concurrency, and control", month = nov, year = "1999", URL = "https://www.cwi.nl/ftp/CWIreports/SEN/SEN-R9921.ps.Z", author = "J. J. M. M. Rutten", } @Book{rydeheard88book, author = "D. E. Rydeheard and R. M. Burstall", title = "{Computational Category Theory}", publisher = "Prentice-Hall", address = "New York", year = "1988", } @TechReport{rytten98tr, type = "Technical Report", number = "SEN-R9803", institution = "CWI - Centrum voor Wiskunde en Informatica", title = "Automata and coinduction (an exercise in coalgebra)", month = dec, year = "1998", URL = "ftp://ftp.cwi.nl/pub/CWIreports/SEN/SEN-R9803.ps.Z", author = "J. J. M. M. Rutten", } @Article{sabry93lfp, author = "Amr Sabry and Matthias Felleisen", title = "Reasoning about Programs in Continuation-Passing Style", journal = "Lisp and Symbolic Computation", volume = "6", number = "3-4", year = "1993", pages = "289--360", } @Manual{sagonas06xsb, author = "Konstantinos Sagonas and Terrance Swift and David S. Warren and Juliana Freire and Prasad Rao and Baoqiu Cui and Ernie Johnson and Luis de Castro and Rui F. Marques and Steve Dawson and Michael Kifer", title = "The {XSB} Version 3.0 Volume 1: Programmer's Manual", year = "2006", } @PhdThesis{sahlqvist73phd, author = "Henrik Sahlqvist", title = "Completeness and Correspondence in First and Second Order Semantics for Modal Logic", school = "Oslo University", year = "1973", type = "Ph.D. Dissertation", address = "Oslo", } @InProceedings{sahlqvist75scandinavian, author = "H. Sahlqvist", booktitle = "Proceedings of the Third Scandinavian Logic Symposium", editor = "S. Kanger", pages = "110--143", publisher = "North-Holland", title = "Completeness and Correspondence in the First and Second Order Semantics for Modal Logic", year = "1975", } @InProceedings{saillard13iwil, author = "Ronan Saillard", title = "Towards explicit rewrite rules in the $\lambda{\Pi}$-calculus modulo", booktitle = "IWIL-10th International Workshop on the Implementation of Logics", editor = "Stephan Schulz and Geoff Sutcliffe and Boris Konev", year = "2013", } @Book{saintdizier94book, author = "Patrick Saint-Dizier", title = "Advanced Logic Programming for Language Processing", publisher = "Academic Press", year = "1994", } @Article{sakharov07rml, author = "Alexander Sakharov", title = "Intuitionistic Predicate Logic with Decidable Propositional Atoms", journal = "Reports on Mathematical Logic", year = "2007", URL = "https://www.iphils.uj.edu.pl/rml/rml-42/09-sakharov.pdf", volume = "42", pages = "153--158", } @InProceedings{sambin90lc, author = "Giovanni Sambin", title = "Intuitionistic Formal Spaces and their Neighbourhood", booktitle = "Logic Colloquium '88", year = "1989", editor = "C. Bonotto and R. Ferro and S. Valentini and A. Zanardo", pages = "261--286", publisher = "North-Holland", } @InCollection{sands98hoots, author = "David Sands", title = "Improvement Theory and Its Applications", pages = "275--306", editor = "A. D. Gordon and A. M. Pitts", booktitle = "Higher {O}rder {O}perational {T}echniques in {S}emantics", publisher = "Cambridge University Press", series = "Publications of the Newton Institute", year = "1998", pdf = "https://www.cse.chalmers.se/~dave/papers/hoots97.pdf", } @TechReport{sanella86a, author = "Donald Sannella", title = "{Formal Specification of ML Programs}", number = "ECS-LFCS-86-15", institution = "Laboratory for the Foundations of Computer Science, University of Edinburgh", month = nov, year = "1986", } @TechReport{sanella86b, author = "Donald Sannella and Andrzej Tarlecki", title = "{Toward Formal Development of Programs from Algebraic Specifications: Implementations Revisited}", number = "ECS-LFCS-86-17", institution = "Laboratory for the Foundations of Computer Science, University of Edinburgh", month = dec, year = "1986", note = "revised October 1987", } @Book{sangiorgi01, author = "Davide Sangiorgi and David Walker", title = "$\pi$-Calculus: {A} Theory of Mobile Processes", year = "2001", ISBN = "0-521-78177-9", publisher = "Cambridge University Press", } @Article{sangiorgi198mscs, title = "On the bisimulation proof method", author = "Davide Sangiorgi", journal = "Mathematical Structures in Computer Science", volume = "8", number = "5", pages = "447--479", year = "1998", publisher = "Cambridge Univ Press", } @InProceedings{sangiorgi92concur, author = "Davide Sangiorgi and Robin Milner", title = "The Problem of ``Weak Bisimulation up to''", booktitle = "CONCUR", year = "1992", pages = "32--46", publisher = pub-sv, series = lncs, volume = "630", doi = "10.1007/BFb0084781", } @Article{sangiorgi94ic, author = "Davide Sangiorgi", title = "The lazy lambda calculus in a concurrency scenario", journal = "Information and Computation", volume = "111", number = "1", month = may, year = "1994", pages = "120--153", } @Article{sangiorgi96acta, author = "Davide Sangiorgi", title = "A Theory of Bisimulation for the $\pi$-Calculus", journal = "Acta Informatica", volume = "33", number = "1", pages = "69--97", year = "1996", } @Article{sangiorgi96tcs, author = "Davide Sangiorgi", title = "$\pi$-calculus, internal mobility and agent-passing calculi", year = "1996", journal = tcs, volume = "167", number = "2", pages = "235--274", } @InProceedings{sannella84, author = "Donald Sannella and Andrzej Tarlecki", title = "{Some Thoughts on Algebraic Specification}", booktitle = "Proc. 3rd Workshop on Theory and Applications of Abstract Data Types", pages = "31--38", publisher = "Springer Informatik-Fachberichte", month = nov, year = "1984", } @InProceedings{sannella86, author = "Donald Sannella and Andrzej Tarlecki", title = "{Extended ML: An Institution-Independent Framework for Formal Program Development}", booktitle = "Proc. Workshop on Category Theory and Computer Programming", pages = "364--389", publisher = "Springer", series = lncs, volume = "240", month = sep, year = "1986", } @Article{sannella92jlp, author = "D. T. Sannella and L. A. Wallen", title = "A Calculus for the Construction of Modular {Prolog} Programs", journal = "Journal of Logic Programming", month = jan, year = "1992", volume = "12", number = "1 \& 2", pages = "147--178", } @InProceedings{santo00icalp, author = "Jos{\'e} Esp{\'\i}rito Santo", title = "Revisiting the Correspondence between Cut Elimination and Normalisation", booktitle = "ICALP: Annual International Colloquium on Automata, Languages and Programming", year = "2000", pages = "600--611", series = lncs, volume = "1853", } @Article{santo19mscs, title = "Inhabitation in simply typed lambda-calculus through a lambda-calculus for proof search", volume = "29", doi = "10.1017/S0960129518000099", number = "8", journal = "Mathematical Structures in Computer Science", publisher = "Cambridge University Press", author = "José Espírito Santo and Ralph Matthes and Luís Pinto", year = "2019", pages = "1092--1124", } @TechReport{santocanale01brics, author = "Luigi Santocanale", title = "A Calculus of Circular Proofs and Its Categorical Semantics", type = "BRICS Report Series", number = "RS-01-15", institution = "BRICS, Dept.\ of Comp.\ Sci., Univ. of Aarhus", month = may, year = "2001", URL = "https://www.brics.dk/RS/01/15/BRICS-RS-01-15.ps.gz", } @InProceedings{santocanale02fossacs, author = "Luigi Santocanale", title = "A Calculus of Circular Proofs and its Categorical Semantics", booktitle = "Proceedings of Foundations of Software Science and Computation Structures (FOSSACS02)", pages = "357--371", year = "2002", number = "2303", series = lncs, month = jan, publisher = "Springer", } @InProceedings{saraswat90popl, author = "V. Saraswat and Martin Rinard", title = "Concurrent Constraint Programming", booktitle = popl90, address = "San Francisco, CA", pages = "232--245", month = Jan, year = "1990", publisher = "ACM", } @InProceedings{saraswat91popl, author = "V. Saraswat and M. Rinard and P. Panangaden", title = "Semantic Foundations of Concurrent Constraint Programming", booktitle = popl91, address = "Orlando, FL", pages = "333--352", month = Jan, year = "1991", publisher = "ACM", } @TechReport{saraswat93tr, author = "V. Saraswat", title = "A brief introduction to linear concurrent constraint programming", institution = "Xerox Palo Alto Research Center", year = "1993", URL = "ftp://parcftp.xerox.com/pub/ccp/lcc/lcc-intro.dvi.Z", } @InProceedings{sarkar05iclp, author = "Susmit Sarkar and Brigitte Pientka and Karl Crary", title = "Small Proof Witnesses for {LF}.", booktitle = "ICLP", year = "2005", pages = "387--401", } @Article{sato77, author = "M. Sato", title = "A study of {Kripke}-type Models for Some Modal Logics by {Gentzen's} Sequential Method", journal = "Publications of the Research Institute for Mathematical Science", volume = "13", pages = "381--468", year = "1977", } @InProceedings{saurin05lics, author = "Alexis Saurin", title = "Separation with Streams in the $\lambda\mu$-calculus", pages = "356--365", booktitle = lics05, publisher = "IEEE Computer Society", year = "2005", } @InProceedings{saurin07lpar, author = "Alexis Saurin", title = "Typing streams in the ${\Lambda}\mu$-calculus: extended abstract", booktitle = "Proceedings of the Short Papers Session at LPAR 2007", month = oct, year = "2007", editor = "Nachum Dershowitz and Andrei Voronkov", pdf = "https://www.eleves.ens.fr/home/saurin/Recherche/lpar07saurin.pdf", } @InProceedings{saurin08csl, author = "Alexis Saurin", title = "On the Relations between the syntactic theories of $\lambda\mu$-calculi", booktitle = "17th EACSL Annual Conference on Computer Science Logic 2008 (CSL 2008)", month = sep, year = "2008", editor = "Michael Kaminski and Simone Martini", publisher = "Spring", series = lncs, note = "To appear", pdf = "https://www.eleves.ens.fr/home/saurin/Recherche/lpar07saurin.pdf", } @InProceedings{saurin08iclp, author = "Alexis Saurin", title = "Towards Ludics Programming: Interactive Proof Search", booktitle = "Logic Programming, 24th International Conference", year = "2008", editor = "Maria Garcia de la Banda and Enrico Pontelli", month = dec, series = lncs, volume = "5366", pages = "253--268", URL = "https://www.lix.polytechnique.fr/~saurin/Recherche/Publi/saurin\_iclp08.pdf", } @PhdThesis{saurin08phd, author = "Alexis Saurin", title = "Une \'etude logique du contr\^ole (appliqu\'ee \`a\ la programmation fonctionnelle et logique)", school = "Ecole Polytechnique", year = "2008", month = sep, URL = "https://www.lix.polytechnique.fr/~saurin/Recherche/These/", } @InProceedings{saurin10fossacs, author = "Alexis Saurin", title = "A Hierarchy for Delimited Continuations in Call-by-Name", booktitle = "Foundations of Software Science and Computational Structures, 13th International Conference, {FOSSACS}. Proceedings", pages = "374--388", year = "2010", } @Article{saurin10tocl, author = "Alexis Saurin", title = "Typing Streams in {$\Lambda\mu$}-calculus", journal = "{ACM} Transactions on Computational Logic", year = "2010", volume = "11", number = "4", } @InProceedings{saurin23tableaux, author = "Alexis Saurin", editor = "Revantha Ramanayake and Josef Urban", title = "A Linear Perspective on Cut-Elimination for Non-wellfounded Sequent Calculi with Least and Greatest Fixed-Points", booktitle = "Automated Reasoning with Analytic Tableaux and Related Methods", year = "2023", publisher = "Springer Nature Switzerland", pages = "203--222", doi = "10.1007/978-3-031-43513-3_12", } @InProceedings{savary-belanger14lfmtp, author = "Olivier Savary-B\'elanger and Kaustuv Chaudhuri", title = "Automatically Deriving Schematic Theorems for Dynamic Contexts", booktitle = lfmtp14, year = "2014", month = jul, publisher = "ACM", } @InBook{scedrov93, title = "A Brief Guide to Linear Logic", author = "Andre Scedrov", booktitle = "Current Trends in Theoretical Computer Science", editor = "G. Rozenberg and A. Salomaa", publisher = "World Scientific Publishing Co.", year = "1993", } @InProceedings{scedrov94nato, author = "Andre Scedrov", title = "Linear Logic and Computation: {A} Survey", booktitle = "{Proof and Computation, Proceedings Marktoberdorf Summer School 1993}", editor = "H. Schwichtenberg", publisher = "{NATO Advanced Science Institutes, Series F, Springer-Verlag, Berlin}", year = "1994", } @TechReport{schacknelsen11tr, title = "The lambda sigma calculus and strong normalization", author = "Anders Schack-Nielsen and Carsten Sch{\"u}rmann", note = "TR-2011-150", year = "2011", ISBN = "978-87-7949-249-3", institution = "IT University of Copenhagen, Denmark", } @InProceedings{schaefer13itp, title = "Autosubst: Reasoning with {de Bruijn} Terms and Parallel Substitutions", booktitle = "Proceedings of ITP'15", author = "Steven Sch{\"a}fer and Tobias Tebbi and Gert Smolka", year = "2015", editor = "Xingyuan Zhang and Christian Urban", publisher = pub-sv, series = lnai, } @TechReport{schellinx90tr, author = "Harold Schellinx", title = "Some Syntactical Observations on Linear Logic", institution = "ITLI Prepublication Series for Mathematical Logic and Foundations, University of Amsterdam", number = "ML-90-08", year = "1990", doi = "10.1093/logcom/1.4.537", } @Article{schellinx91jlc, title = "Some Syntactical Observations on Linear Logic", author = "Harold Schellinx", pages = "537--559", journal = jlc, year = "1991", month = sep, volume = "1", number = "4", doi = "10.1093/logcom/1.4.537", } @InProceedings{schellinx96ptml, title = "A linear approach to modal proof theory", author = "Harold Schellinx", booktitle = "Proof Theory of Modal Logic", year = "1996", editor = "H. Wansing", pages = "33--43", publisher = "Kluwer Academic Publishers", note = "Applied Logic Series, Volume 2", } @PhdThesis{scherer16phd, author = "Gabriel Scherer", title = "Which types have a unique inhabitant? Focusing on pure program equivalence", school = "Universit\'e Paris-Diderot", year = "2016", URL = "https://hal.inria.fr/tel-01309712", } @InProceedings{scherer17popl, title = "Deciding equivalence with sums and the empty type", author = "Gabriel Scherer", booktitle = "Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, POPL 2017, Paris, France, January 18-20, 2017", publisher = "ACM", year = "2017", editor = "Giuseppe Castagna and Andrew D. Gordon", pages = "374--386", doi = "10.1145/3009837.3009901", } @InProceedings{scherer18fossacs, author = "Gabriel Scherer and Max S. New and Nicholas Rioux and Amal Ahmed", title = "Fab{UL}ous Interoperability for {ML} and a Linear Language", booktitle = "{FoSSaCS}", year = "2018", URL = "https://arxiv.org/abs/1707.04984", } @InProceedings{scherlis83, author = "William L. Scherlis and Dana S. Scott", title = "First Steps Towards Inferential Programming", booktitle = "Information Processing 83: Proceedings of the IFIP 9th World Computer Congress", address = "Paris", month = sep, editor = "R. E. A. Mason", publisher = "Elsevier Science Publishers B. V. (North-Holland)", address = "Amsterdam", year = "1983", pages = "199--212", } @Article{schneider11tiss, author = "Fred B. Schneider and Kevin Walsh and Emin G{\"u}n Sirer", title = "{Nexus Authorization Logic (NAL)}: Design rationale and applications", journal = "ACM Transactions on Information and System Security", volume = "14", number = "1", pages = "8:1--8:28", month = may, year = "2011", doi = "10.1145/1952982.1952990", abstract = "Nexus Authorization Logic (NAL) provides a principled basis for specifying and reasoning about credentials and authorization policies. It extends prior access control logics that are based on ``says'' and ``speaks for'' operators. NAL enables authorization of access requests to depend on (i) the source or pedigree of the requester, (ii) the outcome of any mechanized analysis of the requester, or (iii) the use of trusted software to encapsulate or modify the requester. To illustrate the convenience and expressive power of this approach to authorization, a suite of document-viewer applications was implemented to run on the Nexus operating system.", } @InProceedings{schnoebelen91concur, address = "Amsterdam, The Netherlands", author = "{Ph}ilippe Schnoebelen", booktitle = "{P}roceedings of the 2nd {I}nternational {C}onference on {C}oncurrency {T}heory ({CONCUR}'91)", doi = "10.1007/3-540-54430-5_108", editor = "Jos C. M. Baeten and Jan Friso Groote", month = aug, pages = "480--494", publisher = "Springer-Verlag", series = "Lecture Notes in Computer Science", title = "Experiments on Processes with Backtracking", volume = "527", year = "1991", } @InProceedings{schoenfeld85ijcai, author = "Wolfgang Sch{\"o}nfeld", booktitle = "Proceedings of {IJCAI} 85", pages = "730--732", title = "{PROLOG} Extensions based on Tableau Calculus", year = "1985", keywords = "semantic tableau, automated theorem proving, prolog", } @InProceedings{schroder02amast, author = "L. Schr{\"o}der and T. Mossakowski", title = "Has{CASL}: towards integrated specification and development of functional programs", booktitle = "Algebraic Methodology And Software Technology", series = lncs, year = "2002", publisher = "Springer", address = "Berlin", volume = "2422", pages = "99--116", } @InCollection{schroeder-heister14and, author = "Peter Schroeder-Heister", editor = "Luiz Carlos Pereira and Edward Hermann Haeusler and Valeria de Paiva", title = "Generalized Elimination Inferences, Higher-Level Rules, and the Implications-as-Rules Interpretation of the Sequent Calculus", booktitle = "Advances in Natural Deduction: A Celebration of Dag Prawitz's Work", publisher = "Springer", year = "2014", number = "39", series = "Trends in Logic", pages = "1--29", } @Article{schroeder-heister84, author = "Peter Schroeder-Heister", title = "A Natural Extension of Natural Deduction", journal = "Journal of Symbolic Logic", volume = "49", number = "4", year = "1984", pages = "1284--1300", } @Article{schroeder-heister91jsl, author = "Peter Schroeder-Heister", title = "Uniform proof-theoretic semantics for logical constants (Abstract)", journal = "Journal of Symbolic Logic", year = "1991", volume = "56", pages = "1142", } @InProceedings{schroeder-heister92nlip, author = "Peter Schroeder-Heister", title = "Cut-elimination in logics with definitional reflection", booktitle = "Nonclassical Logics and Information Processing", publisher = "Springer", series = lncs, volume = "619", editor = "D. Pearce and H. Wansing", pages = "146--171", year = "1992", } @InProceedings{schroeder-heister93elp, author = "Peter Schroeder-Heister", title = "Definitional Reflection and the Completion", editor = "R. Dyckhoff", booktitle = "Proceedings of the 4th International Workshop on Extensions of Logic Programming", year = "1993", publisher = "Springer LNAI 798", pages = "333--347", } @InProceedings{schroeder-heister93lics, title = "Rules of Definitional Reflection", author = "Peter Schroeder-Heister", pages = "222--232", booktitle = lics93, publisher = "IEEE", editor = "M. Vardi", organization = "IEEE Computer Society Press", month = jun, year = "1993", doi = "10.1109/LICS.1993.287585", } @InProceedings{schroeder-heister94welp, author = "Peter Schroeder-Heister", title = "Cut elimination for logics with definitional reflection and restricted initial sequents.", booktitle = welp94, year = "1994", } @Unpublished{schroeder02unp, author = "Lutz Schr{\"o}der", title = "Henkin Models for the Partial $\lambda$-Calculus", note = "Manuscript", URL = "https://www.informatik.uni-bremen.de/~lschrode/hascasl/henkin.ps", year = "2002", } @Article{schubert18tplp, author = "Aleksy Schubert and Pawel Urzyczyn", title = "First-order Answer Set Programming as Constructive Proof Search", journal = "Theory Pract. Log. Program.", volume = "18", number = "3-4", pages = "673--690", year = "2018", doi = "10.1017/S147106841800008X", } @Article{schuette60jsl, author = "Kurt Sch{\"u}tte", journal = "Journal of Symbolic Logic", title = "Semantical and Syntactical Properties of Simple Type Theory", volume = "25", year = "1960", pages = "305--326", } @InProceedings{schulz13system, title = "System description: {E} 1.8", author = "Stephan Schulz", booktitle = "Logic for Programming, Artificial Intelligence, and Reasoning", pages = "735--743", year = "2013", organization = "Springer", } @PhdThesis{schurmann00phd, author = "Carsten Sch{\"{u}}rmann", title = "Automating the Meta Theory of Deductive Systems", school = "Carnegie Mellon University", month = oct, year = "2000", note = "{CMU-CS-00-146}", URL = "https://www.cs.yale.edu/homes/carsten/papers/S00b.ps.gz", } @InProceedings{schurmann03tphols, author = "Carsten Sch{\"u}rmann and Frank Pfenning", title = "A Coverage Checking Algorithm for {LF}", booktitle = "Theorem Proving in Higher Order Logics: 16th International Conference, TPHOLs 2003", pages = "120--135", year = "2003", volume = "2758", series = lncs, publisher = "Springer", doi = "10.1007/10930755\_8", } @InProceedings{schurmann05tlca, author = "Carsten Sch{\"{u}}rmann and Adam Poswolsky and Jeffrey Sarnat", title = "The nabla-calculus. Functional Programming with Higher-order Encodings", booktitle = "Proceedings of the 7th International Conference on Typed Lambda Calculi and Applications", series = "TLCA'05", year = "2005", doi = "10.1007/11417170\_25", } @InProceedings{schurmann08lics, author = "Carsten Sch{\"u}rmann and Jeffrey Sarnat", title = "Structural Logical Relations", booktitle = lics08, year = "2008", editor = "F. Pfenning", publisher = "IEEE Computer Society Press", pages = "69--80", } @MastersThesis{schurmann95ms, author = "Carsten Sch{\"u}rmann", title = "A computational meta logic for the {H}orn fragment of {LF}", school = "Carnegie Mellon University", month = dec, year = "1995", } @InProceedings{schurmann98cade, title = "Automated Theorem Proving in a Simple Meta-Logic for {LF}", author = "Carsten Sch{\"u}rmann and Frank Pfenning", booktitle = cade98, publisher = "Springer", year = "1998", volume = "1421", editor = "Claude Kirchner and H{\'e}l{\`e}ne Kirchner", pages = "286--300", series = "Lecture Notes in Computer Science", } @Article{schutte60jsl, author = "K. Sch{\"{u}}tte", title = "Syntactical and Semantical Properties of Simple Type Theory", journal = "Journal of Symbolic Logic", year = "1960", volume = "25", number = "4", pages = "305--326", } @TechReport{schwichtenberg02tr, author = "Helmut Schwichtenberg", title = "Minimal logic for computable functionals", institution = "Mathematisches Institut der Universit{\"a}t M{\"u}nchen", year = "2002", } @InProceedings{schwichtenberg06provers, title = "Minlog", author = "Helmut Schwichtenberg", booktitle = "The Seventeen Provers of the World", publisher = "Springer", year = "2006", volume = "3600", editor = "Freek Wiedijk", pages = "151--157", series = lncs, doi = "10.1007/11542384\_19", } @Article{schwichtenberg11minlog, title = "{MINLOG} reference manual", author = "Helmut Schwichtenberg", journal = "LMU M{\"u}nchen, Mathematisches Institut, Theresienstra{\ss}e", volume = "39", year = "2011", } @InCollection{schwichtenberg77hml, title = "Proof Theory: Some applications of cut-elimination", author = "Helmut Schwichtenberg", editor = "J. Barwise", booktitle = "Handbook of Mathematical Logic", series = "Studies in Logic and the Foundations of Mathematics", volume = "90", pages = "739--782", publisher = "North-Holland", address = "Amsterdam", year = "1977", doi = "10.1016/S0049-237X(08)71124-8", } @InCollection{scott70, author = "Dana Scott", title = "Outline of a Mathematical Theory of Computation", year = "1970", booktitle = "Proceedings, Fourth Annual Princeton Conference on Information Sciences and Systems", note = "Also, Programming Research Group Technical Monograph PRG--2, Oxford University", publisher = "Princeton University", pages = "169--176", } @Article{scutella90jlp, author = "Maria Grazia Scutell\`a", title = "A note on Dowling and Gallier's top-down algorithm for propositional horn satisfiability", journal = "Journal of Logic Programming", year = "1990", volume = "8", number = "3", pages = "265--273", month = may, } @Article{selinger01mscs, author = "Peter Selinger", title = "Control categories and duality: on the categorical semantics of the $\lambda\mu$ calculus", journal = "Mathematical Structures in Computer Science", year = "2001", volume = "11", number = "2", pages = "207--260", } @Article{selinger02jpf, title = "The lambda calculus is algebraic", author = "Peter Selinger", journal = "Journal of Functional Programming", volume = "12", number = "6", pages = "549--566", year = "2002", publisher = "Cambridge Univ Press", } @InProceedings{selinger97concur, author = "Peter Selinger", title = "First-Order Axioms for Asynchrony", booktitle = "CONCUR'97: Concurrency Theory, 8th International Conference", editor = "Antoni W. Mazurkiewicz and J{\'o}zef Winkowski", publisher = "Springer", series = lncs, volume = "1243", pages = "376--390", year = "1997", } @InProceedings{sestoft86, author = "P. Sestoft", title = "The Structure of a Self-Applicable Partial Evaluator", booktitle = "Programs as Data Objects", organization = "Springer", series = lncs, volume = "217", pages = "236--256", year = "1986", } @Book{sethi89, author = "Ravi Sethi", title = "Programming Languages: Concepts and Constructs", publisher = "Addison-Wesley Pub. Co.", year = "1989", } @Article{sevegnani15tcs, author = "Michele Sevegnani and Muffy Calder", title = "Bigraphs with sharing", journal = tcs, volume = "577", pages = "43--73", year = "2015", doi = "10.1016/j.tcs.2015.02.011", } @Article{sewell10jfp, title = "Ott: Effective tool support for the working semanticist", author = "Peter Sewell and Francesco Zappa Nardelli and Scott Owens and Gilles Peskine and Thomas Ridge and Susmit Sarkar and Rok Strni{\v{s}}a", journal = "Journal of Functional Programming", volume = "20", number = "01", pages = "71--122", year = "2010", publisher = "Cambridge Univ Press", } @InProceedings{shankar02fme, author = "Natarajan Shankar", title = "Little Engines of Proof", editor = "Lars-Henrik Eriksson and Peter A. Lindsay", booktitle = "FME 2002: Formal Methods - Getting IT Right, Proceedings of the International Symposium of Formal Methods Europe (Copenhagen, Denmark)", month = jul, year = "2002", publisher = "Springer", series = lncs, volume = "2391", pages = "1--20", doi = "10.1007/3-540-45614-7\_1", } @TechReport{shankar03tr, author = "Natarajan Shankar and Maria Sorea", title = "Counterexample-driven model checking", institution = "SRI International Computer Science Laboratory", year = "2003", number = "SRI-CSL-03-04", } @InProceedings{shankar08atva, title = "Trust and Automation in Verification Tools", author = "Natarajan Shankar", booktitle = "ATVA: Automated Technology for Verification and Analysis", publisher = pub-sv, year = "2008", volume = "5311", editor = "S. D. Cha and J-Y. Choi and M. Kim and I. Lee and M. Viswanathan", pages = "4--17", series = lncs, } @InProceedings{shankar92cade, author = "N. Shankar", title = "Proof Search in the Intuitionistic Sequent Calculus", pages = "522--536", editor = "Deepak Kapur", booktitle = "Proceedings of the 11th International Conference on Automated Deduction ({CADE}-11)", address = "Saratoga Springs, NY", month = jun, year = "1992", series = "LNAI", volume = "607", publisher = "Springer", } @Article{shao10cacm, author = "Zhong Shao", title = "Certified Software", journal = "Communications of the ACM", year = "2010", volume = "53", number = "12", pages = "56--66", month = dec, } @InProceedings{shao98icfp, author = "Zhong Shao and Christopher League Stefan Monnier", title = "Implementing Typed Intermediate Language", booktitle = "Proc. 1998 {ACM} {SIGPLAN} International Conference on Functional Programming ({ICFP}'98)", pages = "313--323", year = "1998", address = "Baltimore, Maryland", month = sep, } @Book{shapiro83mit, author = "Ehud Y. Shapiro", title = "Algorithmic Program Debugging", year = "1983", publisher = "MIT Press", address = "Cambridge, MA, USA", } @Article{shapiro85, author = "Steward Shapiro", title = "Second-Order Languages and Mathematical Practice", journal = "Journal of Symbolic Logic", volume = "50", number = "3", pages = "714--742", month = sep, year = "1985", } @Proceedings{shapiro86iclp, editor = "Ehud Y. Shapiro", title = "Third International Conference on Logic Programming, Imperial College of Science and Technology, London, United Kingdom, July 14-18, 1986, Proceedings", booktitle = "ICLP", publisher = "Springer", series = "Lecture Notes in Computer Science", volume = "225", year = "1986", ISBN = "3-540-16492-8", } @Article{sheeran00fmsd, author = "Mary Sheeran and Gunnar St{\aa}lmarck", title = "A Tutorial on St{\aa}lmarck's Proof Procedure for Propositional Logic", journal = "Formal Methods in System Design", volume = "16", number = "1", year = "2000", pages = "23--58", } @Article{shein17cacm, author = "Esther Shein", title = "Hacker-proof Coding", journal = "Commun. ACM", volume = "60", number = "8", month = aug, year = "2017", ISSN = "0001-0782", pages = "12--14", URL = "https://doi.acm.org/10.1145/3105423", doi = "10.1145/3105423", publisher = "ACM", address = "New York, NY, USA", } @PhdThesis{sherratt19phd, author = "David Sherratt", title = "A lambda-calculus that achieves full laziness with spine duplication", school = "University of Bath", year = "2019", month = mar, URL = "https://people.bath.ac.uk/wbh22/pdf/2019-sherratt-PHD.pdf", } @InProceedings{sherratt20fossac, author = "David Sherratt and Willem Heijltjes and Tom Gundersen and Michel Parigot", editor = "Jean Goubault{-}Larrecq and Barbara K{\"{o}}nig", title = "Spinal Atomic Lambda-Calculus", booktitle = "Foundations of Software Science and Computation Structures - 23rd International Conference, {FoSSaCS}", series = lncs, volume = "12077", pages = "582--601", publisher = "Springer", year = "2020", URL = "https://doi.org/10.1007/978-3-030-45231-5\_30", doi = "10.1007/978-3-030-45231-5\_30", } @Article{shieber95jlp, title = "Principles and Implementation of Deductive Parsing", author = "Stuart M. Shieber and Yves Schabes and Fernando C. N. Pereira", journal = "Journal of Logic Programming", pages = "3--36", year = "1995", volume = "24", number = "1--2", } @Book{shoenfield67book, author = "Joesph R. Shoenfield", publisher = "Addison-Wesley", title = "Mathematical Logic", year = "1967", } @InProceedings{sieber92accs, author = "Kurt Sieber", title = "Reasoning about sequential functions via logical relations", booktitle = "Proc. {LMS} Symposium on Applications of Categories in Computer Science, Durham 1991", year = "1992", editor = "M. P. Fourman and P. T. Johnstone and A. M. Pitts", pages = "258--269", publisher = "Cambridge University Press", series = "{LMS} Lecture Note Series 177", } @InProceedings{sieber93wspl, author = "Kurt Sieber", title = "New Steps Towards Full Abstraction for Local Variables", booktitle = "Proc. ACM SIGPLAN Workshop on State in Programming Languages (Technical Report YALEU/DCS/RR-968, Yale University)", address = "Copenhagen, Denmark", pages = "88--100", year = "1993", } @Article{sieg98sl, author = "Wilfried Sieg and John Byrnes", title = "Normal Natural Deduction Proofs (in classical logic)", journal = "Studia Logica", volume = "60", number = "1", year = "1998", pages = "67--106", doi = "10.1023/A:1005091418752", } @InProceedings{siekmann02cade, author = "J{\"o}rg Siekmann and Christoph Benzm{\"u}ller et al.", title = "Proof Development with {OMEGA}", editor = "Andrei Voronkov", booktitle = "Proceedings of the 18th International Conference on Automated Deduction", year = "2002", pages = "144--149", publisher = "Springer", series = lnai, number = "2392", address = "Copenhagen, Denmark", } @InProceedings{simmons08icalp, title = "Linear Logical Algorithms", author = "Robert J. Simmons and Frank Pfenning", booktitle = "ICALP 2008: 35th International Colloquium Automata, Languages and Programming, Reykjavik, Iceland", publisher = "Springer", year = "2008", month = jul, volume = "5126", editor = "Luca Aceto and Ivan Damg{\aa}rd and Leslie Ann Goldberg and Magn{\'u}s M. Halld{\'o}rsson and Anna Ing{\'o}lfsd{\'o}ttir and Igor Walukiewicz", pages = "336--347", series = lncs, doi = "10.1007/978-3-540-70583-3\_28", } @TechReport{simmons11tr, author = "Robert J. Simmons and Frank Pfenning", title = "Weak Focusing for Ordered Linear Logic", institution = "Carnegie Mellon University", year = "2011", number = "CMU-CS-10-147", month = apr, } @Article{simmons14tocl, author = "Robert J. Simmons", title = "Structural Focalization", journal = tocl, volume = "15", number = "3", pages = "21", year = "2014", doi = "10.1145/2629678", } @InProceedings{simon06iclp, author = "Luke Simon and Ajay Mallya and Ajay Bansal and Gopal Gupta", title = "Coinductive Logic Programming", booktitle = "ICLP", year = "2006", pages = "330--345", publisher = pub-sv, series = lncs, volume = "4079", doi = "10.1007/11799573\_25", } @InProceedings{simon88cade, author = "Don Simon", title = "Checking Natural Language Proofs", booktitle = "Proceedings of the 10th Conference on Automated Deduction", year = "1988", publisher = "Springer", series = lncs, number = "310", pages = "141--150", editor = "E. Lusk and R. Overbeek", } @PhdThesis{simon90phd, author = "Don Simon", title = "Checking Number Theory Proofs in Natural Language", school = "University of Texas at Austin", year = "1990", annote = "available via ftp ftp.duq.edu, /pub/simon", } @InProceedings{simpson17fossacs, title = "Cyclic Arithmetic Is Equivalent to Peano Arithmetic", author = "Alex Simpson", booktitle = "Foundations of Software Science and Computation Structures - 20th International Conference, {FoSSaCS}", year = "2017", volume = "10203", editor = "Javier Esparza and Andrzej S. Murawski", pages = "283--300", series = lncs, doi = "10.1007/978-3-662-54458-7_17", } @InProceedings{simpson95lics, author = "Alex K. Simpson", title = "Compositionality via Cut-Elimination: Hennessy-Milner Logic for an Arbitrary {GSOS}", booktitle = lics95, editor = "D. Kozen", year = "1995", publisher = "IEEE Computer Society Press", address = "San Diego, California", month = jun, pages = "420--430", } @InProceedings{sirer11sosp, author = "Emin Gun Sirer and Willem de Bruijn and Patrick Reynolds and Alan Shieh and Kevin Walsh and Dan Williams and Fred B. Schneider", title = "Logical attestation: an authorization architecture for trustworthy computing", booktitle = "Proceedings of the 23rd ACM Symposium on Operating Systems Principles (23rd SOSP'11)", pages = "249--264", publisher = "ACM Press", address = "Cascais, Portugal", month = oct, year = "2011", } @Article{slaney89jpl, author = "John Slaney", title = "Solution to a problem of {O}no and {K}omori", journal = "Journal of Philosophic Logic", volume = "18", year = "1989", pages = "103--111", } @InProceedings{slaney94cade, author = "John K. Slaney", title = "The Crisis in Finite Mathematics: Automated Reasoning as Cause and Cure", booktitle = "Automated Deduction - CADE-12, 12th International Conference on Automated Deduction, Nancy, France, June 26 - July 1, 1994, Proceedings", pages = "1--13", year = "1994", URL = "https://dx.doi.org/10.1007/3-540-58156-1\_1", doi = "10.1007/3-540-58156-1\_1", editor = "Alan Bundy", series = "Lecture Notes in Computer Science", volume = "814", publisher = "Springer", } @InProceedings{slind98cade, author = "Konrad Slind and Michael J. C. Gordon and Richard J. Boulton and Alan Bundy", title = "System Description: An Interface Between {CL}$^{\mbox{A}}${M} and {HOL}.", booktitle = cade98, year = "1998", pages = "134--138", URL = "https://link.springer.de/link/service/series/0558/bibs/1421/14210134.htm", } @InProceedings{smolka94ccl, author = "Gert Smolka", title = "A Foundation for Higher-Order Concurrent Constraint Programming", booktitle = "Proceedings of Constraints in Computational Logics", editor = "J.-P. Jouannaud", publisher = "Springer", series = lncs, volume = "845", year = "1994", pages = "50--72", } @InCollection{smorynski04hpl, author = "Craig Smorynski", title = "Modal Logic and Self-Reference", booktitle = "Handbook of Philosophical Logic, Volume 11 (Second Edition)", publisher = "Kluwer Academic", year = "2004", editor = "Dov Gabbay and Franz Guenther", pages = "1--54", } @Book{smullyan61, author = "Raymond Smullyan", title = "Theory of Formal Systems", series = "Annals of Mathematical Studies", number = "47", publisher = "Princeton University Press", address = "Princeton, New Jersey", year = "1961", } @Article{smullyan63nas, title = "A Unifying Principle for Quantification Theory", author = "Raymond M. Smullyan", journal = "Proc. Nat. Acad Sciences", volume = "49", pages = "828--832", year = "1963", } @Book{smullyan68book, title = "First-Order Logic", author = "Raymond M. Smullyan", publisher = "Springer", year = "1968", } @Article{smullyan68jsl, author = "Raymond M. Smullyan", title = "Analytic Cut", journal = jsl, volume = "33", number = "4", year = "1968", pages = "560--564", } @Book{smullyan83, author = "Raymond Smullyan", title = "5000 {B}.{C}. and Other Philosophical Fantasies", publisher = "St. Martin's Press", address = "New York", year = "1983", } @Book{smullyan85, author = "Raymond Smullyan", title = "To Mock {A} Mockingbird", publisher = "Alfred A. Knopf", address = "New York", year = "1985", } @Book{smullyan95, author = "Raymond M. Smullyan", title = "First-Order Logic", publisher = "Dover Publications", year = "1995", note = "Second edition.", } @Article{smyth78, author = "M. Smyth", title = "Powerdomains", journal = "J. Comput. Syst. Sci.", volume = "15", number = "1", year = "1978", pages = "23--36", } @MastersThesis{snow10ms, author = "Zachary Snow", title = "Realizing the Dependently Typed Lambda Calculus", school = "University of Minnesota", year = "2010", } @InProceedings{snow10ppdp, author = "Zachary Snow and David Baelde and Gopalan Nadathur", title = "A Meta-Programming Approach to Realizing Dependently Typed Logic Programming", booktitle = ppdp10, editor = "Temur Kutsia and Wolfgang Schreiner and Maribel Fern\'andez", year = "2010", pages = "187--198", } @TechReport{snyder87tr, author = "Wayne Snyder", title = "General {E-Unification}: Complete Transformations for Equational Theorem Proving and Logic Programming", type = "Dissertation Proposal", institution = "University of Pennsylvania", month = jul, year = "1987", } @Article{snyder89jsc, author = "Wayne Snyder and Jean H. Gallier", title = "Higher Order Unification Revisited: Complete Sets of Transformations", journal = "Journal of Symbolic Computation", volume = "8", number = "1-2", pages = "101--140", year = "1989", } @Book{snyder91, author = "Wayne Snyder", title = "A proof theory for general unification", publisher = "Birkhauser, Boston", year = "1991", } @Book{soerensen98book, author = "Morten Heine S{\o}rensen and Pawel Urzyczyn", title = "Lectures on the Curry-Howard Isomorphism", publisher = "Elsevier", year = "2006", volume = "149", series = "Studies in Logic", } @Article{sondergaard90acta, author = "Harald Sondergaard and Peter Sestoft", title = "Referential transparancy, definiteness and unfoldability", journal = "Acta Informatica", volume = "27", year = "1990", } @Misc{southern14ciclops, author = "Mary Southern and Gopalan Nadathur", title = "A {$\lambda$Prolog} Based Animation of {Twelf} Specifications", howpublished = "The International Colloquium on Implementation of Constraint and Logic Programming Systems (CICLOPS)", year = "2014", pages = "63--77", URL = "https://arxiv.org/pdf/1407.1545.pdf", } @InProceedings{southern14fsttcs, author = "Mary Southern and Kaustuv Chaudhuri", title = "A Two-Level Logic Approach to Reasoning about Typed Specification Languages", booktitle = "34th International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS)", year = "2014", pages = "557--569", volume = "29", series = lipics, publisher = lci, editor = "Venkatesh Raman and S. P. Suresh", month = dec, address = "New Delhi, India", doi = "10.4230/LIPIcs.FSTTCS.2014.557", URL = "https://abella-prover.org/papers/fsttcs14lf.pdf", } @PhdThesis{southern21phd, author = "Mary Southern", title = "A Framework for Reasoning About {LF} Specifications", school = "University of Minnesota", year = "2021", URL = "https://arxiv.org/pdf/2105.04110.pdf", month = apr, } @Article{sozeau20coq, title = "{Coq Coq Correct! Verification of Type Checking and Erasure for Coq, in Coq}", author = "Matthieu Sozeau and Simon Boulier and Yannick Forster and Nicolas Tabareau and Th{\'e}o Winterhalter", journal = "Proceedings of the ACM on Programming Languages", volume = "4", number = "8", pages = "1--28", doi = "10.1145/3371076", year = "2020", publisher = "ACM New York, NY, USA", } @Article{sozeau20jar, author = "Matthieu Sozeau and Abhishek Anand and Simon Boulier and Cyril Cohen and Yannick Forster and Fabian Kunze and Gregory Malecha and Nicolas Tabareau and Th{\'{e}}o Winterhalter", title = "The MetaCoq Project", journal = "J. Autom. Reason.", volume = "64", number = "5", pages = "947--999", year = "2020", doi = "10.1007/s10817-019-09540-0", } @InProceedings{sprenger03fossacs, author = "C. Spenger and M. Dams", title = "On the Structure of Inductive Reasoning: Circular and Tree-shaped Proofs in the $\mu$-Calculus", booktitle = "FOSSACS'03", year = "2003", editor = "A.~Gordon", volume = "2620", pages = "425--440", series = lncs, publisher = "Springer", } @Article{sprenger03ita, author = "Christoph Sprenger and Mads Dam", title = "On global induction mechanisms in a $\mu$-calculus with explicit approximations", journal = "ITA", volume = "37", number = "4", year = "2003", pages = "365--391", doi = "10.1051/ita:2003024", } @TechReport{srinivas90a, author = "Yellamraju V. Srinivas", title = "Category Theory: {D}efinitions and Examples", institution = "Dept. of ICS, University of California, Irvine", number = "90-14", month = feb, year = "1990", } @Article{staerk91jlc, author = "Robert St{\"a}rk", title = "A complete axiomatization of the three-valued completion of logic programs", journal = jlc, year = "1991", volume = "1", number = "6", pages = "811--834", } @Article{staerk92jfcs, author = "R. F. St{\"a}rk", title = "Cut-property and negation as failure", journal = "International Journal of Foundations of Computer Science", year = "1994", volume = "5", number = "2", pages = "129--164", } @PhdThesis{staerk92phd, author = "R. F. Staerk", title = "The Proof Theory of Logic Programs with Negation", school = "Universit{\"a}t Bern", year = "1992", } @Article{stampoulis18icfp, author = "Antonis Stampoulis and Adam Chlipala", title = "Prototyping a functional language using higher-order logic programming: a functional pearl on learning the ways of {\(\lambda\)}{Prolog/Makam}", journal = "Proc. {ACM} Program. Lang.", volume = "2", number = "{ICFP}", pages = "93:1--93:30", year = "2018", URL = "https://doi.org/10.1145/3236788", doi = "10.1145/3236788", } @PhdThesis{statman74phd, author = "Richard Statman", title = "Structural Complexity of Proofs", school = "Stanford University", year = "1974", } @Article{statman78aml, author = "Richard Statman", title = "Bounds for Proof-Search and Speed-Up in the Predicate Calculus", journal = "Annals of Mathematical Logic", volume = "15", year = "1978", pages = "225--287", } @Article{statman79tcsa, author = "Richard Statman", title = "Intuitionistic Propositional Logic is Polynomial-Space Complete", journal = tcs, year = "1979", volume = "9", pages = "67--72", } @Article{statman79tcsb, author = "Richard Statman", title = "The Typed {$\lambda$}-Calculus Is not Elementary Recursive", journal = tcs, volume = "9", year = "1979", pages = "73--81", } @InProceedings{statman81focs, author = "Richard Statman", title = "Number Theoretic Functions Computable by Polymorphic Programs", booktitle = "22nd Annual Symposium on Foundations of Computer Science", publisher = "IEEE", month = oct, year = "1988", pages = "279--282", } @Article{statman81jsl, author = "Richard Statman", title = "Completeness, Invariance and $\lambda$-definability", journal = jsl, volume = "47", number = "1", year = "1981", pages = "297--306", } @Article{statman81tcs, author = "Richard Statman", title = "On the Existence of Closed Terms in the Typed $\lambda$-Calculus {II}: Transformations of Unification Problems", journal = tcs, volume = "15", pages = "329--338", } @Article{statman83amlg, author = "Richard Statman", title = "$\lambda$-definable Functionals and $\beta\eta$ Conversion", journal = "Archiv f{\"u}r Mathematische Logik und Grundlagenforschung", volume = "22", year = "1983", pages = "1--6", } @Article{statman85ic, author = "Richard Statman", title = "Logical Relations and the Typed $\lambda$-Calculus", journal = "Information and Control", volume = "65", pages = "85--97", year = "1985", } @Article{statman86ndjfl, author = "Richard Statman", title = "Solving Functional Equations at Higher Types; Some Examples and Some Theorems", journal = "Notre Dame Journal of Formal Logic", volume = "27", number = "1", month = jan, year = "1986", pages = "66--74", } @Book{sterling86, author = "Leon Sterling and Ehud Shapiro", title = "The Art of Prolog: Advanced Programming Techniques", publisher = "MIT Press", address = "Cambridge MA", year = "1986", } @InProceedings{sternagel14uitp, title = "The Certification Problem Format", booktitle = "Proceedings UITP 2014", author = "Christian Sternagel and Ren{\'e} Thiemann", year = "2014", month = oct, doi = "10.4204/EPTCS.167.8", pages = "61--72", URL = "https://arxiv.org/abs/1410.8220", } @InProceedings{sternagel15cpp, author = "Thomas Sternagel and Sarah Winkler and Harald Zankl", title = "Recording Completion for Certificates in Equational Reasoning", booktitle = "Proceedings of the 2015 Conference on Certified Programs and Proofs", series = "CPP '15", year = "2015", ISBN = "978-1-4503-3296-5", location = "Mumbai, India", pages = "41--47", doi = "10.1145/2676724.2693171", publisher = "ACM", address = "New York, NY, USA", keywords = "certification, completion, equational logic, rewriting", } @InProceedings{stewart04aiml, author = "Charles Stewart and Phiniki Stouppa", title = "A Systematic Proof Theory for Several Modal Logics", booktitle = "Advances in Modal Logic", year = "2004", pages = "309--333", } @TechReport{stickel83, author = "Mark E. Stickle", title = "Theory Resolution: Building in Nonequational Theories", institution = "SRI International", address = "Menlo Park", month = may, year = "1983", number = "286", note = "Also presented at AAAI-83", } @InProceedings{stickel85, author = "Mark E. Stickel and W. Mabry Tyson", title = "An Analysis of Consecutively Bounded Depth-First Search with Applications in Automated Deduction", booktitle = "Proceedings of the International Joint Conference on Artificial Intelligence 1985", pages = "1073--1075", address = "Los Angeles", month = aug, year = "1985", } @InProceedings{stickel86, title = "A {Prolog} Technology Theorem Prover: Implementation by an Extended {Prolog} Compiler", author = "Mark E. Stickel", booktitle = "Eighth International Conference on Automated Deduction", month = jul, year = "1986", pages = "573--587", publisher = "Springer", series = lncs, volume = "230", editor = "J{\"o}rg H. Siekmann", } @InBook{stickel87fai, author = "M.~E. Stickel", title = "An introduction to automated deduction", booktitle = "Fundamentals of Artificial Intelligence", publisher = "Springer", year = "1987", editor = "W.~Bibel and P.~Jorrand", pages = "75--132", } @Article{stickel88jar, author = "Mark Stickel", title = "A {PROLOG} Technology Theorem Prover: Implementation by an extended {PROLOG} compiler", journal = "Journal of Automated Reasoning", year = "1988", volume = "4", number = "4", pages = "353--380", } @Article{stirling07entcs, title = "Model-Checking Games for Typed lambda-Calculi", author = "Colin Stirling", journal = "Electr. Notes Theor. Comput. Sci", year = "2007", volume = "172", pages = "589--609", doi = "10.1016/j.entcs.2007.02.021", } @Article{stirling09lmcs, author = "Colin Stirling", title = "Decidability of Higher-Order Matching", journal = lmcs, year = "2009", volume = "5", number = "3", pages = "1--52", } @Unpublished{stirling96mfit, author = "Colin Stirling", title = "Bisimulation, model checking and other games", note = "Notes for Mathfit Workshop on Finite Model Theory, University of Wales, Swansea", month = jul, URL = "https://www.dcs.ed.ac.uk/home/cps/mfit.ps", year = "1996", } @Article{stirling99igpl, title = "Bisimulation, Modal Logic and Model Checking Games", author = "Colin Stirling", journal = "Logic Journal of the IGPL", year = "1999", number = "1", volume = "7", pages = "103--124", URL = "https://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.28.1594", } @Unpublished{stodden13report, author = "V. Stodden and D. H. Bailey and J. Borwein and R. J. LeVeque and W. Rider and W. Stein", title = "Setting the Default to Reproducible: Reproducibility in Computational and Experimental Mathematics", note = "Developed collaboratively by the ICERM workshop participants", URL = "https://www.davidhbailey.com/dhbpapers/icerm-report.pdf", month = feb, year = "2013", } @InProceedings{stoughton1996porgi, title = "{Porgi}: a proof-or-refutation generator for intuitionistic propositional logic", author = "Alley Stoughton", booktitle = "CADE Workshop on Proof-search in Type-theoretic Languages", pages = "109--116", year = "1996", } @Book{stoy77, author = "Joseph E. Stoy", title = "Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory", publisher = "MIT Press", address = "Cambridge, MA", year = "1977", } @Misc{strassburger.tcs, author = "Lutz Stra{\ss}burger", title = "On the Decision Problem for {MELL}", URL = "https://hal.inria.fr/hal-01870148", doi = "10.1016/j.tcs.2019.02.022", note = "To appear in TCS.", } @InProceedings{strassburger02lpar, author = "Lutz Stra{\ss}burger", title = "A Local System for Linear Logic", booktitle = "Proceedings of LPAR 2002", pages = "388--402", year = "2002", number = "2514", series = lncs, month = jan, } @PhdThesis{strassburger03phd, author = "Lutz Stra{\ss}burger", title = "Linear Logic and Noncommutativity in the Calculus of Structures", school = "Technische Universit{\"a}t Dresden", year = "2003", } @Article{strassburger03tcs, author = "Lutz Stra{\ss}burger", title = "{MELL} in the Calculus of Structures", year = "2003", journal = tcs, volume = "309", number = "1--3", pages = "213--285", } @InProceedings{strassburger04csl, author = "Lutz Stra{\ss}burger and Fran\c{c}ois Lamarche", title = "On Proof Nets for Multiplicative Linear Logic with Units", booktitle = "Computer Science Logic, CSL 2004", publisher = "Springer", volume = "3210", pages = "145--159", editor = "Jerzy Marcinkowski and Andrzej Tarlecki", series = lncs, year = "2004", } @InProceedings{strassburger05SD, author = "Lutz Stra{\ss}burger", title = "From deep inference to proof nets", year = "2005", booktitle = "Structures and Deduction 2005 (Satellite Workshop of ICALP'05)", editor = "Paola Bruscoli and Fran\c{c}ois Lamarche", URL = "https://www.lix.polytechnique.fr/~lutz/papers/deepnet.pdf", } @InCollection{strassburger05unilogI, author = "Lutz Stra{\ss}burger", title = "What is a logic, and what is a proof?", booktitle = "Logica Universalis", publisher = "Birkh{\"a}user", pages = "135--145", editor = "Jean-Yves Beziau", edition = "1st", year = "2005", } @InProceedings{strassburger06clc, author = "Lutz Stra{\ss}burger", title = "What could a Boolean category be?", year = "2006", booktitle = "Classical Logic and Computation 2006 (Satellite Workshop of ICALP'06)", editor = "Steffen van Bakel", pdf = "https://www.lix.polytechnique.fr/~lutz/papers/medial-kurz.pdf", } @TechReport{strassburger06tr, author = "Lutz Stra{\ss}burger", title = "Proof Nets and the Identity of Proofs", year = "2006", month = oct, institution = "INRIA", number = "6013", note = "Lecture notes for ESSLLI'06", type = "Research Report", URL = "https://hal.inria.fr/inria-00107260", } @InProceedings{strassburger07hybrid, author = "Lutz Stra{\ss}burger", title = "Deep Inference for Hybrid Logic", year = "2007", booktitle = "International Workshop on Hybrid Logic 2007 (Part of ESSLLI'07)", pdf = "https://www.lix.polytechnique.fr/~lutz/papers/hybrid.pdf", } @InProceedings{strassburger07rta, author = "Lutz Stra{\ss}burger", title = "A Characterisation of Medial as Rewriting Rule", year = "2007", pages = "344--358", booktitle = "Term Rewriting and Applications, RTA'07", editor = "Franz Baader", pdf = "https://www.lix.polytechnique.fr/~lutz/papers/CharMedial.pdf", publisher = pub-sv, volume = "4533", series = lncs, } @Article{strassburger07tac, author = "Lutz Stra{\ss}burger", title = "On the Axiomatisation of {B}oolean Categories with and without Medial", year = "2007", journal = "Theory and Applications of Categories", volume = "18", number = "18", pages = "536--601", pdf = "https://www.lix.polytechnique.fr/~lutz/papers/medial.pdf", URL = "https://arxiv.org/abs/cs.LO/0512086", } @InCollection{strassburger07unilogII, author = "Lutz Stra{\ss}burger", title = "What is a logic, and what is a proof?", booktitle = "Logica Universalis", publisher = "Birkh{\"a}user", pages = "135--152", editor = "Jean-Yves Beziau", edition = "2nd", year = "2007", URL = "https://www.lix.polytechnique.fr/~lutz/papers/WhatLogicProof.pdf", } @InProceedings{strassburger09lata, author = "Lutz Stra{\ss}burger", title = "A {K}leene Theorem for Forest Languages", booktitle = "Language and Automata Theory and Applications, LATA'09", year = "2009", pages = "715--727", doi = "10.1007/978-3-642-00982-2\_61", editor = "Adrian Horia Dediu and Armand-Mihai Ionescu and Carlos Mart\'{\i}n-Vide", publisher = pub-sv, series = lncs, volume = "5457", } @InProceedings{strassburger09tlca, author = "Lutz Stra{\ss}burger", title = "Some Observations on the Proof Theory of Second Order Propositional Multiplicative Linear Logic", booktitle = "Typed Lambda Calculi and Applications, TLCA'09", year = "2009", pages = "309--324", doi = "10.1007/978-3-642-02273-9\_23", editor = "Pierre-Louis Curien", publisher = "Springer", series = lncs, volume = "5608", } @InProceedings{strassburger10cie, author = "Lutz Stra{\ss}burger", title = "What Is the Problem with Proof Nets for Classical Logic?", booktitle = "Programs, Proofs, Processes, 6th Conference on Computability in Europe (CiE 2010)", year = "2010", month = jun, address = "Ponta Delgada, Azores, Portugal", pages = "406--416", editor = "Fernando Ferreira and Benedikt L{\"o}we and Elvira Mayordomo and Lu\'{\i}s Mendes Gomes", publisher = "Springer", series = lncs, volume = "6158", doi = "10.1007/978-3-642-13962-8\_45", URL = "https://www.lix.polytechnique.fr/~lutz/papers/CiE10.pdf", } @PhdThesis{strassburger11hdr, author = "Lutz Stra{\ss}burger", school = "Universit\'e Paris VII", title = "Towards a Theory of Proofs of Classical Logic", type = "Habiliatation \`{a} diriger des recherches", year = "2011", } @Article{strassburger11jlc, author = "Lutz Stra{\ss}burger", title = "From Deep Inference to Proof Nets via Cut Elimination", journal = jlc, year = "2011", volume = "21", number = "4", pages = "589--624", month = aug, } @Article{strassburger11tocl, author = "Lutz Stra{\ss}burger and Alessio Guglielmi", title = "A system of interaction and structure {IV}: The exponentials and decomposition", journal = "ACM Trans. Comput. Log.", volume = "12", number = "4", year = "2011", pages = "23", doi = "10.1145/1970398.1970399", } @Article{strassburger12apal, author = "Lutz Stra{\ss}burger", title = "Extension without Cut", publisher = "Elsevier", pages = "1995--2007", journal = apal, volume = "163", number = "12", doi = "10.1016/j.apal.2012.07.004", year = "2012", URL = "https://hal.inria.fr/hal-00759215", pdf = "https://hal.inria.fr/hal-00759215/PDF/psppp.pdf", } @InProceedings{strassburger13fossacs, author = "Lutz Stra{\ss}burger", title = "Cut Elimination in Nested Sequents for Intuitionistic Modal Logics", booktitle = "Foundations of Software Science and Computation Structures, 16th International Conference (FOSSACS)", year = "2013", editor = "Frank Pfenning", volume = "7794", series = lncs, pages = "209--224", publisher = pub-sv, doi = "10.1007/978-3-642-37075-5\_14", } @TechReport{strassburger18tr, author = "Lutz Stra{\ss}burger", title = "On the Decision Problem for {MELL}", institution = "Inria", year = "2018", URL = "https://hal.inria.fr/hal-01870148", number = "9203", month = sep, doi = "10.1016/j.tcs.2019.02.022", } @Article{strassburger19mscs, title = "Deep inference and expansion trees for second-order multiplicative linear logic", volume = "29", doi = "10.1017/S0960129518000385", number = "8", journal = "Mathematical Structures in Computer Science", publisher = "Cambridge University Press", author = "Lutz Stra\ss burger", year = "2019", pages = "1030--1060", } @Article{strassburger19tcs, author = "Lutz Stra{\ss}burger", title = "On the Decision Problem for {MELL}", journal = tcs, year = "2019", volume = "768", pages = "91--98", doi = "10.1016/j.tcs.2019.02.022", } @InProceedings{stump08lfmtp, author = "Aaron Stump", title = "Proof checking technology for satisfiability modulo theories", booktitle = "Logical Frameworks and Meta-Languages: Theory and Practice", year = "2008", editor = "A. Abel and C. Urban", } @Article{stump13fmsd, author = "Aaron Stump and Duckki Oe and Andrew Reynolds and Liana Hadarean and Cesare Tinelli", title = "{SMT} proof checking using a logical framework", journal = "Formal Methods in System Design", year = "2013", volume = "42", number = "1", pages = "91--118", } @Book{stump16book, title = "Verified functional programming in Agda", author = "Aaron Stump", year = "2016", publisher = "Morgan \& Claypool", } @InProceedings{sultana2012understanding, title = "Understanding {LEO}-{II}'s proofs.", author = "Nik Sultana and Christoph Benzm{\"u}ller", booktitle = "IWIL@ LPAR", pages = "33--52", year = "2012", } @Article{sulzmann08jfp, author = "Martin Sulzmann and Peter J. Stuckey", title = "{HM}({X}) type inference is {CLP}({X}) solving", journal = "Journal of Functional Programming", year = "2008", volume = "18", pages = "251--283", } @InProceedings{sumii01csfw, author = "Eijiro Sumii and Benjamin C. Pierce", title = "Logical Relations for Encryption", booktitle = "Proceedings of the 14th IEEE Computer Security Foundations Workshop", year = "2001", month = jun, } @TechReport{sunmicro92html, author = "Sun Micro\-systems", title = "The Java Language: An Overview", institution = "Sun Micro\-systems", year = "1996", type = "https://java.sun.com/doc/Overviews/java/", } @Article{sutcliffe06aic, title = "The state of {CASC}", author = "Geoff Sutcliffe and Christian Suttner", journal = "AI Communications", volume = "19", number = "1", pages = "35--48", year = "2006", publisher = "IOS Press", } @Article{sutcliffe06ijai, title = "Semantic derivation verification: Techniques and implementation", author = "Geoff Sutcliffe", journal = "International Journal on Artificial Intelligence Tools", volume = "15", number = "06", pages = "1053--1070", year = "2006", publisher = "World Scientific", } @Article{sutcliffe06ijait, title = "Semantic Derivation Verification: Techniques and Implementation", author = "Geoff Sutcliffe", journal = "International Journal on Artificial Intelligence Tools", volume = "15", number = "6", pages = "1053--1070", year = "2006", } @InProceedings{sutcliffe08szs, title = "The {SZS} Ontologies for Automated Reasoning Software.", author = "Geoff Sutcliffe", booktitle = "LPAR Workshops", volume = "418", year = "2008", } @Article{sutcliffe09jar, title = "{The TPTP Problem Library and Associated Infrastructure: The FOF and CNF Parts, v3.5.0}", author = "Geoff Sutcliffe", journal = "Journal of Automated Reasoning", volume = "43", number = "4", pages = "337--362", year = "2009", publisher = "Springer", doi = "10.1007/s10817-009-9143-8", } @Article{sutcliffe16casc, author = "Geoff Sutcliffe", year = "2016", title = "{The CADE ATP System Competition - CASC}", journal = "AI Magazine", volume = "37", number = "2", pages = "99--101", } @InProceedings{syverson01fsad, author = "Paul Syverson and Iliano Cervesato", editor = "R. Focardi and R. Gorrieri", booktitle = "Foundations of Security Analysis and Design", title = "The Logic of Authentication Protocols", publisher = "Springer", year = "2001", series = lncs, number = "2171", } @Misc{tac.website, title = "Tac: {A} Generic and Adaptable Interactive Theorem Prover", author = "David Baelde and Dale Miller and Zach Snow and Alexandre Viel", howpublished = "\url{https://slimmer.gforge.inria.fr/tac/}", year = "2009", key = "zzz", } @Unpublished{taci, author = "Zach Snow and David Baelde and Dale Miller", title = "Taci: an interactive theorem proving framework", year = "2007", URL = "https://gforge.inria.fr/projects/slimmer/", note = "OCaml code.", } @Unpublished{taci08, author = "David Baelde and Zach Snow and Alexandre Viel", title = "Tac: an interactive theorem proving framework", year = "2008", note = "\url{https://slimmer.gforge.inria.fr/tac}", URL = "https://gforge.inria.fr/projects/slimmer/", } @Article{tait66bams, author = "William W. Tait", title = "A nonconstructive proof of Gentzen's Hauptsatz for second order predicate logic", journal = "Bulletin of the American Mathematical Society", year = "1966", volume = "72", pages = "980--983", } @Article{tait67jsl, author = "W. W. Tait", title = "Intensional Interpretations of Functionals of Finite Type {I}", journal = jsl, volume = "32", number = "2", year = "1967", pages = "198--212", } @Article{takahashi67jmsj, author = "{Moto-o} Takahashi", title = "A Proof of Cut-Elimination Theorem in Simple Type Theory", journal = "Journal of the Mathematical Society of Japan", volume = "19", year = "1967", pages = "399--410", } @Article{takeuti53jjm, author = "Gaisi Takeuti", title = "On a Generalized Logic Calculus", journal = "Japanese Journal of Mathematics", volume = "23", year = "1953", pages = "39--96", note = "Errata: ibid, vol.\ 24 (1954), 149--156", } @Article{takeuti58jmsj, author = "Gaisi Takeuti", title = "Remark on the fundamental conjecture of {GLC}", journal = "Journal of the Mathematical Society of Japan", volume = "10", year = "1958", pages = "44--45", } @Article{takeuti60jmsj, author = "Gaisi Takeuti", title = "An example on the fundamental conjecture of {GLC}", journal = "Journal of the Mathematical Society of Japan", volume = "12", year = "1960", pages = "238--242", } @Book{takeuti87, author = "Gaisi Takeuti", title = "Proof Theory", edition = "2nd", publisher = "North Holland", year = "1987", } @Book{takeuti87book, author = "Gaisi Takeuti", publisher = "North Holland", title = "Proof Theory", year = "1987", } @InProceedings{talpin92lics, author = "Jean-Pierre Talpin and Pierre Jouvelot", title = "The Type and Effect Discipline", editor = "A. Scedrov", booktitle = lics92, pages = "162--173", year = "1992", publisher = "IEEE", } @Article{talpin94ic, title = "The Type and Effect Discipline", author = "Jean-Pierre Talpin and Pierre Jouvelot", pages = "245--296", journal = "Information and Computation", month = jun, year = "1994", volume = "111", number = "2", } @Article{tammet94jar, author = "T. Tammet", title = "Proof Strategies in Linear Logic", journal = "Journal of Automated Reasoning", year = "1994", volume = "12", pages = "273--304", note = "Also available as Programming Methodology Group Report 70, Chalmers University, 1993", note = "The source code for the theorem provers is available as ftp://ftp.cs.chalmers.se/pub/users/tammet/linprove.tar.gz", } @InProceedings{tammet96cade, author = "Tanel Tammet", title = "A resolution theorem prover for intuitionistic logic", booktitle = "Automated {Deduction} --- {CADE-13}", series = lncs, volume = "1104", pages = "2--16", year = "1996", } @InProceedings{tamura96fuji, author = "Naoyuki Tamura and Yukio Kaneda", title = "Extension of {WAM} for a linear logic programming language", booktitle = "{Second Fuji International Workshop on Functional and Logic Programming}", editor = "T. Ida and A. Ohori and M. Takeichi", year = "1996", publisher = "World Scientific", month = nov, pages = "33--50", } @Article{tarau22tplp, author = "Paul Tarau", title = "Abductive Reasoning in Intuitionistic Propositional Logic via Theorem Synthesis", journal = tplp, year = "2022", pages = "1--15", month = apr, note = "To appear.", } @InProceedings{tarau92rclp, author = "Paul Tarau", title = "Program Transformations and {WAM}-support for the Compilation of Definite Metaprograms", booktitle = "Proceedings of the First and Second Russian Conference on Logic Programming", year = "1992", pages = "462--473", publisher = "Springer", series = lnai, number = "592", } @Article{tarnlund77, author = "Sten-Ake T{\"{a}}rnlund", title = "{H}orn {C}lause {C}omputability", journal = "BIT", year = "1977", volume = "17", pages = "215--226", doi = "10.1007/BF01932293", } @Article{tarski54im, author = "Alfred Tarski", title = "Contributions to the theory of models. {I}.", journal = "Indagationes Mathematicae", volume = "16", pages = "572--581", year = "1954", } @Article{tarski55pjm, author = "Alfred Tarski", title = "A lattice-theoretical fixpoint theorem and its applications", journal = "Pacific Journal of Mathematics", year = "1955", volume = "5", number = "2", pages = "285--309", } @Misc{tassi18coqpl, author = "Enrico Tassi", title = "Elpi: an extension language for {Coq}", howpublished = "CoqPL 2018: The Fourth International Workshop on Coq for Programming Languages", month = jan, year = "2018", URL = "https://hal.inria.fr/hal-01637063/", } @InProceedings{tassi19itp, author = "Enrico Tassi", title = "{Deriving Proved Equality Tests in Coq-Elpi: Stronger Induction Principles for Containers in Coq}", booktitle = "10th International Conference on Interactive Theorem Proving (ITP 2019)", pages = "29:1--29:18", series = "Leibniz International Proceedings in Informatics (LIPIcs)", year = "2019", volume = "141", editor = "John Harrison and John O'Leary and Andrew Tolmach", publisher = "Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik", address = "Dagstuhl, Germany", URL = "https://drops.dagstuhl.de/opus/volltexte/2019/11084", doi = "10.4230/LIPIcs.ITP.2019.29", annote = "Keywords: Coq, Containers, Induction, Equality test, Parametricity translation", } @Article{tatsuta94tcs, title = "Realizability interpretation of coinductive definitions and program synthesis with streams", author = "Makoto Tatsuta", journal = tcs, pages = "119--136", year = "1994", volume = "122", number = "1--2", } @TechReport{tennent86a, author = "R. D. Tennent", title = "{Functor-Category Semantics of Programming Languages and Logics}", number = "ECS-LFCS-86-3", institution = "Laboratory for the Foundations of Computer Science, University of Edinburgh", month = may, year = "1986", } @TechReport{tennent86b, author = "R. D. Tennent", title = "{Semantic Analysis of Specification Logic}", number = "ECS-LFCS-86-5", institution = "Laboratory for the Foundations of Computer Science, University of Edinburgh", month = jun, year = "1986", } @TechReport{tennent86c, author = "R. D. Tennent", title = "{Quantification in Algol-like Languages}", number = "ECS-LFCS-86-6", institution = "Laboratory for the Foundations of Computer Science, University of Edinburgh", month = jun, year = "1986", } @Article{terui04sl, author = "Kazushige Terui", title = "Light Affine Set Theory: {A} Naive Set Theory of Polynomial Time", journal = "Studia Logica", volume = "77", number = "1", year = "2004", pages = "9--40", } @Misc{teyjus, author = "The Teyjus team", title = "The {Teyjus} website", year = "2013", howpublished = "\url{https://code.google.com/p/teyjus}", } @Misc{teyjus.website, title = "The {T}eyjus System -- Version 2", author = "Xiaochu Qi and Andrew Gacek and Steven Holte and Gopalan Nadathur and Zach Snow", URL = "https://teyjus.cs.umn.edu/", year = "2015", } @Article{thatcher68, author = "J. W. Thatcher and J. B. Wright", title = "Generalized Finite Automata Theory with an Application to a Decision Problem of Second-Order Logic", year = "1968", journal = "Math. Systems Theory", volume = "2", pages = "57--81", } @InProceedings{thery92sde, author = "G. Kahn and L. Thery and Y. Bertot", title = "Real Theorem Provers Deserve Real User-Interfaces", booktitle = "Proceedings of the Fifth ACM SIGSOFT Symposium on Software Development Environments", note = "Software Engineering Notes, Vol 17, No 5", publisher = "ACM Press", year = "1992", } @InProceedings{thiemanns09tphol, title = "Certification of Termination Proofs Using {CeTA}", author = "Ren{\'e} Thiemann and Christian Sternagel", booktitle = "Theorem Proving in Higher Order Logics, {TPHOL}s", publisher = "Springer", year = "2009", volume = "5674", editor = "Stefan Berghofer and Tobias Nipkow and Christian Urban and Makarius Wenzel", pages = "452--468", series = lncs, URL = "https://dx.doi.org/10.1007/978-3-642-03359-9", } @TechReport{thom88umtr, author = "James Thom and Justin Zobel", title = "{NU-Prolog} reference manual, version 1.3", institution = "Department of Computer Science, University of Melbourne, Australia", number = "86/10", year = "1988", } @Article{thomason80lp, author = "R. Tomason", title = "A Model Theory for Proposistional Attitudes", journal = "Linguistics and Philosophy", year = "1980", volume = "4", pages = "47--70", } @Article{thomsen93acta, author = "Bent Thomsen", title = "Plain {CHOCS}: {A} Second Generation Calculus for Higher Order Processes", journal = "Acta Inf.", year = "1993", volume = "30", number = "1", pages = "1--59", } @Unpublished{tiu02Llambda, author = "Alwen F. Tiu", title = "An Extension of {L-lambda} Unification", month = sep, year = "2002", note = "\url{https://www.ntu.edu.sg/home/atiu/llambdaext.pdf}", URL = "https://www.ntu.edu.sg/home/atiu/llambdaext.pdf", } @Unpublished{tiu03LincProject, author = "Alwen Tiu", title = "The Linc Project", URL = "https://www.lix.polytechnique.fr/~tiu/lincproject/linc.htm", } @Unpublished{tiu03foldn2, author = "Alwen Tiu", title = "Cut-elimination for a Logic with Generic Judgments", month = jan, year = "2003", note = "Draft, available via web.", pdf = "https://users.rsise.anu.edu.au/~tiu/foldn2.pdf", } @PhdThesis{tiu04phd, author = "Alwen Tiu", title = "A Logical Framework for Reasoning about Logical Specifications", school = "Pennsylvania State University", year = "2004", month = may, pdf = "https://www.lix.polytechnique.fr/Labo/Alwen.Tiu/etd.pdf", URL = "https://etda.libraries.psu.edu/theses/approved/WorldWideIndex/ETD-479/", } @Manual{tiu04tutorial, title = "Level 0/1 Prover: {A} tutorial", author = "Alwen Tiu", month = sep, year = "2004", note = "Available online.", } @InProceedings{tiu05concur, author = "Alwen Tiu", title = "Model Checking for $\pi$-Calculus Using Proof Search", booktitle = "Proceedings of CONCUR'05", pages = "36--50", editor = "Mart{\'\i}n Abadi and Luca de Alfaro", publisher = "Springer", series = lncs, volume = "3653", year = "2005", } @InProceedings{tiu05eshol, author = "Alwen Tiu and Gopalan Nadathur and Dale Miller", title = "Mixing Finite Success and Finite Failure in an Automated Prover", booktitle = "Empirically Successful Automated Reasoning in Higher-Order Logics (ESHOL'05)", pages = "79--98", year = "2005", month = dec, pdf = "https://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/eshol05.pdf", } @InProceedings{tiu05fguc, author = "Alwen Tiu and Dale Miller", title = "A Proof Search Specification of the $\pi$-Calculus", booktitle = "3rd Workshop on the Foundations of Global Ubiquitous Computing", year = "2005", series = "ENTCS", volume = "138", pages = "79--101", doi = "10.1016/j.entcs.2005.05.006", URL = "https://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/fguc04workshop.pdf", } @InProceedings{tiu06lfmtp, author = "Alwen Tiu", title = "A Logic for Reasoning about Generic Judgments", booktitle = "Int. Workshop on Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP'06)", year = "2006", series = entcs, pages = "3--18", volume = "173", editor = "A. Momigliano and B. Pientka", } @Article{tiu06lmcs, author = "Alwen Tiu", title = "A System of Interaction and Structure {II}: The Need for Deep Inference", journal = lmcs, volume = "2", number = "2:4", year = "2006", month = apr, pages = "1--24", URL = "https://arxiv.org/pdf/cs.LO/0512036", note = "DOI: 10.2168/LMCS-2(2:4)2006", } @InProceedings{tiu08lfmtp, author = "Alwen Tiu", title = "On the Role of Names in Reasoning about $\lambda$-tree Syntax Specifications", booktitle = lfmtp08, year = "2008", pages = "32--46", editor = "Andreas Abel and Christian Urban", } @TechReport{tiu08lgext, author = "Alwen Tiu", title = "Cut Elimination for a Logic with Generic Judgments and Induction", month = jan, year = "2008", institution = "CoRR", pdf = "https://arxiv.org/pdf/0801.3065", } @Unpublished{tiu09corr, author = "Alwen Tiu and Alberto Momigliano", title = "Induction and Co-induction in Sequent Calculus", year = "2009", URL = "https://arxiv.org/abs/0812.4727", } @Article{tiu10lmcs, title = "A Proof Theoretic Analysis of Intruder Theories", author = "Alwen Tiu and Rajeev Gor{\'e} and Jeremy E. Dawson", journal = "Logical Methods in Computer Science", year = "2010", number = "3", volume = "6", URL = "https://arxiv.org/abs/1005.4508", } @Article{tiu10tocl, author = "Alwen Tiu and Dale Miller", title = "Proof Search Specifications of Bisimulation and Modal Logics for the $\pi$-calculus", journal = tocl, volume = "11", number = "2", pages = "13:1--13:35", doi = "10.1145/1656242.1656248", year = "2010", } @Unpublished{tiu10unp, author = "Alwen Tiu and Alberto Momigliano", title = "Cut-elimination for a logic with induction and co-induction", year = "2010", URL = "https://users.cecs.anu.edu.au/~tiu/papers/linc-minus.pdf", } @InProceedings{tiu12ijcar, author = "Alwen Tiu", booktitle = "IJCAR", editor = "Bernhard Gramlich and Dale Miller and Uli Sattler", pages = "544--558", publisher = "Springer", series = "Lecture Notes in Computer Science", title = "Stratification in Logics of Definitions.", volume = "7364", year = "2012", } % URL = "https://arxiv.org/abs/0805.2785", @Article{tiu12jal, author = "Alwen Tiu and Alberto Momigliano", title = "Cut elimination for a logic with induction and co-induction", journal = "Journal of Applied Logic", volume = "10", number = "4", pages = "330--367", year = "2012", doi = "10.1016/j.jal.2012.07.007", } @InProceedings{tiu16aplas, author = "Alwen Tiu and Nam Nguyen and Ross Horne", editor = "Atsushi Igarashi", title = "{SPEC}: An Equivalence Checker for Security Protocols", booktitle = "Programming Languages and Systems: 14th Asian Symposium, APLAS 2016, Hanoi, Vietnam, November 21 - 23, 2016, Proceedings", year = "2016", publisher = "Springer International Publishing", pages = "87--95", doi = "10.1007/978-3-319-47958-3\_5", URL = "https://dx.doi.org/10.1007/978-3-319-47958-3\_5", } @Article{tofte90ic, author = "Mads Tofte", journal = "Information and Computation", pages = "1--34", title = "Type Inference for Polymorphic References", volume = "89", year = "1990", } @Book{tolkien54, author = "J. R. R. Tolkien", title = "The Fellowship of the Ring", publisher = "George Allen and Unwin", year = "1954", } @Article{tortoradefalco2003mscs, author = "Lorenzo {Tortora de Falco}", title = "Obsessional experiments for linear logic proof-nets", volume = "13", doi = "10.1017/S0960129503003967", number = "6", journal = "Mathematical Structures in Computer Science", publisher = "Cambridge University Press", year = "2003", pages = "799--855", } @Article{toyama87ipl, title = "Counterexamples to termination for the direct sum of term rewriting systems", journal = "Information Processing Letters", volume = "25", number = "3", pages = "141--143", year = "1987", note = "", ISSN = "0020-0190", doi = "10.1016/0020-0190(87)90122-0", URL = "https://www.sciencedirect.com/science/article/pii/0020019087901220", author = "Yoshihito Toyama", abstract = "The direct sum of two term rewriting systems is the union of systems having disjoint sets of function symbols. It is shown that the direct sum of two term rewriting systems is not terminating, even if these systems are both terminating.", } @Book{troelstra00book, author = "A. S. Troelstra and H. Schwichtenberg", title = "Basic Proof Theory", edition = "2nd", publisher = "Cambridge University Press", year = "2000", } @Book{troelstra73, editor = "Anne Sjerp Troelstra", title = "Metamathematical Investigation of Intuitionistic Arithmetic and Analysis", publisher = "Springer", volume = "344", series = "Lecture Notes in Mathematics", year = "1973", } @Book{troelstra88book, author = "Anne Sjerp Troelstra and Dirk van Dalen", title = "Constructivism in Mathematics", publisher = "North-Holland", year = "1988", volume = "1", } @Book{troelstra92csli, author = "Anne S. Troelstra", title = "Lectures on Linear Logic", publisher = "CSLI Lecture Notes 29, Center for the Study of Language and Information", year = "1992", address = "Stanford, California", } @Book{troelstra96bpt, author = "Anne S. Troelstra and Helmut Schwichtenberg", title = "Basic Proof Theory", publisher = "Cambridge University Press", year = "1996", } @InProceedings{trybulec85clp, author = "A. Trybulec and H. A. Blair", title = "Computer Aided Reasoning", pages = "406--412", editor = "Rohit Parikh", booktitle = "Proceedings of the Conference on Logic of Programs", address = "Brooklyn, NY", month = jun, year = "1985", series = lncs, volume = "193", publisher = "Springer", } @Misc{trymlts.website, author = "Ulysse G{\'e}rard and Dale Miller and Gabriel Scherer", title = "Try {MLTS} Online", note = "\url{https://trymlts.github.io/}", month = mar, year = "2018", } @InBook{tseitin68, author = "G.~Tseitin", booktitle = "Studies in Constructive Mathematics and Mathematical Logic, Part II", title = "On the Complexity of Derivations in the Propositional Logics", pages = "115--125", year = "1968", } @InCollection{tseitin83ar, author = "G. S. Tseitin", title = "On the Complexity of Derivation in Propositional Calculus", booktitle = "Automation of Reasoning: 2: Classical Papers on Computational Logic 1967-1970", editor = "Jörg H. Siekmann and Graham Wrightson (eds.)", publisher = "Springer-Verlag Berlin Heidelberg", year = "1983", series = "Symbolic Computation", } @InCollection{tseytin68, author = "G. S. Tseytin", title = "On the Complexity of Derivation in Propositional Calculus", booktitle = "Studies in Constructive Mathematics and Mathematical Logic {II}", series = "Zapiski Nauchnykh Seminarov LOMI", volume = "8", pages = "235--259", publisher = "Nauka", address = "Leningrad", year = "1968", note = "In Russian", } @Article{turi98mscs, title = "On the foundations of final coalgebra semantics: non-well-founded sets, partial orders, metric spaces", author = "Daniele Turi and Jan Rutten", pages = "481--540", journal = "Mathematical Structures in Computer Science", month = oct, year = "1998", volume = "8", number = "5", } @Article{turing36lms, author = "Alan M. Turing", year = "1936", title = "On Computable Numbers, With an Application to the {E}ntscheidungsproblem", journal = "Proceedings of the London Mathematical Society", volume = "42", pages = "230--265", } @Misc{twelf.website, title = "The {T}welf Project", note = "\url{https://twelf.org/}", year = "2016", key = "Twelf", } @InProceedings{tyson79, title = "Conflicting Bindings and Generalized Substitutions", author = "Mabry Tyson and W. W. Bledsoe", booktitle = "Fourth International Conference on Automated Deduction", month = feb, year = "1979", pages = "14--18", publisher = "Springer", series = lncs, volume = "103", } @InProceedings{ueda05membrane, author = "Kazunori Ueda and Norio Kato", title = "{LMN}tal: {A} Language Model with Links and Membranes.", booktitle = "Workshop on Membrane Computing", pages = "110--125", editor = "Giancarlo Mauri and Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez and Grzegorz Rozenberg and Arto Salomaa", publisher = "Springer", series = lncs, volume = "3365", year = "2005", } @InProceedings{underwood93tableaux, author = "Judith Underwood", title = "The tableau algorithm for intuitionistic propositional calculus as a constructive completeness proof (Extended Abstract)", booktitle = "Proceedings of the Workshop on Theorem Proving with Analytic Tableaux", year = "1993", number = "MPI-I-93-213", pages = "245--248", publisher = "Max-Planck-Institut", note = "Technical report", } @PhdThesis{underwood94phd, author = "Judith L. Underwood", title = "Aspects of the Computational Content of Proofs", school = "Cornell University", year = "1994", } @Book{ungar92csli, author = "A. M. Ungar", title = "Normalization, cut-elimination and the theory of proofs", series = "CSLI Lecture Notes", number = "28", year = "1992", } @PhdThesis{urban00phd, author = "Christian Urban", title = "Classical Logic and Computation", school = "University of Cambridge", year = "2000", } @Article{urban01fi, author = "Christian Urban and Gavin M. Bierman", title = "Strong Normalisation of Cut-Elimination in Classical Logic", journal = "Fundamenta Informaticae", year = "2001", volume = "45", number = "1--2", pages = "123--155", } @InProceedings{urban03csl, author = "C. Urban and A. M. Pitts and M. J. Gabbay", title = "Nominal Unification", booktitle = "Computer Science Logic and 8th Kurt G{\"o}del Colloquium (CSL'03 \& KGC), Vienna, Austria. Proccedings", pages = "513--527", year = "2003", editor = "M. Baaz", series = lncs, publisher = "Springer, Berlin", } @Article{urban04tcs, title = "Nominal unification", author = "Christian Urban and Andrew M. Pitts and Murdoch Gabbay", journal = "Theoretical Computer Science", volume = "323", number = "1-3", year = "2004", pages = "473--497", } @InProceedings{urban05cade, author = "Christian Urban and Christine Tasson", title = "Nominal Techniques in {I}sabelle/{HOL}", booktitle = cade05, series = lncs, year = "2005", publisher = "Springer", editor = "R. Nieuwenhuis", volume = "3632", pages = "38--53", } @InProceedings{urban05tlca, author = "Christian Urban and James Cheney", title = "Avoiding Equivariance in {A}lpha-{P}rolog", year = "2005", pages = "401--416", editor = "Pawel Urzyczyn", booktitle = "Typed Lambda Calculi and Applications, Proceedings", publisher = "Springer", series = "Lecture Notes in Computer Science", volume = "3461", ISBN = "3-540-25593-1", } @Article{urban08jar, author = "Christian Urban", title = "Nominal Reasoning Techniques in {I}sabelle/{HOL}", journal = "Journal of Automated Reasoning", year = "2008", volume = "40", number = "4", pages = "327--356", } @Article{urban11tocl, title = "Mechanizing the metatheory of {LF}", author = "Christian Urban and James Cheney and Stefan Berghofer", journal = "ACM Transactions on Computational Logic (TOCL)", volume = "12", number = "2", pages = "15", year = "2011", publisher = "ACM", } @MastersThesis{urban97ms, author = "Christian Urban", title = "Forum and its implementations", school = "University of St. Andrews", month = dec, year = "1997", } @InProceedings{urquhart00lc, author = "Alasdair Urquhart", title = "The Complexity of Linear Logic with Weakening", booktitle = "Logic Colloquium '98", year = "2000", editor = "S. R. Buss and P. H\'ajek and P. Pudl\'ak", volume = "13", series = "Lecture Notes in Logic", pages = "500--515", } @Unpublished{ursini95, author = "Aldo Ursini", title = "Semantical Investigations of Linear Logic", note = "Manuscript", year = "1995", month = dec, } @InCollection{vanderpoorten00pi, title = "A Proof that {Euler} Missed {\ldots}", booktitle = "Pi: {A} Source Book", author = "Alfred van der Poorten", editor = "Lennart Berggren and Jonathan Borwein and Peter Borwein", year = "2000", publisher = "Springer New York", pages = "439--447", abstract = "The board of programme changes informed us that R. Ap{\'e}ry (Caen) would speak Thursday, 14.00 «Sur l'irrationalit{\'e} de $\zeta$(3).» Though there had been earlier rumours of his claiming a proof, scepticism was general. The lecture tended to strengthen this view to rank disbelief. Those who listened casually, or who were afflicted with being non-Francophone, appeared to hear only a sequence of unlikely assertions.", ISBN = "978-1-4757-3240-5", doi = "10.1007/978-1-4757-3240-5_49", } @InProceedings{vangelder08isaim, title = "Verifying {RUP} Proofs of Propositional Unsatisfiability", author = "Allen Van Gelder", year = "2008", booktitle = "ISAIM", URL = "https://isaim2008.unl.edu/index.php?page=proceedings", } @Article{vangelder12amai, author = "Allen Van Gelder", title = "Producing and verifying extremely large propositional refutations: Have your cake and eat it too.", journal = "Annals of Mathematics and Artificial Intelligence", year = "2012", volume = "65", number = "4", pages = "329--372", } @Article{vangelder91jacm, author = "Allen {Van Gelder} and Kenneth A. Ross and John S. Schilpf", title = "The Well-Founded Semantics for General Logic Programs", journal = "Journal of the {ACM}", year = "1991", volume = "38", number = "3", pages = "620--662", } @Book{vanheijenoort67book, author = "Jean van Heijenoort", title = "From {F}rege to {G}{\"o}del: {A} Source Book in Mathematics, 1879-1931", edition = "3rd printing, 1997", publisher = "Harvard Univ. Press", address = "Cambridge, MA", year = "1967", series = "Source books in the history of the sciences series", ISBN = "0-674-32450-1", } @PhdThesis{vaninwegen96phd, author = "Myra Van{I}nwegen", title = "The Machine-Assisted Proof of Programming Language Properties", school = "University of Pennsylvania", year = "1996", month = may, } @Article{vardi94ic, title = "Reasoning About Infinite Computations", author = "Moshe Y. Vardi and Pierre Wolper", pages = "1--37", journal = "Information and Computation", month = jan, year = "1994", volume = "115", number = "1", } @Article{vauzeilles93apal, author = "Jacqueline Vauzeilles", title = "Cut elimination for the Unified Logic", journal = apal, year = "1993", volume = "62", number = "1", month = jun, pages = "1--16", } @Article{veldman76jsl, author = "Wim Veldman", title = "An Intuitionistic Completeness Theorem for Intuitionistic Predicate Logic", journal = "Journal of Symbolic Logic", year = "1976", volume = "41", number = "1", pages = "159--166", } @PhdThesis{vene00phd, author = "Varmo Vene", title = "Categorical Programming with Inductive and Coinductive Types", type = "{PhD} thesis ({Diss.\ Math.\ Univ.\ Tartuensis 23})", school = "Dept.\ of Computer Science, Univ.\ of Tartu", month = aug, year = "2000", URL = "https://www.cs.ut.ee/~varmo/papers/thesis.ps.gz", } @Article{verhoef95njc, author = "Chris Verhoef", title = "A congruence theorem for structured operational semantics with predicates and negative premises", journal = "Nordic J. of Computing", volume = "2", number = "2", year = "1995", ISSN = "1236-6064", pages = "274--302", publisher = "Publishing Association Nordic Journal of Computing", address = "Finland", } @InProceedings{victor94cav, title = "The Mobility Workbench—a tool for the $\pi$-calculus", author = "Bj{\"o}rn Victor and Faron Moller", booktitle = "Computer Aided Verification", pages = "428--440", year = "1994", organization = "Springer", } @Unpublished{viel10pstt, author = "Alexandre Viel and Dale Miller", title = "Proof search when equality is a logical connective", note = "Unpublished draft presented to the International Workshop on Proof-Search in Type Theories", URL = "https://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/unif-equality.pdf", month = jul, year = "2010", } @PhdThesis{virga99phd, author = "Roberto Virga", title = "Higher-order Rewriting with Dependent Types", school = "Carnegie Mellon University", year = "1999", } @Misc{voevodsky10talk, author = "Vladimir Voevodsky", title = "What if Current Foundations of Mathematics are Inconsistent?", howpublished = "Talk given at the 80th Anniversary of the Institute for Advanced Study", month = sep, year = "2010", } @Misc{voevodsky14ias, author = "Vladimir Voevodsky", title = "The Origins and Motivations of Univalent Foundations: {A} Personal Mission to Develop Computer Proof Verification to Avoid Mathematical Mistakes", year = "2014", URL = "https://www.ias.edu/ideas/2014/voevodsky-origins", } @Misc{voevodsky14talk, author = "Vladimir Voevodsky", title = "Univalent Foundations", howpublished = "Talk given at the Institute for Advanced Study", month = mar, year = "2014", URL = "https://www.math.ias.edu/vladimir/sites/math.ias.edu.vladimir/files/2014\_IAS.pdf", } @InCollection{vonPlato09oup, author = "Jan \Plato{Plato}{von Plato}", title = "Proof Theory of Classical and Intuitionistic Logic", booktitle = "The Development of Modern Logic", editor = "Leila Haaparanta", publisher = "Oxford University Press", year = "2009", page = "499--515", } @InProceedings{voronkov92rclp, author = "Andrei Voronkov", title = "Logic Programming with Bounded Quantifiers", booktitle = "Proceedings of the First and Second Russian Conference on Logic Programming", year = "1992", pages = "486--514", publisher = "Springer", address = "London, UK", } @Article{voronkov99tcs, title = "Simultaneous Rigid {E}-unification and other Decision Problems Related to the {Herbrand} Theorem", author = "Andrei Voronkov", journal = "Theor. Comput. Sci", year = "1999", number = "1-2", volume = "224", pages = "319--352", } @InCollection{waaler99handbook, author = "Arild Waaler and Lincoln Wallen", booktitle = "Handbook of Tableau Methods", title = "Tableaux for Intuitionistic Logics", publisher = pub-sv, year = "1999", pages = "255--296", chapter = "5", doi = "10.1007/978-94-017-1754-0", } @InProceedings{wadge91ilps, author = "William W. Wadge", title = "Higher-Order {Horn} Logic Programming", pages = "289--303", booktitle = "Proceedings of the 1991 International Symposium on Logic Programming", year = "1991", month = oct, editor = "V. Saraswat and K. Ueda", publisher = "MIT Press", address = "San Diego, California, USA", } @InProceedings{wadler03icfp, author = "Philip Wadler", title = "Call-by-value is dual to call-by-name", booktitle = "8th Int. Conf. on Functional Programming", pages = "189--201", year = "2003", publisher = "ACM", address = "New York, NY", doi = "10.1145/944705.944723", } @InCollection{wadler90, author = "Philip Wadler", title = "Linear types can change the world!", booktitle = "Programming Concepts and Methods", editor = "M. Broy and C. B. Jones", publisher = "North Holland", year = "1990", pages = "561--581", } @MastersThesis{wajs00mse, author = "J\'{e}r\'{e}mie D. Wajs", title = "Design and Implementation of a Theorem Prover for Operational Semantics", school = "Pennsylvania State University", year = "2000", } @PhdThesis{wajs02phd, author = "J\'{e}r\'{e}mie D. Wajs", title = "Reasoning about Logic Programs Using Definitions and Induction", school = "Pennsylvania State University", year = "2002", } @TechReport{walker90tr, author = "David Walker", title = "$\pi$-calculus Semantics of Object-Oriented Programming Languages", institution = "University of Edinburgh", type = "LFCS Report Series", number = "ECS-LFCS-90-122", month = oct, year = "1990", } @PhdThesis{wallen87, author = "Linclon A. Wallen", title = "Automated Proof Search in Non-Classical Logics: Efficient Matrix Proof Methods for Modal and Intuitionistic Logics", school = "University of Edinburgh", year = "1987", } @Book{wallen89book, author = "L. A. Wallen", title = "Automated Deduction in Non-Classical Logics", publisher = "MIT Press", year = "1989", } @Article{walukiewicz00ic, author = "Igor Walukiewicz", title = "Completeness of {Kozen's} Axiomatisation of the Propositional $\mu$-Calculus", journal = "Inf. Comput.", volume = "157", number = "1-2", year = "2000", pages = "142--182", } @InProceedings{wand84, author = "M. Wand", title = "From Interpreter to Compiler: {A} Representational Derivation", booktitle = "Programs as Data Objects", editor = "H. Ganzinger and N. D. Jones", series = lncs, number = "217", publisher = "Springer", pages = "306--324", year = "1984", } @TechReport{wand89tr, author = "Mitchell Wand", title = "The Register-Closure Abstract Machine: {A} Machine Model to Support {CPS} Compiling", institution = "Northeastern University, College of Computer Science", year = "1989", number = "NU-CCS-89-24", address = "Boston, MA", month = jul, } @InProceedings{wang13ppdp, author = "Yuting Wang and Kaustuv Chaudhuri and Andrew Gacek and Gopalan Nadathur", title = "Reasoning about Higher-Order Relational Specifications", booktitle = "Proceedings of the 15th International Symposium on Princples and Practice of Declarative Programming (PPDP)", year = "2013", month = sep, editor = "Tom Schrijvers", pages = "157--168", doi = "10.1145/2505879.2505889", address = "Madrid, Spain", URL = "https://chaudhuri.info/papers/draft13hhw.pdf", } @InProceedings{wang15tlca, author = "Yuting Wang and Kaustuv Chaudhuri", title = "A Proof-Theoretic Characterization of Independence in Type Theory", booktitle = "Proceedings of the 13th International Conference on Typed Lambda Calculi and Applications (TLCA)", year = "2015", editor = "Thorsten Altenkirch", month = jul, address = "Warsaw, Poland", series = lipics, publisher = lci, pages = "332--346", URL = "https://drops.dagstuhl.de/opus/frontdoor.php?source_opus=5173", doi = "10.4230/LIPIcs.TLCA.2015.332", } @InProceedings{wang16esop, author = "Yuting Wang and Gopalan Nadathur", title = "A Higher-Order Abstract Syntax Approach to Verified Transformations on Functional Programs", booktitle = "Programming Languages and Systems. ESOP 2016", year = "2016", editor = "P. Thiemann", number = "9632", series = lncs, publisher = pub-sv, pages = "752--779", URL = "https://arxiv.org/abs/1509.03705", } @PhdThesis{wang16phd, author = "Yuting Wang", title = "A Higher-Order Abstract Syntax Approach to the Verified Compilation of Functional Programs", school = "University of Minnesota", year = "2016", month = dec, URL = "https://arxiv.org/abs/1702.03363", } @InCollection{wansing02handbook, author = "Heinrich Wansing", title = "Sequent Systems for Modal Logics", booktitle = "Handbook of Philosophical Logic, Volume {VIII}", edition = "2", publisher = "Kluwer Academic Publishers", year = "2002", editor = "Dov M. Gabbay and Franz Guenthner", pages = "61--146", address = "Amsterdam", } @Article{warren18tplp, title = "Top-down and Bottom-up Evaluation Procedurally Integrated", author = "David S. Warren", volume = "18", doi = "10.1017/S1471068418000194", number = "3-4", journal = "Theory and Practice of Logic Programming", publisher = "Cambridge University Press", year = "2018", pages = "706--721", } @InCollection{warren82mi, author = "David H. D. Warren", title = "Higher-order extensions to {Prolog}: Are they needed?", booktitle = "Machine Intelligence 10", editor = "J. E. Hayes and D. Michie and Y-H Pao", publisher = "Halsted Press", address = "Chicester, England", year = "1982", pages = "441--454", } @TechReport{warren83tr, author = "D. H. D. Warren", title = "An Abstract {P}rolog Instruction Set", month = oct, year = "1983", institution = "SRI International", number = "309", } @InProceedings{warren84fgc, author = "D. S. Warren", title = "Database Updates in {Prolog}", booktitle = "Proceedings of the International Conference on Fifth Generation Computer Systems", pages = "244--253", year = "1984", } @TechReport{watkins03tr, author = "Kevin Watkins and Iliano Cervesato and Frank Pfenning and David Walker", title = "A concurrent logical framework {I}: Judgments and properties", institution = "Carnegie Mellon University", year = "2003", number = "CMU-CS-02-101", note = "Revised, May 2003", } @InProceedings{watkins03types, author = "Keven Watkins and Iliano Cervesato and Frank Pfenning and David Walker", title = "A concurrent logical framework {I}: The propositional fragment", booktitle = "Post-proceedings of TYPES 2003 Workshop", series = lncs, number = "3085", publisher = "Springer", year = "2003", pages = "355--377", doi = "10.1007/978-3-540-24849-1\_23", } @InProceedings{watkins04lfm, author = "Kevin Watkins and Iliano Cervesato and Frank Pfenning and David Walker", title = "Specifying Properties of Concurrent Computations in {CLF}", booktitle = "Workshop on Logical Frameworks and Meta-Logics", year = "2004", address = "Cork, Ireland", month = jul, doi = "10.1016/j.entcs.2007.11.013", } @Article{webber83, author = "Bonnie Webber and Aravind Joshi and Eric Mays and Kathleen McKeown", title = "Extended Natural Language Data Base Interactions", journal = "Computers and Mathematics with Applications", volume = "9", year = "1983", pages = "233--244", } @InCollection{wetzler14sat, author = "Nathan Wetzler and Marijn J. H. Heule and Jr. Warren A. Hunt", title = "{DRAT}-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs", year = "2014", booktitle = "Theory and Applications of Satisfiability Testing - SAT 2014", volume = "8561", series = lncs, editor = "Carsten Sinz and Uwe Egly", doi = "10.1007/978-3-319-09284-3\_31", publisher = "Springer", pages = "422--429", } @InCollection{weyhrauch81, author = "Richard Weyhrauch", title = "Prolegomena to a Theory of Mechanized Formal Reasoning", booktitle = "Readings in Artifical Intelligence", chapter = "2", pages = "173--191", editor = "Bonnie Webber and Nils Nilsson", publisher = "Tioga", address = "Palo Alto", year = "1981", } @PhdThesis{whalen05phd, title = "Trustworthy translation for the requirements state machine language without events", author = "Michael William Whalen", school = "University of Minnesota", year = "2005", } @Article{wiedijk07lgr, title = "The {QED} manifesto revisited", author = "Freek Wiedijk", journal = "Studies in Logic, Grammar and Rhetoric", volume = "10", number = "23", pages = "121--133", year = "2007", } @Article{wielemaker12tplp, title = "{SWI}-{Prolog}", author = "Jan Wielemaker and Tom Schrijvers and Markus Triska and Torbj{\"o}rn Lager", journal = "Theory Pract. Log. Program", year = "2012", number = "1-2", volume = "12", pages = "67--96", } @Book{wikstrom87, author = "{\AA}ke Wikstr{\"o}m", title = "Functional Programming Using Standard {ML}", publisher = "Prentice Hall", year = "1987", } @InProceedings{wilson10coq, title = "Inductive Proof Automation for {Coq}", author = "Sean Wilson and Jacques Fleuriot and Alan Smaill", year = "2010", booktitle = "Second Coq Workshop", URL = "https://hal.archives-ouvertes.fr/inria-00489496/en/", } @InProceedings{winikoff95ilps, author = "M. Winikoff and J. Harland", title = "{Implementing the Linear Logic Programming Language Lygon}", booktitle = "Proceedings of the {International Logic Programming Symposium}", pages = "66--80", year = "1995", month = dec, } @Article{winskel84, author = "G. Winskel", title = "Synchronization Trees", journal = tcs, volume = "34", year = "1984", pages = "33--82", } @Article{wirth04igpl, author = "Claus-Peter Wirth", title = "Descente Infinie + {D}eduction", journal = "Logic Journal of the IGPL", year = "2004", pages = "1--96", volume = "12", number = "1", publisher = "Oxford University Press", } @Article{wirth08jal, author = "Claus-Peter Wirth", title = "Hilbert's epsilon as an operator of indefinite committed choice", journal = "J. Applied Logic", volume = "6", number = "3", year = "2008", pages = "287--317", doi = "10.1016/j.jal.2007.07.009", } @InProceedings{wisniewski14jarwd, keywords = "LEO Prover, Automated Reasoning, Proof Transformation, Higher Order Logic", author = "Max Wisniewski and Alexander Steen and Christoph Benzm{\"u}ller", title = "The {Leo-III} Project", booktitle = "Joint Automated Reasoning Workshop and Deduktionstreffen", editor = "Alexander Bolotov and Manfred Kerber", pages = "38", year = "2014", URL = "https://christoph-benzmueller.de/papers/W53.pdf", } @Book{wittgenstein22tractatus, author = "Ludwig Wittgenstein", title = "Tractatus Logico-Philosophicus", publisher = "Routledge", year = "1922", note = "Translated by D.~E.~Pears and B.~F.~McGuinness", } @TechReport{wolfram87a, author = "David A. Wolfram", title = "Reducing Thrashing By Adaptive Backtracking", institution = "University of Cambridge", month = aug, year = "1987", } @Unpublished{wolfram87b, author = "David A. Wolfram", title = "Intractable Unifiability Problems and Backtracking", month = aug, year = "1987", note = "To appear", } @Book{wolfram93cup, author = "David Wolfram", title = "The clausal theory of types", publisher = "Cambridge University Press", year = "1993", } @Article{wolfram94tcs, author = "David A. Wolfram", title = "A semantics for $\lambda$-{PROLOG}", journal = "Theoretical Computer Science", year = "1994", volume = "136", number = "1", } @Article{wolfram95tcs, author = "D. A. Wolfram", title = "A semantics for $\lambda${P}rolog", journal = "Theoretical Computer Science", volume = "136", number = "1", pages = "277--289", year = "1995", } @Book{woltenlogel17eps, title = "Towards an Encyclopaedia of Proof Systems", editor = "Bruno Woltzenlogel Paleo", publisher = "College Publications", address = "London, UK", URL = "https://github.com/ProofSystem/Encyclopedia/blob/master/main.pdf", year = "2017", month = jan, edition = "1", ISBN = "978-1-84890-233-6", } @Book{wos84, author = "Larry Wos and Ross Overbeek and Ewing Lusk and Jim Boyle", title = "Automated Reasoning: Introduction and Applications", publisher = "Prentice-Hall", year = "1984", } @Article{wos91jlp, author = "Larry Wos and William McCune", title = "Automated Theorem Proving and Logic Programming: {A} Natural Symbiosis", journal = "Journal of Logic Programming", year = "1991", volume = "11", pages = "1--53", } @Article{wright94ic, author = "Andrew K. Wright and Matthias Felleisen", title = "A syntactic approach to type soundness", journal = "Information and Computation", volume = "115", number = "1", year = "1994", pages = "38--94", doi = "10.1006/inco.1994.1093", publisher = "Academic Press, Inc.", address = "Duluth, MN, USA", } @InProceedings{wu03ppdp, author = "Dinghao Wu and Andrew W. Appel and Aaron Stump", title = "Foundational proof checkers with small witnesses", pages = "264--274", booktitle = "PPDP '03: Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming", year = "2003", location = "Uppsala, Sweden", editor = "Dale Miller", publisher = "ACM", address = "New York, NY, USA", } @Unpublished{xi05atslf, title = "{ATS}/{LF}: {A} type system for constructing proofs as total functional programs", author = "Hongwei Xi", year = "2005", note = "https://www.ats-lang.org/PAPER/ATSLF-PAfestschrift.pdf", } @Article{xue08entcs, author = "Tao Xue and Qichao Xuan", title = "Proof Search and Counter Model of Positive Minimal Predicate Logic", journal = entcs, volume = "212", pages = "87--102", year = "2008", doi = "10.1016/j.entcs.2008.04.055", } @Article{yamaguchi96ijtp, author = "Fumihiko Yamaguchi and Masakazu Nakanishi", title = "Induction in linear logic", journal = "International Journal of Theoretical Physics", year = "1996", volume = "35", number = "10", pages = "2107--2116", month = oct, } @InProceedings{yang03vmcai, author = "Ping Yang and C. R. Ramakrishnan and Scott A. Smolka", title = "A Logical Encoding of the pi-Calculus: Model Checking Mobile Processes Using Tabled Resolution", booktitle = "4th International Conference on Verification, Model Checking, and Abstract Interpretation", year = "2003", pages = "116--131", publisher = "Springer", series = "Lecture Notes in Computer Science", volume = "2575", year = "2003", } @Article{yang04ijsttt, author = "Ping Yang and C. R. Ramakrishnan and Scott A. Smolka", title = "A logical encoding of the pi-calculus: model checking mobile processes using tabled resolution", journal = "International Journal on Software Tools for Technology Transfer", volume = "6", number = "1", year = "2004", pages = "38--66", } @InProceedings{yang05padl, title = "A Provably Correct Compiler for Efficient Model Checking of Mobile Processes", author = "Ping Yang and Yifei Dong and C. R. Ramakrishnan and Scott A. Smolka", booktitle = "Practical Aspects of Declarative Languages, 7th International Symposium, {PADL} 2005, Long Beach, {CA}", publisher = "Springer", month = jan, year = "2005", volume = "3350", editor = "Manuel V. Hermenegildo and Daniel Cabeza", pages = "113--127", series = "Lecture Notes in Computer Science", } @Article{yetter90jsl, author = "D. N. Yetter", title = "Quantales and (noncommutative) linear logic", journal = jsl, year = "1990", volume = "55", number = "1", pages = "41--64", } @InCollection{zamov71scmml, author = "N. K. Zamov and V. I. Sharonov", title = "On a Class of Strategies for the Resolution Method", booktitle = "Studies in Constructive Mathematics and Mathematical Logic, Part III", publisher = "Consultants Bureau, New York", year = "1971", editor = "A. O. Slisenko", number = "16", series = "Seminars in Mathematics, V.A. Steklov Mathematical Institute, Leningrad", pages = "26--31", note = "Translated from Russian by J. S. Wood", } @Article{zeilberger08apal, author = "Noam Zeilberger", title = "On the unity of duality", journal = apal, volume = "153", number = "1", year = "2008", doi = "10.1016/j.apal.2008.01.001", note = "Special issue on classical logic and computation.", } % URL = "https://www.pps.jussieu.fr/~noam/papers/unity-duality.pdf", @InProceedings{zeilberger08popl, title = "Focusing and higher-order abstract syntax", author = "Noam Zeilberger", booktitle = "Proceedings of the 35th {ACM} {SIGPLAN}-{SIGACT} Symposium on Principles of Programming Languages, {POPL} 2008, San Francisco, California, {USA}, January 7-12, 2008", publisher = "ACM", year = "2008", editor = "George C. Necula and Philip Wadler", pages = "359--369", doi = "10.1145/1328897.1328482", } % URL = "https://dl.acm.org/citation.cfm?id=1328438", @PhdThesis{zeilberger09phd, author = "Noam Zeilberger", title = "The Logical Basis of Evaluation Order and Pattern-Matching", school = "Carnegie Mellon University", year = "2009", month = apr, note = "Published as techreport CMU-CS-09-122.", } @InProceedings{zeilberger10lics, author = "Noam Zeilberger", title = "Polarity and the logic of delimited continuations", booktitle = "Symposium on Logic in Computer Science", pages = "219--227", year = "2010", organization = "IEEE", } @Article{zeilberger16jfp, title = "{Linear lambda terms as invariants of rooted trivalent maps}", author = "Noam Zeilberger", URL = "https://hal.archives-ouvertes.fr/hal-01247757", journal = "{Journal of Functional Programming}", publisher = "{Cambridge University Press (CUP)}", volume = "26", year = "2016", month = Nov, doi = "10.1017/S095679681600023X", hal_id = "hal-01247757", hal_version = "v1", } @InProceedings{zhao18itp, author = "Jinxu Zhao and Bruno C. d. S. Oliveira and Tom Schrijvers", title = "Formalization of a Polymorphic Subtyping Algorithm", booktitle = "International Conference on Interactive Theorem Proving (ITP 2018)", year = "2018", number = "10895", series = lncs, pages = "604--622", doi = "10.1007/978-3-319-94821-8_36", } @InProceedings{zhao19icfp, author = "Jinxu Zhao and Bruno C. d. S. Oliveira and Tom Schrijvers", title = "A mechanical formalization of higher-ranked polymorphic type inference", booktitle = "Proceedings of the {ACM} on Programming Languages", year = "2019", volume = "3", number = "112", series = "ICFP", pages = "1--29", month = jul, doi = "10.1145/3341716", } @PhdThesis{zhao21phd, author = "Jinxu Zhao", title = "Formalized Higher-Ranked Polymorphic Type Inference Algorithms", school = "University of Hong Kong", year = "2021", month = jul, URL = "https://i.cs.hku.hk/~bruno/thesis/JinxuZhao.pdf", } @TechReport{ziegler04stage, author = "Axelle Ziegler", title = "Un format pour que la bisimulation soit une congruence dans les langages de processus avec mobilit\'{e}", year = "2004", institution = "INRIA Futurs, LIX and ENS", pdf = "https://www.lix.polytechnique.fr/parsifal/ziegler04stage.pdf", } @InProceedings{ziegler05sos, author = "Axelle Ziegler and Dale Miller and Catuscia Palamidessi", title = "A congruence format for name-passing calculi", booktitle = "Structural Operational Semantics (SOS'05)", month = jul, year = "2005", pages = "169--189", series = entcs, address = "Lisbon, Portugal", publisher = "Elsevier Science B.V.", pdf = "https://www.lix.polytechnique.fr/parsifal/ziegler05report.pdf", } @InProceedings{ziliani15icfp, title = "A unification algorithm for Coq featuring universe polymorphism and overloading", author = "Beta Ziliani and Matthieu Sozeau", booktitle = "Proceedings of the 20th {ACM} {SIGPLAN} International Conference on Functional Programming, {ICFP} 2015, Vancouver, {BC}, Canada, September 1-3, 2015", publisher = "ACM", year = "2015", editor = "Kathleen Fisher and John H. Reppy", pages = "179--191", doi = "10.1145/2784731.2784751", } @PhdThesis{ziliani15phd, title = "Interactive typed tactic programming in the Coq proof assistant", author = "Beta Ziliani", year = "2015", school = "Saarland University", URL = "https://scidok.sulb.uni-saarland.de/volltexte/2015/6041/", } @Article{zucker74, author = "J. I. Zucker", title = "Cut-elimination and Normalization", journal = "Annals of Mathematical Logic", volume = "1", number = "1", year = "1974", pages = "1--112", }