Abstract is missing.
- Enhancing Expressivity of Checked Corecursive StreamsDavide Ancona, Pietro Barbieri, Elena Zucca. 1-18 [doi]
- Improving Type Error Reporting for Type ClassesSheng Chen, Md. Rabib Noor. 19-38 [doi]
- Asynchronous Unfold/Fold Transformation for Fixpoint LogicMahmudul Faisal Al Ameen, Naoki Kobayashi 0001, Ryosuke Sato. 39-56 [doi]
- Program Logic for Higher-Order Probabilistic Programs in Isabelle/HOLMichikazu Hirata, Yasuhiko Minamide, Tetsuya Sato. 57-74 [doi]
- Generating C - System DescriptionOleg Kiselyov. 75-93 [doi]
- Translation Certification for Smart ContractsJacco O. G. Krijnen, Manuel M. T. Chakravarty, Gabriele Keller, Wouter Swierstra. 94-111 [doi]
- Zipping Strategies and Attribute GrammarsJosé Nuno Macedo, Marcos Viera, João Saraiva. 112-132 [doi]
- Unified Program Generation and Verification: A Case Study on Number-Theoretic TransformMasahiro Masuda, Yukiyoshi Kameyama. 133-151 [doi]
- Scheduling Complexity of Interleaving SearchDmitry Rozplokhas, Dmitry Boulytchev. 152-170 [doi]
- Automated Generation of Control Concepts Annotation Rules Using Inductive Logic Programming - System DescriptionBasel Shbita, Abha Moitra. 171-185 [doi]
- A Functional Account of Probabilistic Programming with Possible Worlds - Declarative PearlBirthe van den Berg, Tom Schrijvers. 186-204 [doi]
- Explanations as Programs in Probabilistic Logic ProgrammingGermán Vidal. 205-223 [doi]
- FOLD-R++: A Scalable Toolset for Automated Inductive Learning of Default Theories from Mixed DataHuaduo Wang, Gopal Gupta. 224-242 [doi]
- A Lazy Desugaring System for Evaluating Programs with SugarsZiyi Yang, Yushuo Xiao, Zhichao Guan, Zhenjiang Hu. 243-261 [doi]
- On Transforming Cut- and Quantifier-Free Cyclic Proofs into Rewriting-Induction ProofsShujun Zhang, Naoki Nishida 0001. 262-281 [doi]