From higher-order to first-order rewriting
We show how higher-order rewriting may be encoded into first-order rewriting modulo an equational theory ε. We obtain a characterization of the class of higher-order rewriting systems which can be encoded by first-order rewriting modulo an empty theory (that is, ε =ø). This class includes of course...
Guardado en:
| Autores principales: | Bonelli, E., Kesner, D., Ríos, A. |
|---|---|
| Formato: | SER |
| Materias: | |
| Acceso en línea: | http://hdl.handle.net/20.500.12110/paper_03029743_v2051LNCS_n_p47_Bonelli |
| Aporte de: |
Ejemplares similares
-
From higher-order to first-order rewriting
por: Bonelli, Eduardo
Publicado: (2001) -
Relating higher-order and first-order rewriting
por: Bonelli, E., et al. -
Relating higher-order and first-order rewriting
Publicado: (2005) -
A de bruijn notation for higher-order rewriting
por: Bonelli, E., et al. -
A de bruijn notation for higher-order rewriting
por: Bonelli, Eduardo
Publicado: (2000)