| Record ID | ia:recursivelydefin943plai |
| Source | Internet Archive |
| Download MARC XML | https://archive.org/download/recursivelydefin943plai/recursivelydefin943plai_marc.xml |
| Download MARC binary | https://www.archive.org/download/recursivelydefin943plai/recursivelydefin943plai_meta.mrc |
LEADER: 01048nam 2200265 i 4500
001 841633
005 20020415161753.0
008 791031s1978 ilu b s00010 engm
035 $a(OCoLC)ocm04944224
035 $9ADL-6077
040 $aDLC$cDLC$dm.c.$dUIU
050 0 $aQA76$b.I4 no. 943$aQA76.6
082 $a001.6/4/08 s$a001.6/42
100 10 $aPlaisted, David A.
245 12 $aA recursively defined ordering for proving termination of term rewriting systems /$cby David A. Plaisted.
260 0 $aUrbana :$bDept. of Computer Science, University of Illinois at Urbana-Champaign,$c1978.
300 $a53 p. ;$c28 cm.
440 0 $aReport (University of Illinois at Urbana-Champaign. Dept. of Computer Science)$vno. 943
500 $a"UILU-ENG 78 1736."
500 $aNSF MCS 77-22830."
504 $aBibliography: p. 53.
650 0 $aElectronics digital computers$xProgramming.
650 0 $aAutomatic theorem proving
650 0 $aRecursion theory
830 0 $aReport (University of Illinois at Urbana-Champaign. Dept. of Computer Science)$vno. 943