Intersection types and domain operators

Autor: Fabio Alessi, Stefania Lusin, Mariangiola Dezani-Ciancaglini

Publikováno v: Theoretical Computer Science. 316:25-47

We use intersection types as a tool for obtaining λ-models. Relying on the notion of easy intersection type theory, we successfully build a λ-model in which the interpretation of an arbitrary simple easy term is any filter which can be described by

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6384fdaf963b78dcedc630a0483fe06a
https://doi.org/10.1016/j.tcs.2004.01.022

Graph models of $\lambda$-calculus at work, and variations

Autor: Chantal Berline

Publikováno v: Mathematical Structures in Computer Science
Mathematical Structures in Computer Science, Cambridge University Press (CUP), 2006, 16, pp.185-221. ⟨10.1017/S0960129506005123⟩

This paper surveys what we have learned during the last ten years about the lattice $\lambda \mathcal{T}$ of all $\lambda$-theories (= equational extensions of untyped $\lambda$-calculus), via the sets $\lambda \mathcal{C}$ consisting of the $\lambda

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::916f09aa18ce50055045e2dabc01d8c9
https://doi.org/10.1017/s0960129506005123

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.