Abstract is missing.
- Formal Verification of the Correspondence Between Call-by-Need and Call-by-NameMasayuki Mizuno, Eijiro Sumii. 1-16 [doi]
- Direct Encodings of NP-Complete Problems into Horn Sequents of Multiplicative Linear LogicSatoshi Matsuoka. 17-32 [doi]
- \lambda λ to SKI, Semantically - Declarative PearlOleg Kiselyov. 33-50 [doi]
- Program Extraction for Mutable ArraysKazuhiko Sakaguchi. 51-67 [doi]
- Functional Pearl: Folding Polynomials of PolynomialsChen-Mou Cheng, Ruey-Lin Hsu, Shin-Cheng Mu. 68-83 [doi]
- A Functional Perspective on Machine Learning via Programmable Induction and AbductionSteven Cheung, Victor Darvariu, Dan R. Ghica, Koko Muroya, Reuben N. S. Rowe. 84-98 [doi]
- Polymorphic Rewrite Rules: Confluence, Type Inference, and Instance ValidationMakoto Hamana. 99-115 [doi]
- Confluence Modulo Equivalence with Invariants in Constraint Handling RulesDaniel Gall, Thom W. Frühwirth. 116-131 [doi]
- On Probabilistic Term RewritingMartin Avanzini, Ugo Dal Lago, Akihisa Yamada 0002. 132-148 [doi]
- Equivalence Checking of Non-deterministic OperationsSergio Antoy, Michael Hanus. 149-165 [doi]
- Optimizing Declarative Parallel Distributed Graph Processing by Using Constraint SolversAkimasa Morihata, Kento Emoto, Kiminori Matsuzaki, Zhenjiang Hu, Hideya Iwasaki. 166-181 [doi]
- Breaking Symmetries with Lex ImplicationsMichael Codish, Thorsten Ehlers, Graeme Gange, Avraham Itzhakov, Peter J. Stuckey. 182-197 [doi]
- Model Checking Parameterized by the Semantics in MaudeAdrián Riesco. 198-213 [doi]
- Automated Amortised Resource Analysis for Term Rewrite SystemsGeorg Moser, Manuel Schneckenreither. 214-229 [doi]
- A Common Framework Using Expected Types for Several Type Debugging ApproachesKanae Tsushima, Olaf Chitil. 230-246 [doi]
- CauDEr: A Causal-Consistent Reversible Debugger for ErlangIvan Lanese, Naoki Nishida 0001, Adrián Palacios, Germán Vidal. 247-263 [doi]
- Cheap Remarks About Concurrent ProgramsMichael Walker, Colin Runciman. 264-279 [doi]