The Formal System lambda-delta
| dc.creator | Guidi, F. | |
| dc.date | 2006-11-09 | |
| dc.date | 2008-09-25 | |
| dc.date.accessioned | 2026-07-07T10:05:03Z | |
| dc.date.available | 2026-07-07T10:05:03Z | |
| dc.description | The formal system lambda-delta is a typed lambda calculus that pursues the unification of terms, types, environments and contexts as the main goal. lambda-delta takes some features from the Automath-related lambda calculi and some from the pure type systems, but differs from both in that it does not include the Pi construction while it provides for an abbreviation mechanism at the level of terms. lambda-delta enjoys some important desirable properties such as the confluence of reduction, the correctness of types, the uniqueness of types up to conversion, the subject reduction of the type assignment, the strong normalization of the typed terms and, as a corollary, the decidability of type inference problem. | |
| dc.description | 44 pages, final version for ToCL (with minor changes wrt previous) | |
| dc.identifier | https://arxiv.org/abs/cs/0611040 | |
| dc.identifier | http://arxiv.org/abs/cs/0611040 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/169901 | |
| dc.subject | Logic in Computer Science | |
| dc.subject | F.4.1 | |
| dc.title | The Formal System lambda-delta | |
| dc.type | text |