The present paper proposes first a generalization of closure theory and revisits Moore's theory in this framework. Afterwards closures of non cyclic functions are introduced and a method is given to transform cyclic into non cyclic functions. Eventually semantics of the while construct is found to be the closure of a function. Computability on inductive and non inductive data types is then studied with iterative means.

Partial closures and semantics of while: Towards an iteration-based theory of data types

MAZZANTI, STEFANO
1984-01-01

Abstract

The present paper proposes first a generalization of closure theory and revisits Moore's theory in this framework. Afterwards closures of non cyclic functions are introduced and a method is given to transform cyclic into non cyclic functions. Eventually semantics of the while construct is found to be the closure of a function. Computability on inductive and non inductive data types is then studied with iterative means.
1984
Börger, Egon, Oberschelp, Walter, Richter, Michael, Schinzel, Brigitta, Thomas, Wolfgang
Computation and Proof Theory
Inglese
1104
163
174
11
Internazionale
Springer Berlin / Heidelberg
http://dx.doi.org/10.1007/BFb0099485
none
2. Contributo in Volume::2.1 Contributo in Volume(Capitolo,Saggio)
G., Germano; Mazzanti, Stefano
268
info:eu-repo/semantics/bookPart
2
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.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11578/43182
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact