Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Scott's continuous semantics"'
Publikováno v:
Computer Science Logic ISBN: 9783540749141
CSL
CSL'07, 16th EACSL Annual Conference on Computer Science and Logic
CSL'07, 16th EACSL Annual Conference on Computer Science and Logic, Sep 2007, Lausanne, Switzerland. pp.268-282, ⟨10.1007/978-3-540-74915-8⟩
Scopus-Elsevier
CSL
CSL'07, 16th EACSL Annual Conference on Computer Science and Logic
CSL'07, 16th EACSL Annual Conference on Computer Science and Logic, Sep 2007, Lausanne, Switzerland. pp.268-282, ⟨10.1007/978-3-540-74915-8⟩
Scopus-Elsevier
A longstanding open problem is whether there exists a non-syntactical model of untyped lambda-calculus whose theory is exactly the least equational lambda-theory (=Lb). In this paper we make use of the Visser topology for investigating the more gener
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cab176fa2fa41ed8c12fe8fa849493de
https://doi.org/10.1007/978-3-540-74915-8_22
https://doi.org/10.1007/978-3-540-74915-8_22
Autor:
Chantal Berline, Antonino Salibra
Publikováno v:
Theoretical Computer Science
Theoretical Computer Science, Elsevier, 2006, 354, pp.4-23. ⟨10.1016/j.tcs.2005.11.005⟩
Theoretical Computer Science, Elsevier, 2006, 354, pp.4-23. ⟨10.1016/j.tcs.2005.11.005⟩
We generalize Baeten and Boerboom's method of forcing to show that there is a fixed sequence (uk)k∈ω of closed (untyped) λ-terms satisfying the following properties:(a) For any countable sequence (gk)k∈ω of Scott continuous functions (of arbit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c4647aaa377b4167567f3bede3829fd4
https://hal.archives-ouvertes.fr/hal-00003751v2/document
https://hal.archives-ouvertes.fr/hal-00003751v2/document
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⟩
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
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.