collaborators

1 paper

cs.LO2025

Reachability is Decidable for ATM-Typable Finitary PCF with Effect Handlers

Ryunosuke Endo, Tachio Terauchi

It is well known that the reachability problem for simply-typed lambda calculus with recursive definitions and finite base-type values (finitary PCF) is decidable. A recent paper b…