Summary: 



Strongly sequential and inductively sequential term rewriting systems



Michael Hanus* Salvador Lucasy Aart Middeldorpz



Abstract Example 1.1Consider the following rul*
*es:

first(0,x)! []
The concept of definitional tree by Antoy servesftoiin-rst(s(x),y::z) ! y::firs*
*t(x,z)
troduce control information into the bare set of rules
of a constructor-based term rewriting systemW(TRS).e give a graphic representat*

Source: Alpuente, María - Departamento de Sistemas Informáticos y Computación, Universitat Politècnica de València

Collections: Computer Technologies and Information Sciences