A recursively defined ordering for proving termination of term rewriting systems /
| Data(s) |
16/09/1978
|
|---|---|
| Resumo |
NSF MCS 77-22830." "UILU-ENG 78 1736." Bibliography: p. 53. Mode of access: Internet. |
| Formato |
con |
| Identificador | |
| Idioma(s) |
eng |
| Publicador |
Urbana : Dept. of Computer Science, University of Illinois at Urbana-Champaign, |
| Direitos |
Items in this record are available as Creative Commons Attribution-NonCommercial-ShareAlike. View access and use profile at http://www.hathitrust.org/access_use#cc-by-nc-sa-3.0. Please see individual items for rights and use statements. |
| Palavras-Chave | #Recursion theory #Automatic theorem proving #Electronics digital computers |
| Tipo |
text |
