Papers in 2016

[1] Beniamino Accattoli and Ugo Dal Lago. (Leftmost-outermost) beta reduction is invariant, indeed. Logical Methods in Computer Science, 2016. [ bib | DOI | http | .pdf ]
[2] Roberto Blanco, Tomer Libal, and Dale Miller. Defining the meaning of TPTP formatted proofs. In Boris Konev, Stephan Schulz, and Laurent Simon, editors, IWIL-2015. 11th International Workshop on the Implementation of Logics, volume 40 of EPiC Series in Computing, pages 78--90. EasyChair, 2016. [ bib | .html ]
[3] Taus Brock-Nannestad and Danko Ilik. An Intuitionistic Formula Hierarchy Based on High-School Identities. working paper or preprint, August 2016. [ bib | http | .pdf ]
[4] Kaustuv Chaudhuri, Stefan Hetzl, and Dale Miller. A multi-focused proof system isomorphic to expansion proofs. J. of Logic and Computation, 26(2):577--603, 2016. [ bib | DOI | http | .pdf ]
[5] Kaustuv Chaudhuri, Sonia Marin, and Lutz Straßburger. Focused and synthetic nested sequents. In Bart Jacobs and Christof Löding, editors, Proceedings of the 19th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS), volume 9634 of LNCS, April 2016. [ bib | DOI | .pdf ]
[6] Kaustuv Chaudhuri, Sonia Marin, and Lutz Straßburger. Focused and Synthetic Nested Sequents (Extended Technical Report). Research report, Inria, April 2016. [ bib | http | .pdf ]
[7] Kaustuv Chaudhuri, Sonia Marin, and Lutz Straßburger. Modular Focused Proof Systems for Intuitionistic Modal Logics. In FSCD 2016 - 1st International Conference on Formal Structures for Computation and Deduction, Porto, Portugal, June 2016. [ bib | DOI | http ]
[8] Zakaria Chihani, Danko Ilik, and Dale Miller. Classical polarizations yield double-negation translations. Technical report, Inria Saclay, August 2016. [ bib | http | .pdf ]
[9] Zakaria Chihani and Dale Miller. Proof certificates for equality reasoning. In Mario Benevides and René Thiemann, editors, Post-proceedings of LSFA 2015: 10th Workshop on Logical and Semantic Frameworks, with Applications. Natal, Brazil., number 323 in ENTCS, pages 93--108. Elsevier, 2016. [ bib | DOI ]
[10] Ivan Gazeau, Dale Miller, and Catuscia Palamidessi. Preserving differential privacy under finite-precision semantics. Theoretical Computer Science, 655:92--108, 2016. [ bib | DOI ]
[11] Willem Heijltjes and Lutz Straßburger. Proof nets and semi-star-autonomous categories. Mathematical Structures in Computer Science, 26(5):789--828, June 2016. [ bib | DOI | http ]
[12] Danko Ilik. On the exp-log normal form of types. working paper or preprint, August 2016. [ bib | http | .pdf ]
[13] Danko Ilik. Perspectives for proof unwinding by programming languages techniques. working paper or preprint, August 2016. [ bib | http | .pdf ]
[14] Tomer Libal and Dale Miller. Functions-as-constructors higher-order unification. In D. Kesner and B. Pientka, editors, 1st International Conference on Formal Structures for Computation and Deduction (FSCD 2016), page 26:1–26:17, 2016. [ bib | DOI | .pdf ]
[15] Tomer Libal and Marco Volpe. Certification of Prefixed Tableau Proofs for Modal Logic. In the Seventh International Symposium on Games, Automata, Logics and Formal Verification (GandALF 2016), number 226 in EPTCS, pages 257--271, Catania, Italy, September 2016. [ bib | DOI | http | .pdf ]
[16] Sonia Marin, Dale Miller, and Marco Volpe. A focused framework for emulating modal proof systems. In Lev Beklemishev, Stéphane Demri, and András Máté, editors, 11th Conference on Advances in Modal Logic, number 11 in Advances in Modal Logic, pages 469--488, Budapest, Hungary, August 2016. College Publications. [ bib | http | .pdf ]
[17] Laurent Mehats and Lutz Straßburger. Non-crossing Tree Realizations of Ordered Degree Sequences. In Maxime Amblard, Philippe de Groote, Sylvain Pogodalla, and Christian Retoré, editors, LACL 2016 - 9th International Conference Logical Aspects of Computational Linguistics - Celebrating 20 Years of LACL (1996--2016), volume 10054 of LNCS - Lecture Notes in Computer Science, Nancy, France, December 2016. Springer. [ bib | DOI | http ]
[18] Paul-André Melliès and Noam Zeilberger. A bifibrational reconstruction of Lawvere's presheaf hyperdoctrine. In IEEE/ACM Logic in Computer Science (LICS) 2016, Proceedings of LICS'16, New York, United States, June 2016. [ bib | http ]
[19] Noam Zeilberger. Linear lambda terms as invariants of rooted trivalent maps. Journal of Functional Programming, 26, November 2016. [ bib | DOI | http ]

This file was generated by bibtex2html 1.98.