Functional Reachability
What is reachability in higher-order functional programs? We formulate reachability as a decision problem in the setting of the prototypical functional language PCF and show that even in the recursion-free fragment generated from a finite base type, several versions of the reachability problem are u...
| 主要な著者: | , , |
|---|---|
| フォーマット: | Conference item |
| 出版事項: |
2009
|