scientific article; zbMATH DE number 3783068

MaRDI QIDQ3960746zbMATH OpenFDO

Authors Dana Scott

Publication date 1982

zbMATH Keywords

closure systemsdomainsfilter completionsneighbourhood systemsposets

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Partial orders, general (06A06) Galois correspondences, closure operators (in relation to ordered sets) (06A15) Complete lattices, completions (06B23) Theory of computing (68Q99)

Cited in

(19)

• Type 2 recursion theory
• Universal profinite domains
• On Church's formal theory of functions and functionals. The - calculus: Connections to higher type recursion theory, proof theory, category theory
• Universal homogeneous event structures and domains
• Domains for logic programming
• Function spaces, cartesian closedness and nonstandard methods
• Coherence and consistency in domains
• Constructive domain theory as a branch of intuitionistic pointfree topology
• From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models
• Domain theoretic models of polymorphism
• Computer science and decision theory
• An adequacy theorem for dependent type theory
• Towards lambda calculus order-incompleteness
• Almost every domain is universal
• Computability in higher types, P and the completeness of type assignment
• On stable domains
• Data types over multiple-valued logics
• Inconsistency and semantic unification
• A category-theoretic characterization of functional completeness

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 Q3960746)