|
|
|
|
| LEADER |
00000naa a2200000 a 4500 |
| 003 |
AR-LpUFIB |
| 005 |
20250311170417.0 |
| 008 |
230201s2005 xx o 000 0 eng d |
| 024 |
8 |
|
|a DIF-M6517
|b 6656
|z DIF005937
|
| 040 |
|
|
|a AR-LpUFIB
|b spa
|c AR-LpUFIB
|
| 100 |
1 |
|
|a Bonelli, Eduardo
|
| 245 |
1 |
0 |
|a de Bruijn indices for metaterms
|
| 300 |
|
|
|a 1 archivo (417,3 kB)
|
| 500 |
|
|
|a Formato de archivo: PDF. -- Este documento es producción intelectual de la Facultad de Informática - UNLP (Colección BIPA/Biblioteca)
|
| 520 |
|
|
|a In this paper we encode higher-order rewriting with names into higher-order rewriting in de Bruijn notation. This notation not only is defined for terms (as usually done in the literature) but also for metaterms, which are the syntactical objects used to express the rewriting rules of higher-order systems. Several examples are discussed. Fundamental properties such as confluence and normalisation are shown to be preserved.
|
| 534 |
|
|
|a Journal of Logic and Computation, 15(6), pp. 855-899
|
| 650 |
|
4 |
|a SISTEMAS DE REESCRITURA
|
| 700 |
1 |
|
|a Kesner, Delia
|
| 700 |
1 |
|
|a Rios, Alejandro
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1093/logcom/exi051
|
| 942 |
|
|
|c CP
|
| 952 |
|
|
|0 0
|1 0
|4 0
|6 A0284
|7 3
|8 BD
|9 80887
|a DIF
|b DIF
|d 2025-03-11
|l 0
|o A0284
|r 2025-03-11 17:04:17
|u http://catalogo.info.unlp.edu.ar/meran/getDocument.pl?id=544
|w 2025-03-11
|y CP
|
| 999 |
|
|
|c 55719
|d 55719
|
