| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Unboundedness for Recursion Schemes: A Simpler Type System | Barozzini, David et al. | 2022 |
| 2 | A Quasi-Polynomial Black-Box Algorithm for Fixed Point Evaluation | Arnold, André et al. | 2021 |
| 3 | Higher-Order Model Checking Step by Step | Parys, Paweł | 2021 |
| 4 | Cost Automata, Safe Schemes, and Downward Closures | Barozzini, David et al. | 2020 |
| 5 | Higher-Order Nonemptiness Step by Step | Parys, Paweł | 2020 |
| 6 | Parity Games: Another View on Lehtinen’s Algorithm | Parys, Paweł | 2020 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 6 |