On the Sequential Nature of Unification
暂无分享,去创建一个
[1] Alberto Martelli,et al. An Efficient Unification Algorithm , 1982, TOPL.
[2] J. A. Robinson,et al. A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.
[3] Deepak Kapur,et al. On Proving Uniform Termination and Restricted Termination of Rewriting Systems , 1983, SIAM J. Comput..
[4] Hiroto Yasuura,et al. On Parallel Computational Complexity of Unification , 1984, Fifth Generation Computer Systems.
[5] Mike Paterson,et al. Linear unification , 1976, STOC '76.
[6] William F. Clocksin,et al. Programming in Prolog , 1981, Springer Berlin Heidelberg.
[7] Robin Milner,et al. A Theory of Type Polymorphism in Programming , 1978, J. Comput. Syst. Sci..
[8] Dilip V. Sarwate,et al. Computing connected components on parallel computers , 1979, CACM.
[9] Robert E. Tarjan,et al. Variations on the Common Subexpression Problem , 1980, J. ACM.
[10] Dexter Kozen,et al. Complexity of finitely presented algebras , 1977, STOC '77.
[11] Gordon D. Plotkin,et al. An ideal model for recursive polymorphic types , 1984, Inf. Control..
[12] L. Goldschlager. The monotone and planar circuit value problems are log space complete for P , 1977, SIGA.
[13] Steven Fortune,et al. Parallelism in random access machines , 1978, STOC.
[14] John Staples,et al. The Maximum Flow Problem is Log Space Complete for P , 1982, Theor. Comput. Sci..
[15] Richard Statman,et al. Unifiability is Complete for co-NLogSpace , 1982, Inf. Process. Lett..