FLOPS 2018 Accepted Papers

Adrian Riesco. Model checking parameterized by the semantics in Maude
Daniel Gall and Thom Fruehwirth. Confluence Modulo Equivalence with Invariants in Constraint Handling Rules
Akimasa Morihata, Kento Emoto, Kiminori Matsuzaki, Zhenjiang Hu and Hideya Iwasaki. Optimizing Declarative Parallel distributed Graph Processing by using Constraint Solvers
Oleg Kiselyov. lambda to SKI, Semantically: Declarative Pearl
Chen-Mou Cheng, Ruey-Lin Hsu and Shin-Cheng Mu. Functional Pearl: Folding Polynomials of Polynomials
Masayuki Mizuno and Eijiro Sumii. Formal Verification of the Correspondence between Call-by-Need and Call-by-Name
Georg Moser and Manuel Schneckenreither. Automated Amortised Resource Analysis for Term Rewrite Systems
Dan Ghica, Koko Muroya, Steven Cheung, Victor Darvariu and Reuben Rowe. A functional perspective on machine learning via programmable induction and abduction
Michael Walker and Colin Runciman. Cheap Remarks about Concurrent Programs
Kazuhiko Sakaguchi. Program Extraction for Mutable Arrays
Satoshi Matsuoka. Direct Encodings of NP-Complete Problems into Horn Sequents of Multiplicative Linear Logic
Ivan Lanese, Naoki Nishida, Adrian Palacios and German Vidal. CauDEr: A Causal-Consistent Reversible Debugger for Erlang [System Description]
Michael Codish, Thorsten Ehlers, Graeme Gange, Avi Itzhakov and Peter J. Stuckey. Breaking Symmetries with Lex Implications
Kanae Tsushima and Olaf Chitil. A Common Framework Using Expected Types for Several Type Debugging Approaches
Sergio Antoy and Michael Hanus. Equivalence Checking of Non-deterministic Operations
Martin Avanzini, Ugo Dal Lago and Akihisa Yamada. On Probabilistic Term Rewriting
Makoto Hamana. Polymorphic Computation Rules: Automated Confluence, Type Inference, and Instance Validation