Among the unsolvable terms of the lambda calculus, the mute (or root-active) ones are those having the highest degree of un-definedness. In this paper, we define an infinite set S of mute terms, and show that it is graph-easy: for any closed term t of the lambda calculus there exists a graph model equating all the terms of S to t.
A graph easy set of mute lambda terms
CARRARO, ALBERTO;FAVRO, GIORDANO;SALIBRA, Antonino
2014-01-01
Abstract
Among the unsolvable terms of the lambda calculus, the mute (or root-active) ones are those having the highest degree of un-definedness. In this paper, we define an infinite set S of mute terms, and show that it is graph-easy: for any closed term t of the lambda calculus there exists a graph model equating all the terms of S to t.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
ictcs2014-versione-proceedings.pdf
non disponibili
Tipologia:
Documento in Pre-print
Licenza:
Licenza non definita
Dimensione
276.19 kB
Formato
Adobe PDF
|
276.19 kB | Adobe PDF | Visualizza/Apri |
I documenti in ARCA sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
