Simple General Recursion in Type Theory (2000)
| Venue: | Nordic Journal of Computing |
| Citations: | 8 - 2 self |
BibTeX
@ARTICLE{Bove00simplegeneral,
author = {Ana Bove},
title = {Simple General Recursion in Type Theory},
journal = {Nordic Journal of Computing},
year = {2000},
volume = {8},
pages = {2001}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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 recursive algorithms often produces unnecessarily long and complicated codes. On the other hand, functional programming languages like Haskell impose no restrictions on recursive programs, and then writing general recursive algorithms is straightforward. In addition, functional programs are usually short and self-explanatory. However, the existing frameworks for reasoning about the correctness of Haskell-like programs are weaker than the framework provided by type theory. The goal of this work is to present a method that combines the advantages of both programming styles when writing simple general recursive algorithms....
