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.
Type-based useless-code elimination for functional programs - Position paper
BERARDI, Stefano;DAMIANI, Ferruccio;COPPO, Mario;
2000-01-01
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.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
LNCS-saig-2000.pdf
Accesso riservato
Descrizione: Articolo principale (workshop)
Tipo di file:
PDF EDITORIALE
Dimensione
254.08 kB
Formato
Adobe PDF
|
254.08 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
