Pascal and Francis Bibliographic Databases

Help

Permanent link : http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=3440024

Export

Selection :

Termination proofs for term rewriting systems by lexicographic path orderings imply multiply recursive derivation lengths

Author
WEIERMANN, A
Inst. mathematische Logik Grundlagenforschung, 48149 Münster, Germany
Source

Theoretical computer science. 1995, Vol 139, Num 1-2, pp 355-362 ; ref : 14 ref

CODEN
TCSCDI
ISSN
0304-3975
Scientific domain
Computer science
Publisher
Elsevier, Amsterdam
Publication country
Netherlands
Document type
Article
Language
English
Keyword (fr)
Fonction récursive Hiérarchie Lexicographie Méthode récursive Ordre lexicographique Relation ordre Règle production Réécriture
Keyword (en)
Recursive function Hierarchy Lexicography Recursive method Lexicographic order Ordering Production rule Rewriting
Keyword (es)
Función recursiva Jerarquía Lexicografía Método recursivo Orden lexicográfico Relación orden Regla producción Reescritura
Classification
Pascal
001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02A Theoretical computing

Pascal
001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02B Software / 001D02B09 Software engineering

Discipline
Computer science : theoretical automation and systems
Origin
Inist-CNRS
Database
PASCAL
INIST identifier
3440024

Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS

Access to the document

Searching the Web