An inference algorithm for strictness

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

Volumn 1210, Issue , 1997, Pages 129-146

  Damiani, Ferruccio ^a   Giannini, Paola ^a  

^a UNIVERSITY OF TURIN   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BIOMINERALIZATION; CALCULATIONS; COMPUTATIONAL LINGUISTICS; DIFFERENTIATION (CALCULUS); PATHOLOGY;

BINDING TIME; FUNCTIONAL PROGRAMS; INFERENCE ALGORITHM; PROGRAM PROPERTIES; SIMPLY TYPED LAMBDA CALCULUS; TYPE INFERENCES; TYPE STRUCTURES; TYPE VARIABLES;

INFERENCE ENGINES;

EID: 84958950379     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-62688-3_33     Document Type: Conference Paper

References (23)

1. H. P. Barendregt, M. Coppo, and M. Dezani-Ciancaglini. A filter lambda model and the completeness of type assignment. Journal of Symbolic Logic, 48:931-940, 1983.
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. On Strictness and Totality. Internal report. Dipartimento di Informatica, Universitá di Torino, 1996.
5. M. Coppo, F. Damiani, and P. Giannini. Refinement Types for Program Analysis. In SAS’96, LNCS 1145, pages 143-158. Springer, 1996.
6. M. Coppo and M. Dezani-Ciancaglini. An extension of basic functional theory for lambda-calculus. Notre Dame Journal of Formal Logic, 21(4):685-693, 1980.
7. M. Coppo and A. Ferrari. Type inference, abstract interpretation and strictness analysis. Theoretical Computer Science, 121:113-145, 1993.
8. 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.
9. M. J. C. Gordon, R. Milner, and C. P. Wadsworth. Edinburg LCF. LNCS 78. Springer, 1979.
10. C. Hankin and D. Le Métayer. A Type-Based Framework for Program Analysis. In SAS’94, LNCS 864, pages 380-394. Springer, 1994.
11. C. Hankin and D. Le Métayer. Deriving algorithms for type inference systems: Applications to strictness analysis. In POPL’94, pages 202-212. ACM, 1994.
12. C. Hankin and D. Le Métayer. Lazy type inference and program analysis. Science of Computer Programming, 25:219-249, 1995.
13. R. Hindley. The principal types schemes for an object in combinatory logic. Transactions o/American Mathematical Society, 146:29-60, 1969.
14. T. P. Jensen. Abstract Interpretation in Logical Form. PhD thesis, University of London, Imperial College, 1992.
15. G. Kahn. Natural semantics. In K. Fuchi and M. Nivat, editors, Programming Of Future Generation Computer. Elsevier Sciences B.V. (North-Holland), 1988.
16. T. M. Kno and P. Mishra. Strictness analysis: a new perspective based on type inference. In Functional Programming Languages and Computer Architecture, pages 260-272. ACM, 1989.
17. R. Milner. A Theory of Type Polymorphism in Programming. Journal of Computer and System Science, 17:348-375, 1978.
18. J. Palsberg and P. O’Keefe. A Type System Equivalent to Flow Analysis. In POPL’95, pages 367-378. ACM, 1995.
19. A. M. Pitts. Operationally-Based Theories of Program Equivalence. Summer School on Semantics and Logics of Computation, Cambridge UK, 25-29 Sep 1995.
20. K. L. Solberg. Annotated Type Systems for Program Analysis. PhD thesis, Aarhus University, Denmark, 1995.
21. K. L. Solberg, H. R. Nielson, and F. Nielson. Strictness and Totality Analysis. In SAS’94, LNCS 864, pages 408-422. Springer, 1994.
22. S. van Bakel. Intersection Type Disciplines in Lambda Calculus and Applicative Term Rewriting Systems. PhD thesis, Katholieke Universiteit Nijmegen, 1993.
23. D. A. Wright. Reduction Types and Intensionality in the Lambda-Calculus. PhD thesis, University of Tasmania, 1992.