Well-founded orderings for proving termination of systems of rewrite rules /


Autoria(s): Plaisted, David A.
Data(s)

13/11/1978

Resumo

Bibliography: p. 34.

Mode of access: Internet.

Formato

con

Identificador

http://hdl.handle.net/2027/uiuo.ark:/13960/t9b58420p

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 #Recursive programming #Computer programs
Tipo

text