Expressibility of functionals in D. Scott's LCF language

DOI10.1007/BF01876321zbMATH Open0415.03011MaRDI QIDQ599804FDOQ599804

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (12)

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

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)