Enhanced type inference for binding-time analysis

[1] K. Asai, Toward introducing binding-time analysis to MetaOCaml, Proceedings of the 2016 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, St. Petersburg, FL, USA, 2016, pp. 97–102. ⇒23310.1145/2847538.2847547Search in Google Scholar

[2] K. Claessen, J. Hughes, Quickcheck: A lightweight tool for random testing of Haskell programs, SIGPLAN35, 9 (2000) 268—279. ⇒24510.1145/357766.351266Search in Google Scholar

[3] C. Gomard, N. Jones, A partial evaluator for the untyped lambda calculus, Journal of Functional Programming1, 1 (1991) 21–69. ⇒23310.1017/S0956796800000058Search in Google Scholar

[4] C. K. Gomard, Partial type inference for untyped functional programs, Proceedings of the 1990 ACM Conference on LISP and Functional Programming, Nice, France, 1990, pp. 282–287. ⇒232, 234, 23510.1145/91556.91672Search in Google Scholar

[5] F. Henglein, Efficient type inference for higher-order binding-time analysis, Conference on Functional Programming Languages and Computer Architecture, Lecture Notes in Computer Science523 (1991) 448—472. ⇒24810.1007/3540543961_22Search in Google Scholar

[6] O. Lee, K. Yi, Proofs about a folklore let-polymorphic type inference algorithm, ACM Trans. Program. Lang. Syst., 20, 4 (1998) 707—723. ⇒235, 237, 24010.1145/291891.291892Search in Google Scholar

[7] T. Lindahl, K. Sagonas, Practical Type Inference Based on Success Typings, Proc. 8th ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming, Venice, Italy, 2006, pp. 167–178. ⇒23410.1145/1140335.1140356Search in Google Scholar

[8] R. Milner, L. Damas, Principal type-scheme for functional programs, Proc. 9th ACM Symposium on Principles of Programming Languages New York, USA, 1982, pp. 207–212. ⇒240Search in Google Scholar

[9] T. Murakami, Z. Hu, K. Kakehi, M. Takeichi, An efficient staging algorithm for binding-time analysis, International Symposium on Logic-Based Program Synthesis and Transformation, Lecture Notes in Computer Science3018 (2003) pp. 106–107. ⇒23310.1007/978-3-540-25938-1_9Search in Google Scholar

[10] H. R. Nielson, F. Nielson, Automatic binding time analysis for a typed lambda-calculus (extended abstract), Proc. 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages San Diego, California, USA, 1988, pp. 98–106. ⇒23310.1145/73560.73569Search in Google Scholar

[11] T. Sheard, N. Linger, Search-based binding time analysis using type-directed pruning, Proceedings of the ASIAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, Aizu, Japan, 2002, pp. 20-–31. ⇒23310.1145/568173.568176Search in Google Scholar

[12] J. Wang, Generating random lambda calculus terms, Semantic Scholar, 2005. https://www.semanticscholar.org ⇒246Search in Google Scholar

[13] J. B. Wells, Typability and type checking in system F are equivalent and undecidable, Annals of Pure and Applied Logic, 98, 1 (1999) 111 – 156. ⇒24810.1016/S0168-0072(98)00047-5Search in Google Scholar

[14] H. G. Mairson, Deciding ML typability is complete for deterministic exponential time, Proc. 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, New York, NY, United States, 1989, pp. 382–401. ⇒24810.1145/96709.96748Search in Google Scholar

[15] B. C. Pierce, Advanced Topics in Types and Programming Languages, MIT Press, Cambridge, MA, 2004. ⇒23310.7551/mitpress/1104.001.0001Search in Google Scholar

[16] B. C. Pierce, Types and Programming Languages, MIT Press, Cambridge, MA, 2002. ⇒233Search in Google Scholar