Useless-code detection and elimination for PCF with algebraic data types

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1581, Issue , 1999, Pages 83-97

  Damiani, Ferruccio ^a  

^a UNIVERSITY OF TURIN   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; BIOMINERALIZATION; PATHOLOGY; RECURSIVE FUNCTIONS;

ALGEBRAIC DATA-TYPES; CALL-BY-NAME; CODE DETECTION; FUNCTIONAL PROGRAMS; MINIMUM INFORMATION; STANDARD TYPE;

CODES (SYMBOLS);

EID: 0347255991     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48959-2_8     Document Type: Conference Paper

References (16)

1. S. Berardi. Pruning Simply Typed Lambda Terms. Journal of Logic and Computation, 6 (5):663-681, 1996.
2. S. Berardi and L. Boerio. Using Subtyping in Program Optimization. In TLCA '95, LNCS 902. Springer-Verlag, 1995.
3. S. Berardi and L. Boerio. Minimum Information Code in a Pure Functional Language with Data Types. In TLCA’97, LNCS 1210. Springer-Verlag, 1997.
4. S. K. Biswas. A Demand-Driven Set-Based Analysis. In POPL’97, pages 372-385. ACM, 1997.
5. L. Boerio. Optimizing Programs Extracted from Proofs. PhD thesis, Università di Torino, 1995.
6. M. Coppo, F. Damiani, and P. Giannini. Refinement Types for Program Analysis. In SAS’96, LNCS 1145, pages 143-158. Springer-Verlag, 1996.
7. F. Damiani. Non-standard type inference for functional programs. PhD thesis, Università di Torino, February 1998.
8. F. Damiani and F. Prost. Detecting and Removing Dead Code using Rank 2 Intersection. In TYPES’96, LNCS 1512. Springer-Verlag, 1998.
9. B. Barras, et al. The Coq Proof Assistant Reference Manual Version 6.2. INRIA-Rocquencourt-CNRS-ENS Lyon, may 1998.
10. A. D. Gordon. Bisimilarity as a Theory of Functional Programs. Mini-Course. Technical Report NS-95-3 BRICS Notes Series, Computer Science Department of Aarhus University, 1995.
11. G. Kahn. Natural semantics. In K. Fuchi and M. Nivat, editors, Programming Of Future Generation Computer. Elsevier Sciences B.V. (North-Holland), 1988.
12. ω‘s Programs from Proofs in the Calculus of Constructions. In POPL’89. ACM, 1989.
13. A. M. Pitts. Operationally-based theories of program equivalence. In A. M. Pitts and P. Dybjer, editors, Semantics and Logics of Computation, pages 241-298. Cambridge University Press, 1997.
14. G. D. Plotkin. LCF considered as a programming language. Theoretical Computer Science, 5 (3):223-255, 1977.
15. G. D. Plotkin. A structural approach to operational semantics. Technical Report DAIMI FN-19, Aarhus University, 1981.
16. Y. Takayama. Extraction of Redundancy-free Programs from Constructive Natural Deduction Proofs. Journal of Symbolic Computation, 12:29-69, 1991.