We present a non-standard type assignment system and simplifications mappings for detecting and removing useless-code in simply typed functional programs with algebraic datatypes and recursive functions. We characterize two classes of useless-code: the dead-code , that is code that is never executed under the lazy-call-by-name evaluation, and the minimum-information-code , that is code that contributes to the computation only with a minimum amount of constant information.

Useless-Code Detection and Elimination for PCF with Algebraic Data Types

DAMIANI, Ferruccio
1999-01-01

Abstract

We present a non-standard type assignment system and simplifications mappings for detecting and removing useless-code in simply typed functional programs with algebraic datatypes and recursive functions. We characterize two classes of useless-code: the dead-code , that is code that is never executed under the lazy-call-by-name evaluation, and the minimum-information-code , that is code that contributes to the computation only with a minimum amount of constant information.
1999
4th International Conference on Typed Lambda Calculi and Applications, TLCA 1999
L’Aquila; Italy
7 April 1999 through 9 April 1999
Typed Lambda Calculi and Applications
Springer
1581
83
97
978-3-540-65763-7
978-3-540-48959-7
http://www.springerlink.com/content/l6j3t005bt56l6yt/
Ferruccio Damiani
File in questo prodotto:
File Dimensione Formato  
LNCS-tlca-1999.pdf

Accesso riservato

Descrizione: Articolo proncipale
Tipo di file: PDF EDITORIALE
Dimensione 449.65 kB
Formato Adobe PDF
449.65 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.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/2318/108585
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 7
  • ???jsp.display-item.citation.isi??? 4
social impact