Data di Pubblicazione:
1997
Abstract:
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.
Tipologia CRIS:
1.1 Articolo su Rivista
Elenco autori:
Mazzanti, Stefano
Link alla scheda completa:
Pubblicato in: