LIPIcs, Volume 108, FSCD 2018

• Hélène Kirchner LIPIcs, Volume 108, FSCD'18, Complete Volume 10.4230/LIPIcs.FSCD.2018
• Hélène Kirchner Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.FSCD.2018.0
• Stéphanie Delaune Analysing Privacy-Type Properties in Cryptographic Protocols (Invited Talk) 10.4230/LIPIcs.FSCD.2018.1
• Grigore Rosu Formal Design, Implementation and Verification of Blockchain Languages (Invited Talk) 10.4230/LIPIcs.FSCD.2018.2
• Peter Selinger Challenges in Quantum Programming Languages (Invited Talk) 10.4230/LIPIcs.FSCD.2018.3
• Valeria Vignudelli Proof Techniques for Program Equivalence in Probabilistic Higher-Order Languages (Invited Talk) 10.4230/LIPIcs.FSCD.2018.4
• Sandra Alves and Sabine Broda A Unifying Framework for Type Inhabitation 10.4230/LIPIcs.FSCD.2018.5
• Nirina Andrianarivelo and Pierre Réty Confluence of Prefix-Constrained Rewrite Systems 10.4230/LIPIcs.FSCD.2018.6
• Mauricio Ayala-Rincón, Maribel Fernández, and Daniele Nantes-Sobrinho Fixed-Point Constraints for Nominal Equational Unification 10.4230/LIPIcs.FSCD.2018.7
• Patrick Bahr Strict Ideal Completions of the Lambda Calculus 10.4230/LIPIcs.FSCD.2018.8
• Alexander Baumgartner, Temur Kutsia, Jordi Levy, and Mateu Villaret Term-Graph Anti-Unification 10.4230/LIPIcs.FSCD.2018.9
• Gianluigi Bellin and Willem B. Heijltjes Proof Nets for Bi-Intuitionistic Linear Logic 10.4230/LIPIcs.FSCD.2018.10
• Maciej Bendkowski and Pierre Lescanne Counting Environments and Closures 10.4230/LIPIcs.FSCD.2018.11
• David M. Cerna and Temur Kutsia Higher-Order Equational Pattern Anti-Unification 10.4230/LIPIcs.FSCD.2018.12
• Lukasz Czajka Term Rewriting Characterisation of LOGSPACE for Finite and Infinite Data 10.4230/LIPIcs.FSCD.2018.13
• Jörg Endrullis, Jan Willem Klop, and Roy Overbeek Decreasing Diagrams with Two Labels Are Complete for Confluence of Countable Systems 10.4230/LIPIcs.FSCD.2018.14
• Simon Forest and Samuel Mimram Coherence of Gray Categories via Rewriting 10.4230/LIPIcs.FSCD.2018.15
• Thomas Genet Completeness of Tree Automata Completion 10.4230/LIPIcs.FSCD.2018.16
• Amar Hadzihasanovic, Giovanni de Felice, and Kang Feng Ng A Diagrammatic Axiomatisation of Fermionic Quantum Circuits 10.4230/LIPIcs.FSCD.2018.17
• Mirai Ikebuchi and Keisuke Nakano On Repetitive Right Application of B-Terms 10.4230/LIPIcs.FSCD.2018.18
• Rohan Jacob-Rao, Brigitte Pientka, and David Thibodeau Index-Stratified Types 10.4230/LIPIcs.FSCD.2018.19
• Ambrus Kaposi and András Kovács A Syntax for Higher Inductive-Inductive Types 10.4230/LIPIcs.FSCD.2018.20
• Jean-Simon Pacaud Lemay Lifting Coalgebra Modalities and IMELL Model Structure to Eilenberg-Moore Categories 10.4230/LIPIcs.FSCD.2018.21
• Daniel R. Licata, Ian Orton, Andrew M. Pitts, and Bas Spitters Internal Universes in Models of Homotopy Type Theory 10.4230/LIPIcs.FSCD.2018.22
• Bassel Mannaa and Rasmus Ejlers Møgelberg The Clocks They Are Adjunctions Denotational Semantics for Clocked Type Theory 10.4230/LIPIcs.FSCD.2018.23
• Max S. New and Daniel R. Licata Call-by-Name Gradual Type Theory 10.4230/LIPIcs.FSCD.2018.24
• Lê Thành Dung Nguyen Unique perfect matchings and proof nets 10.4230/LIPIcs.FSCD.2018.25
• Naoki Nishida and Yuya Maeda Narrowing Trees for Syntactically Deterministic Conditional Term Rewriting Systems 10.4230/LIPIcs.FSCD.2018.26
• Pawel Parys Homogeneity Without Loss of Generality 10.4230/LIPIcs.FSCD.2018.27
• Manfred Schmidt-Schauß and David Sabel Nominal Unification with Atom and Context Variables 10.4230/LIPIcs.FSCD.2018.28
• Amin Timany and Matthieu Sozeau Cumulative Inductive Types In Coq 10.4230/LIPIcs.FSCD.2018.29
• Sarah Winkler and Aart Middeldorp Completion for Logically Constrained Rewriting 10.4230/LIPIcs.FSCD.2018.30
• Christina Kohl and Aart Middeldorp ProTeM: A Proof Term Manipulator (System Description) 10.4230/LIPIcs.FSCD.2018.31
• Takahito Aoto, Makoto Hamana, Nao Hirokawa, Aart Middeldorp, Julian Nagele, Naoki Nishida, Kiraku Shintani, and Harald Zankl Confluence Competition 2018 10.4230/LIPIcs.FSCD.2018.32