Joint RTA-TLCA Invited Talk: A Logical Algorithm for ML Type Inference
暂无分享,去创建一个
[1] Harald Ganzinger,et al. A New Meta-complexity Theorem for Bottom-Up Logic Programs , 2001, IJCAR.
[2] David A. McAllester. On the complexity analysis of static analyses , 2002, JACM.
[3] Harry G. Mairson. Deciding ML typability is complete for deterministic exponential time , 1989, POPL '90.
[4] Harald Ganzinger,et al. Logical Algorithms , 2002, ICLP.
[5] Robin Milner,et al. A Theory of Type Polymorphism in Programming , 1978, J. Comput. Syst. Sci..
[6] Jerzy Tiuryn,et al. ML Typability is DEXTIME-Complete , 1990, CAAP.
[7] Fritz Henglein,et al. Type inference with polymorphic recursion , 1993, TOPL.