FSCD 2018 Accepted Papers

#	Authors	Title
2	Łukasz Czajka	Term rewriting characterisation of LOGSPACE for finite and infinite data
4	Thomas Genet	Completeness of Tree Automata Completion
6	Paweł Parys	Homogeneity without Loss of Generality
9	Maciej Bendkowski and Pierre Lescanne	Counting Environments and Closures
11	Andriana Rivelo Nirina and Pierre Rety	Confluence of Prefix-Constrained Rewrite Systems
12	Christina Kohl and Aart Middeldorp	ProTeM: A Proof Term Manipulator
15	Sarah Winkler and Aart Middeldorp	Completion for Logically Constrained Rewriting
16	Manfred Schmidt-Schauss and David Sabel	Nominal Unification with Atom and Context Variables
19	Daniel R. Licata, Ian Orton, Andrew M. Pitts and Bas Spitters	Internal Universes in Models of Homotopy Type Theory
23	Jean-Simon Lemay	Lifting MELL Model Structure to Eilenberg-Moore Categories
25	Amar Hadzihasanovic, Giovanni de Felice and Kang Feng Ng	A diagrammatic axiomatisation of fermionic quantum circuits
29	Mirai Ikebuchi and Keisuke Nakano	On repetitive right application of B-terms
32	Lê Thành Dũng Nguyễn	Unique perfect matchings and proof nets
35	Simon Forest and Samuel Mimram	Coherence of Gray categories via rewriting
40	Patrick Bahr	Strict Ideal Completions of the Lambda Calculus
42	Rohan Jacob-Rao, Brigitte Pientka and David Thibodeau	Index-Stratified Types
43	Amin Timany and Matthieu Sozeau	Cumulative Inductive Types in Coq
44	Bassel Mannaa and Rasmus Møgelberg	The clocks they are adjunctions. Denotational semantics for Clocked Type Theory
45	Willem Heijltjes and Gianluigi Bellin	Proof nets for bi-intuitionistic linear logic
50	Max New and Daniel Licata	Call-by-name Gradual Type Theory
57	David Cerna and Temur Kutsia	Higher-Order Equational Pattern Anti-Unification
58	Sandra Alves and Sabine Broda	A Unifying Framework for Type Inhabitation
59	Mauricio Ayala-Rincon, Maribel Fernandez and Daniele Nantes-Sobrinho	Fixed-Point Constraints for Nominal Equational Unification
63	Joerg Endrullis, Jan Willem Klop and Roy Overbeek	Decreasing diagrams with two labels are complete for confluence of countable systems
67	Ambrus Kaposi and András Kovács	A Syntax for Higher Inductive-Inductive Types
70	Naoki Nishida and Yuya Maeda	Narrowing Trees for Syntactically Deterministic Conditional Term Rewriting Systems
72	Alexander Baumgartner, Temur Kutsia, Jordi Levy and Mateu Villaret	Term-Graph Anti-Unification

---