Primitive computable unary functions are useful patterns for the definition of for-do programs and are characterized as the closure of four simple unary functions with respect to composition and primitive iteration.
Succinct iterative characterizations of primitive computable unary functions
MAZZANTI, STEFANO
1995-01-01
Abstract
Primitive computable unary functions are useful patterns for the definition of for-do programs and are characterized as the closure of four simple unary functions with respect to composition and primitive iteration.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.