ML, visibly pushdown class memory automata, and extended branching vector addition systems with states
We prove that the observational equivalence problem for a finitary fragment of the programming langauge ML is recursively equivalent to the reachability problem for extended branching vector addition systems with states (EBVASS). This result has two natural and independent parts. We first prove that...
| Hlavní autoři: | , , |
|---|---|
| Médium: | Journal article |
| Vydáno: |
Association for Computing Machinery
2019
|