LIPIcs, Volume 84, FSCD 2017

• Dale Miller LIPIcs, Volume 84, FSCD'17, Complete Volume 10.4230/LIPIcs.FSCD.2017
• Dale Miller Front Matter, Table of Contents, Preface, Steering Committee, Program Committee, External Reviewers 10.4230/LIPIcs.FSCD.2017.0
• Marco Gaboardi Type Systems for the Relational Verification of Higher Order Programs (Invited Talk) 10.4230/LIPIcs.FSCD.2017.1
• Georg Moser Uniform Resource Analysis by Rewriting: Strenghts and Weaknesses (Invited Talk) 10.4230/LIPIcs.FSCD.2017.2
• Alexandra Silva Brzozowski Goes Concurrent - A Kleene Theorem for Pomset Languages (Invited Talk) 10.4230/LIPIcs.FSCD.2017.3
• Christine Tasson Quantitative Semantics for Probabilistic Programming (Invited Talk) 10.4230/LIPIcs.FSCD.2017.4
• Benedikt Ahrens and Peter LeFanu Lumsdaine Displayed Categories 10.4230/LIPIcs.FSCD.2017.5
• Yohji Akama The Confluent Terminating Context-Free Substitutive Rewriting System for the lambda-Calculus with Surjective Pairing and Terminal Type 10.4230/LIPIcs.FSCD.2017.6
• Takahito Aoto, Yoshihito Toyama, and Yuta Kimura Improving Rewriting Induction Approach for Proving Ground Confluence 10.4230/LIPIcs.FSCD.2017.7
• Patrick Bahr Böhm Reduction in Infinitary Term Graph Rewriting Systems 10.4230/LIPIcs.FSCD.2017.8
• Pablo Barenbaum and Eduardo Bonelli Optimality and the Linear Substitution Calculus 10.4230/LIPIcs.FSCD.2017.9
• Malgorzata Biernacka, Witold Charatonik, and Klara Zielinska Generalized Refocusing: From Hybrid Strategies to Abstract Machines 10.4230/LIPIcs.FSCD.2017.10
• Jasmin Christian Blanchette, Mathias Fleury, and Dmitriy Traytel Nested Multisets, Hereditary Multisets, and Syntactic Ordinals in Isabelle/HOL 10.4230/LIPIcs.FSCD.2017.11
• Simon Castellan, Pierre Clairambault, and Glynn Winskel Observably Deterministic Concurrent Strategies and Intensional Full Abstraction for Parallel-or 10.4230/LIPIcs.FSCD.2017.12
• J. Robin B. Cockett and Jean-Simon Lemay There Is Only One Notion of Differentiation 10.4230/LIPIcs.FSCD.2017.13
• Lukasz Czajka Confluence of an Extension of Combinatory Logic by Boolean Constants 10.4230/LIPIcs.FSCD.2017.14
• Andrej Dudenhefner and Jakob Rehof The Complexity of Principal Inhabitation 10.4230/LIPIcs.FSCD.2017.15
• Marcelo Fiore and Philip Saville List Objects with Algebraic Structure 10.4230/LIPIcs.FSCD.2017.16
• Stefano Guerrini and Marco Solieri Is the Optimal Implementation Inefficient? Elementarily Not 10.4230/LIPIcs.FSCD.2017.17
• Daniel Hillerström, Sam Lindley, Robert Atkey, and K. C. Sivaramakrishnan Continuation Passing Style for Effect Handlers 10.4230/LIPIcs.FSCD.2017.18
• Nao Hirokawa, Aart Middeldorp, Christian Sternagel, and Sarah Winkler Infinite Runs in Abstract Completion 10.4230/LIPIcs.FSCD.2017.19
• Benedetto Intrigila, Giulio Manzonetto, and Andrew Polonsky Refutation of Sallé's Longstanding Conjecture 10.4230/LIPIcs.FSCD.2017.20
• Jonas Kaiser, Brigitte Pientka, and Gert Smolka Relating System F and Lambda2: A Case Study in Coq, Abella and Beluga 10.4230/LIPIcs.FSCD.2017.21
• Max Kanovich, Stepan Kuznetsov, Glyn Morrill, and Andre Scedrov A Polynomial-Time Algorithm for the Lambek Calculus with Brackets of Bounded Order 10.4230/LIPIcs.FSCD.2017.22
• Akitoshi Kawamura and Florian Steinberg Polynomial Running Times for Polynomial-Time Oracle Machines 10.4230/LIPIcs.FSCD.2017.23
• Delia Kesner and Pierre Vial Types as Resources for Classical Natural Deduction 10.4230/LIPIcs.FSCD.2017.24
• Daniel R. Licata, Michael Shulman, and Mitchell Riley A Fibrational Framework for Substructural and Modal Logics 10.4230/LIPIcs.FSCD.2017.25
• Benjamin Lichtman and Jan Hoffmann Arrays and References in Resource Aware ML 10.4230/LIPIcs.FSCD.2017.26
• Tadeusz Litak, Miriam Polzer, and Ulrich Rabenstein Negative Translations and Normal Modality 10.4230/LIPIcs.FSCD.2017.27
• Ian Orton and Andrew M. Pitts Models of Type Theory Based on Moore Paths 10.4230/LIPIcs.FSCD.2017.28
• Paolo Pistone On Dinaturality, Typability and beta-eta-Stable Models 10.4230/LIPIcs.FSCD.2017.29
• Pierre Pradic and Colin Riba A Curry-Howard Approach to Church's Synthesis 10.4230/LIPIcs.FSCD.2017.30
• Lutz Straßburger Combinatorial Flows and Their Normalisation 10.4230/LIPIcs.FSCD.2017.31
• Ryota Suzuki, Koichi Fujima, Naoki Kobayashi, and Takeshi Tsukada Streett Automata Model Checking of Higher-Order Recursion Schemes 10.4230/LIPIcs.FSCD.2017.32
• Noam Zeilberger A Sequent Calculus for a Semi-Associative Law 10.4230/LIPIcs.FSCD.2017.33