( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Reducing Relative Termination to Dependency Pair Problems.

, , , и . CADE, том 9195 из Lecture Notes in Computer Science, стр. 163-178. Springer, (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Humberto Jorge José

Séverine Iborra

Nadine José Gonzalez

José Navarrete

José Putharikal

 

Другие публикации лиц с тем же именем

Modeling for Users., и . AmI Workshops, том 11 из Communications in Computer and Information Science, стр. 77-82. Springer, (2007)Reducing Relative Termination to Dependency Pair Problems., , , и . CADE, том 9195 из Lecture Notes in Computer Science, стр. 163-178. Springer, (2015)Goal-Directed and Relative Dependency Pairs for Proving the Termination of Narrowing., , и . LOPSTR, том 6037 из Lecture Notes in Computer Science, стр. 52-66. Springer, (2009)Proving Termination of Context-Sensitive Rewriting with MU-TERM., , , и . PROLE, том 188 из Electronic Notes in Theoretical Computer Science, стр. 105-115. Elsevier, (2006)Explicitly Typed Exceptions for Haskell.. PADL, том 5937 из Lecture Notes in Computer Science, стр. 43-57. Springer, (2010)Termination of Narrowing Using Dependency Pairs., , и . ICLP, том 5366 из Lecture Notes in Computer Science, стр. 317-331. Springer, (2008)Utilización de Maude desde Eclipse Modeling Framework para la Gestión de Modelos., , , , и . DSDM, том 157 из CEUR Workshop Proceedings, CEUR-WS.org, (2005)A compact fixpoint semantics for term rewriting systems., , , , и . Theor. Comput. Sci., 411 (37): 3348-3371 (2010)Modular Termination of Basic Narrowing., , и . RTA, том 5117 из Lecture Notes in Computer Science, стр. 1-16. Springer, (2008)A lightweight interactive debugger for haskell., , , и . Haskell, стр. 13-24. ACM, (2007)