Publisher
Springer Berlin Heidelberg
Reference39 articles.
1. Aiken, A.: Introduction to set constraint-based program analysis. Sci. Comput. Program. 35(2–3), 79–111 (1999)
2. Aiken, A., Murphy, B.R.: Implementing regular tree expressions. In: Conference on Functional Programming Languages and Computer Architecture (FPCA). LNCS, vol. 523, pp. 427–447, August 1991
3. Aiken, A., Murphy, B.R.: Static type inference in a dynamically typed language. In: Symposium on Principles of Programming Languages (POPL), pp. 279–290, January 1991
4. Cejtin, H., Jagannathan, S., Weeks, S.: Flow-directed closure conversion for typed languages. In: Smolka, G. (ed.) ESOP 2000. LNCS, vol. 1782, pp. 56–71. Springer, Heidelberg (2000)
5. Cousot, P., Cousot, R.: Compositional and inductive semantic definitions in fixpoint, equational, constraint, closure-condition, rule-based and game-theoretic form, invited paper. In: Conference on Computer Aided Verification (CAV). LNCS, vol. 939, pp. 293–308, July 1995
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Random testing of a higher-order blockchain language (experience report);Proceedings of the ACM on Programming Languages;2022-08-29
2. An Efficient Type- and Control-Flow Analysis for System F;Proceedings of the 26nd 2014 International Symposium on Implementation and Application of Functional Languages;2014-10