A termination proof for epsilon substitution using partial derivations

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.303, Iss.1, 2003-06, pp. : 187-213

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Modular Termination Proofs for Rewriting Using Dependency Pairs

By Giesl J. Arts T. Ohlebusch E.

Journal of Symbolic Computation, Vol. 34, Iss. 1, 2002-07 ,pp. : 21-58

Academic Press

Access to resources Recommend Favorite

Termination of term rewriting using dependency pairs

By Arts T. Giesl J.

Theoretical Computer Science, Vol. 236, Iss. 1, 2000-04 ,pp. : 133-178

Elsevier

Access to resources Recommend Favorite

Combining Proof Plans with Partial Order Planning for Imperative Program Synthesis

By Ireland Andrew Stark Jamie

Automated Software Engineering, Vol. 13, Iss. 1, 2006-01 ,pp. : 65-105

Springer Publishing Company

Access to resources Recommend Favorite

Using the Wii Remote for Mobile Device Application Testing: A Proof-of-Concept

International Journal of Handheld Computing Research (IJHCR), Vol. 6, Iss. 1, 2015-01 ,pp. : 34-43

IGI Global_journal

Access to resources Recommend Favorite

Partial Shape Matching Using Transformation Parameter Similarity

COMPUTER GRAPHICS FORUM (ELECTRONIC), Vol. 34, Iss. 1, 2015-02 ,pp. : 239-252

John Wiley & Sons Inc

Access to resources Recommend Favorite