Simple General Recursion in Type Theory

  title={Simple General Recursion in Type Theory},
  author={Ana Bove},
  journal={Nord. J. Comput.},
  • Ana Bove
  • Published 2001 in Nord. J. Comput.
General recursive algorithms are such that the recursive calls are performed on arguments satisfying no condition that guarantees termination. Hence, there is no direct way of formalising them in type theory. The standard way of handling general recursion in type theory uses a well-founded recursion principle. Unfortunately, this way of formalising general… CONTINUE READING