On strictness and totality

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

Volumn 1281, Issue , 1997, Pages 138-164

  Coppo, Mario ^a   Damiani, Ferruccio ^a   Giannini, Paola ^a  

^a UNIVERSITY OF TURIN   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SOFTWARE; INFERENCE ENGINES; SEMANTICS;

EXTENDED VERSIONS; INCLUSION RELATION; INFERENCE ALGORITHM; SOUND AND COMPLETE; WEAK HEAD NORMAL FORMS;

STATIC ANALYSIS;

EID: 21744462879     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0014550     Document Type: Conference Paper

References (19)

1. S. Abramsky. Abstract interpretation, logical relations and Kan extensions. Journal of Logic and Computation, 1(1):5-39, 1990.
2. P. N. Benton. Strictness Analysis of Lazy Functional Programs. PhD thesis. University of Cambridge, Pembroke College, 1992.
3. G. L. Burn, C. Hankin, and S. Abramsky. Strictness Analysis for Higher-Order Functions. Science of Computer Programming, 7:249-278, 1986.
4. M. Coppo, F. Damiani, and P. Giannini. Refinement Types for Program Analysis. In SAS'96, LNCS 1145, pages 143-158. Springer, 1996.
5. M. Coppo and A. Ferrari. Type inference, abstract interpretation and strictness analysis. Theoretical Computer Science, 121:113-145, 1993.
6. D. Dussart and F. Henglein and C. Mossin. Polymorphic Recursion and Subtype Qualifications: Polymorphic Binding-Time Analysis in Polynomial Time. In SAS'95, LNCS 983, pages 118-135. Springer, 1995.
7. F. Damiani and P. Giannini. An Inference Algorithm for Strictness. In TLCA '91, LNCS 1210, pages 129-146. Springer, 1997.
8. C. Hankin and D. Le Metayer. Deriving algorithms for type inference systems: Applications to strictness analysis. In POPL '94, pages 202-212. ACM, 1994.
9. T. P. Jensen, Abstract Interpretation in Logical Form. PhD thesis, University of London, Imperial College, 1992.
10. G. Kahn. Natural semantics. In K. Fuchi and M. Nivat, editors, Programming Of Future Generation Computer, Elsevier Sciences B.V. (North-Holland), 1988.
11. T. M. Kuo and P. Mishra. Strictness analysis: a new perspective based on type inference. In Functional Programming Languages and Computer Architecture, pages 260-272. ACM, 1989.
12. A. Mycroft. The theory and practice of transforming call-by-need into call-by-value. In International Symposium on Programming, LNCS 83, pages 269-281. Springer, 1980.
13. A. Mycroft. Abstract Interpretation and Optimizing Transforming for Applicative programs. PhD thesis, University of Edinburgh, Scotland, 1981.
14. 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.
15. K. L. Solberg. Annotated Type Systems for Program Analysis. PhD thesis, Aarhus University, Denmark, 1995. Revised version.
16. K. L. Solberg. Strictness and Totality Analysis with Conjunction. In TAP-SOFT'95, LNCS 915, pages 501-515. Springer, 1995.
17. K. L. Solberg, H. R. Nielson, and F. Nielson. Strictness and Totality Analysis. Science of Computer Programming. To appear.
18. K. L. Solberg, H. R. Nielson, and F. Nielson. Strictness and Totality Analysis. In SAS'94, LNCS 864, pages 408-422. Springer, 1994.
19. D. A. Wright. Reduction Types and Intensionality in the Lambda-Calculus. PhD thesis, University of Tasmania, 1992.