Expressibility of functionals in D. Scott's LCF language

DOI10.1007/BF01876321MaRDI QIDQ599804zbMATH OpenFDO

Authors Vladimir Yu. Sazonov

Publication date 1977

Published in Algebra and Logic (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/186928

zbMATH Keywords

combinatory logiceffectively sequential functionalsrepresentable functionals

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Cited in

(12)

• Natural non-dcpo domains and f-spaces
• Can LCF be topped! Flat lattice models of typed \(\lambda{}\)-calculus
• A stable programming language
• Fully abstract translations between functional languages
• A universality theorem for PCF with recursive types, parallel-or and ∃
• The recursion hierarchy for PCF is strict
• On naturally continuous non-dcpo domains
• The sequential functionals of type \((\iota \rightarrow \iota)^n \rightarrow \iota\) form a \textit{dcpo} for all \(n \in \mathbb N\)
• Full abstraction and the Context Lemma (preliminary report)
• On Natural Non-dcpo Domains
• Semantics of algorithmic languages
• The extensional ordering of the sequential functionals

This page was built for publication: Expressibility of functionals in D. Scott's LCF language

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q599804)