scientific article; zbMATH DE number 3503200

MaRDI QIDQ4083399zbMATH OpenFDO

Authors Dana Scott

Publication date 1975

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Recursively (computably) enumerable sets and degrees (03D25) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Cited in

(13)

• A mathematical semantics for a nondeterministic typed lambda-calculus
• An algebraic interpretation of the K-calculus; and an application of a labelled -calculus
• The algebra of partial equivalence relations
• Generalized quasi-metric semilattices
• Cartesian closed categories of separable Scott domains
• Easy lambda-terms are not always simple
• scientific article; zbMATH DE number 3525360 (Why is no real title available?)
• Domains via approximation operators
• A denotational semantics for the AspectTalk programming language
• A topology on lattice-ordered groups
• Domain theory aspects of extensions of integral domains
• Quotient-reflective and bireflective subcategories of the category of preordered sets
• Semantics of algorithmic languages

This page was built for publication:

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