In this paper we present a survey of the work on type-based useless-code elimination for higher-order functional programs. After some historical, remarks on the motivations and early approaches we give an informal but complete account of the techniques and results developed at the Computer Science Department of the University of Torino. In particular, we focus on the fact that, for each of the type-based techniques developed, there is an optimal program simplification.
Titolo: | Type-based useless-code elimination for functional programs - Position paper |
Autori Riconosciuti: | |
Autori: | Stefano Berardi; Ferruccio Damiani; Mario Coppo; Paola Giannini |
Data di pubblicazione: | 2000 |
Abstract: | In this paper we present a survey of the work on type-based useless-code elimination for higher-order functional programs. After some historical, remarks on the motivations and early approaches we give an informal but complete account of the techniques and results developed at the Computer Science Department of the University of Torino. In particular, we focus on the fact that, for each of the type-based techniques developed, there is an optimal program simplification. |
Editore: | Springer |
Titolo del libro: | Semantics, Applications, and Implementation of Program Generation, International Workshop SAIG 2000 |
Volume: | 1924 |
Pagina iniziale: | 172 |
Pagina finale: | 189 |
Nome del convegno: | Semantics, Applications, and Implementation of Program Generation, International Workshop SAIG 2000 |
Luogo del convegno: | Montreal, Canada |
Anno del convegno: | September 20, 2000 |
Digital Object Identifier (DOI): | 10.1007/3-540-45350-4_13 |
ISBN: | 3540410546 |
Appare nelle tipologie: | 04A-Conference paper in volume |
File in questo prodotto:
File | Descrizione | Tipologia | Licenza | |
---|---|---|---|---|
LNCS-saig-2000.pdf | Articolo principale (workshop) | PDF EDITORIALE | Utenti riconosciuti Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.