| Record ID | marc_loc_2016/BooksAll.2016.part12.utf8:127958711:1012 |
| Source | Library of Congress |
| Download Link | /show-records/marc_loc_2016/BooksAll.2016.part12.utf8:127958711:1012?format=raw |
LEADER: 01012cam a2200277 i 4500
001 79621024
003 DLC
005 20130412101013.0
008 791031s1978 ilu b s000 0 eng
010 $a 79621024
040 $aDLC$cDLC$dDLC
050 00 $aQA76$b.I4 no. 943$aQA76.6
082 00 $a001.6/4/08 s$a001.6/42
100 1 $aPlaisted, David A.
245 12 $aA recursively defined ordering for proving termination of term rewriting systems /$cby David A. Plaisted.
260 $aUrbana :$bDept. of Computer Science, University of Illinois at Urbana-Champaign,$c1978.
300 $a53 p. ;$c28 cm.
490 1 $a[Report] - UIUCDCS-R-78 ; 943
500 $a"UILU-ENG 78 1736."
500 $aNSF MCS 77-22830."
504 $aBibliography: p. 53.
650 0 $aComputer programming.
650 0 $aAutomatic theorem proving.
650 0 $aRewriting systems (Computer science)
650 0 $aRecursion theory.
810 1 $aIllinois.$bUniversity at Urbana-Champaign.$bDepartment of Computer Science.$tReport ;$v943.