Iterative characterizations of computable unary functions: a general method
- Mazzanti, Stefano
Publication date
January 1997
DOI Publisher
Wiley ISSN
0942-5616 Citation count (estimate)
3Abstract
Iterative characterizations of computable unary functions are useful patterns for the definition of programming languages based on iterative constructs. The features of such a characterization depend on the pairing producing it: this paper offers an infinite class of pairings involving very nice features
Add to ORKG