The Light Lexicographic path Ordering
暂无分享,去创建一个
[1] Daniel Leivant. Applicative Control and Computational Complexity , 1999, CSL.
[2] Daniel Leivant,et al. Functions Over Free Algebras Definable in the Simply Typed lambda Calculus , 1993, Theor. Comput. Sci..
[3] Daniel Leivant,et al. Predicative Functional Recurrence and Poly-space , 1997, TAPSOFT.
[4] Nachum Dershowitz,et al. Termination of Rewriting , 1987, J. Symb. Comput..
[5] Neil D. Jones. The expressive power of higher-order types or, life without CONS , 2001, J. Funct. Program..
[6] Dieter Hofbauer. Termination Proofs by Multiset Path Orderings Imply Primitive Recursive Derivation Lengths , 1992, Theor. Comput. Sci..
[7] Jean-Yves Marion,et al. Efficient First Order Functional Program Interpreter with Time Bound Certifications , 2000, LPAR.
[8] Robin Milner,et al. Handbook of Theoretical Computer Science (Vol. B) , 1990 .
[9] Stephen A. Cook,et al. A new recursion-theoretic characterization of the polytime functions (extended abstract) , 1992, STOC '92.
[10] Andreas Weiermann,et al. Termination Proofs for Term Rewriting Systems by Lexicographic Path Orderings Imply Multiply Recursive Derivation Lengths , 1995, Theor. Comput. Sci..
[11] Daniel Leivant,et al. Ramified Recurrence and Computational Complexity II: Substitution and Poly-Space , 1994, CSL.
[12] J. Van Leeuwen,et al. Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .
[13] Daniel Leivant,et al. A characterization of alternating log time by ramified recurrence , 2000, Theor. Comput. Sci..