6 citations · 9 across the 12 of their papers we have counts for
Showing 2025Show all
2 papers · 1 filter
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…
cs.FL2025
Efficient Matching of Some Fundamental Regular Expressions with Backreferences
Taisei Nogami, Tachio Terauchi
Regular expression matching is of practical importance due to its widespread use in real-world applications. In practical use, regular expressions are often used with real-world ex…