Functional Reachability

  title={Functional Reachability},
  author={C.-H. Luke Ong and Nikos Tzevelekos},
  journal={2009 24th Annual IEEE Symposium on Logic In Computer Science},
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 undecidable from order 4 onwards, and several other versions are reducible to each other. We characterise a version of the reachability problem in terms of a new class of tree automata introduced by… CONTINUE READING

Similar Papers

Loading similar papers…