| Record ID | marc_loc_2016/BooksAll.2016.part12.utf8:127644272:892 |
| Source | Library of Congress |
| Download Link | /show-records/marc_loc_2016/BooksAll.2016.part12.utf8:127644272:892?format=raw |
LEADER: 00892cam a2200241 i 4500
001 79620560
003 DLC
005 20130419101019.0
008 791218s1978 ilu b s000 0 eng
010 $a 79620560
040 $aDLC$cDLC$dDLC
050 00 $aQA76$b.I4 no. 932$aQA76.6
082 00 $a001.6/4/08 s$a001.6/425
100 1 $aPlaisted, David A.
245 10 $aWell-founded orderings for proving termination of systems of rewrite rules /$cby David A. Plaisted.
260 $aUrbana :$bDept. of Computer Science, University of Illinois at Urbana-Champaign,$c1978.
300 $a34 p. ;$c28 cm.
490 1 $aUIUCDCS-R-78 ; 932
500 $aBibliography: p. 34.
650 0 $aComputer programs$xVerification.
650 0 $aRecursive programming.
650 0 $aComputr programs$xTermination.
810 1 $aIllinois.$bUniversity at Urbana-Champaign.$bDepartment of Computer Science.$tReport ;$v932.