"A Path Ordering for Proving Termination of Term Rewriting Systems."

Deepak Kapur, Paliath Narendran, G. Sivakumar (1985)

> Home

Details and statistics

DOI: 10.1007/3-540-15198-2_11

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/tapsoft/KapurNS85
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/tapsoft/KapurNS85
Deepak Kapur, Paliath Narendran, G. Sivakumar:
A Path Ordering for Proving Termination of Term Rewriting Systems. TAPSOFT, Vol.1 1985: 173-187

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.