Expressibility of functionals in D. Scott's LCF language
From MaRDI portal
Publication:599804
DOI10.1007/BF01876321zbMath0415.03011MaRDI QIDQ599804
Publication date: 1977
Published in: Algebra and Logic (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/186928
Related Items (12)
Fully abstract translations between functional languages ⋮ A universality theorem for PCF with recursive types, parallel-or and ∃ ⋮ Full abstraction and the Context Lemma (preliminary report) ⋮ On naturally continuous non-dcpo domains ⋮ A stable programming language ⋮ On Natural Non-dcpo Domains ⋮ Unnamed Item ⋮ Can LCF be topped! Flat lattice models of typed \(\lambda{}\)-calculus ⋮ Natural non-dcpo domains and f-spaces ⋮ Semantics of algorithmic languages ⋮ The extensional ordering of the sequential functionals ⋮ The sequential functionals of type $(\iota \rightarrow \iota)^n \rightarrow \iota$ form a dcpo for all $n \in \Bbb N$
Cites Work
This page was built for publication: Expressibility of functionals in D. Scott's LCF language
