Author:
Hankin Chris,Métayer Daniel
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. S. van Bakel, Complete restrictions of the intersection type discipline, Theoretical Computer Science, 102(1):135–163, 1992.
2. P. N. Benton, Strictness logic and polymorphic invariance, in Proceedings of the 2nd Int. Symposium on Logical Foundations of Computer Science, LNCS 620, Springer Verlag, 1992.
3. P. N. Benton, Strictness Properties of Lazy Algebraic Datatypes, in Proceedings WSA'93, LNCS 724, Springer Verlag, 1993.
4. G. L. Burn, A Logical Framework for Program Analysis, in Proceedings of the 1992 Glasgow Functional Programming Workshop, Springer Verlag Workshops in Computer Science, 1992.
5. C. L. Hankin and D. Le Métayer, Deriving algorithms from type inference systems: Application to strictness analysis, in Proceedings of POPL'94, ACM Press, 1994.
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Type-based parametric analysis of program families;ACM SIGPLAN Notices;2014-11-26
2. Type-based parametric analysis of program families;Proceedings of the 19th ACM SIGPLAN international conference on Functional programming;2014-08-19
3. Exact Intersection Type Abstractions for Safety Checking of Recursion Schemes;Proceedings of the 16th International Symposium on Principles and Practice of Declarative Programming - PPDP '14;2014
4. Optimisation Validation;Electronic Notes in Theoretical Computer Science;2007-07
5. A Formalization of Static Analyses in System F;Automated Deduction — CADE-16;1999