Eric Nöcker
- Abramsky S., Strictness Analysis and Polymorphic Invariance, in: Proc. of Workshop on Programs az Data Objects, pages 1-23, DIKU, Denmark, Springer Verlag, LNCS 217, 1985. Google Scholar
Digital Library
- Burn G.L., Evaluation Transformers-& Model for the Parallel Evaluation of Fkmctional Languages (extended abstract), in: Proc. of Conference on Functional Programming Languages and Computer Architecture (FPCA '87), pages 446-470, Portl~nd, Oregon, USA, Sprln//;~r V~rl~g, LNCS 274, 1987. Google ScholarDigital Library
- Burn G.L., C.L. Hankin and S. Abramsky, The Theory of Strictness Analysis for Higher Order Functions, in: Proc. of Workshop on ProBrams as Data Objects, pages 42-62, DIKU, Denmark, Springer Verlag, LNCS 217, 1985. Google ScholarDigital Library
- Clack C. and S. Peyton Jones, Strictness Analysis- a Practical Approach, in: Proc. of Conference on Functional Programming Languages and Computer Architecture (FPCA '85), pages 35-49, Nancy, France, Springer Verlag, LNCS 201, 1985. Google ScholarDigital Library
- Cousot P. and R. Cousot, Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction of Approximations of Fixed Points, in: Proc. of gth Symposium on Principles of Programming Languages (POPL'77), pages 238-252, 1977. Google ScholarDigital Library
- Eekelen M.C.J.D. van, E. Goubault, C. Hankin and E. N'dcker, Abstract Reduction: Towards a Theory via Abstract Interpreration, in: Proc. of Semagraph Symposium, Nijmegen, The Netherlands, 1991, also to appear in Sleep et al. {1993}.Google Scholar
- Goubault E. and C. Hankin, A Lattice for the Abstract Interpreration of Term Graph Rewrite Systems, in: Proc. of Semagraph Symposium, pages 263--273, Nijmegen, The Netherlands, 1991, also to appear in Sleep et al. {1993}.Google Scholar
- Hunt S., Frontiers and Open Sets in Abstract Interpretation, in: Proc. of Conference on Functional Programming Languages and Computer Architecture (FPCA '89), pages 1-13, London, UK, AOM Press,, 1989. Google ScholarDigital Library
- Leung A. and P. Mishra, Reasoning about Simple and Exhaustire Demand in Higher-Order Lazy Languages, in: Proc. of International Conference on Functional Programming Languages and Computer Architecture (FPCA '91), pages 328- 351, Boston, USA, Springer Verlag, LNCS 523, 1991. Google ScholarDigital Library
- Martin C. and C. Hankin, Finding Fixed Points in Finite Lattices, in: Proc. of Conference on Functional Programming Languages and Co~npuier Architecture (FPCA '87), pages 426-445, Portland, Oregon, USA, Springer Verlag, LNCS 274, 1987. Google ScholarDigital Library
- Mycroft A., Abstract interpretation and opiimising transformations for applicative programs, PhD thesis, University of Edinburgh, 1981.Google Scholar
- N'~cker E., Strictness Analysis by Abstract Reduction in Orthogonal Term Rewriting Systems, Technical Report 92-31, University of Nijmegen, 1992.Google Scholar
- Plasmeijer M.J. and M.C.J.D. van Eekelen, Functional Programrainy and Parallel Graph Rewriting, Addison Wesley, University of Nijmegen, The Netherlands, to appear in 1993. Google ScholarDigital Library
- Plasmeijer M.J., M.C.J.D. van Eekelen, E. NScker and J.E.W. Smetsers, The Concurrent Clean System- Functional Programming on the Macintosh, in: Proc. of 7$h int. Conference of the Apple European Univerzit~t Consortium, Paris, 1991.Google Scholar
- Sleep M.R., M.J. Plasmeijer and M.C.J.D. van Eekelen, Term Graph Rewriting, Theor~ and Practice, John Wiley and Sons inc., 1993. Google ScholarDigital Library
- Toyama Y., J.E.W. Smetsers, M.C.J.D. van Eekelen and M.J. Plasmeijer, The Functional Strategy and T~ansitive Term Rewriting Systems, in: Proc. of Semagraph Symposium, pages 99-115, Nijmegen, The Netherlands, 1991, also to appear in Sleep et aL {1993}.Google Scholar
- Wadler P. and R. J. M. Hughes, Projections for Strictness Analysis, in: Proc. of Conference on Functional Programming Languages a~d Computer Architecture (FPCA '87), pages 385-407, Portland, Oregon, USA, Springer Verlag, LNCS 274, 1987. Google ScholarDigital Library
- Wadler P., Strictness Analysis over Non-fiat Domains, in: Abstract interpretation of Declarative Languages, Ellis Horwood, 1987.Google Scholar
Index Terms
- Strictness analysis using abstract reduction
Recommendations
On strictness and its analysis
POPL '87: Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languagesWe study the strictness problem for the untyped lambda-calculus and for an ML-like typed calculus. We establish that strictness is a necessary and sufficient condition for the “eager” evaluation of function arguments. For the untyped calculus, we show ...
Strictness analysis algorithms based on an inequality system for lazy types
FLOPS'08: Proceedings of the 9th international conference on Functional and logic programmingThis paper deals with type-based analysis of functional programs. In particular we focus on strictness analysis using nonstandard type systems using a special kind of type called lazy type. We propose an inequality system for lazy types, from which two ...
Comments