Publisher
Springer Berlin Heidelberg
Reference10 articles.
1. Berry, G., Bottom-up computation of recursive programs, Research Report 133, IRIA-Laboria, 78150 Le Chesnay, France (1975).
2. Cousot, P. and Cousot, R., Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints, Proc. of Conference on Principles of Programming Languages, Los Angeles (1977).
3. Darlington, J. and Burstall, R.M., A transformation system for developing recursive programs, JACM, Vol. 24, No. 1 (1977).
4. Friedman, D.P. and Wise, D.S., CONS should not evaluate its arguments, Proc. of 3rd International Colloquium on Automata, Languages and Programming, Edinburgh (1976).
5. Gordon, M.J.C., Milner, A.J.R.G. and Wadsworth, C., Edinburgh LCF, Lecture Notes in Computer Science, Springer-Verlag (1979).
Cited by
57 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Refinement Types for Call-by-name Programs;Journal of Information Processing;2023
2. Dynamic interval analysis by abstract interpretation;Formal Methods in Outer Space;2021
3. Local Higher-Order Fixpoint Iteration;Electronic Proceedings in Theoretical Computer Science;2020-09-20
4. Transforming Boolean equalities into constraints;Formal Aspects of Computing;2017-05
5. From Boolean Equalities to Constraints;Logic-Based Program Synthesis and Transformation;2015