scientific article
From MaRDI portal
Publication:3960746
zbMath0497.06001MaRDI QIDQ3960746
Publication date: 1982
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Partial orders, general (06A06) Complete lattices, completions (06B23) Galois correspondences, closure operators (in relation to ordered sets) (06A15) Combinatory logic and lambda calculus (03B40) Theory of computing (68Q99)
Related Items (19)
Universal profinite domains ⋮ Constructive domain theory as a branch of intuitionistic pointfree topology ⋮ Inconsistency and semantic unification ⋮ On Church's formal theory of functions and functionals. The \(\lambda\)- calculus: Connections to higher type recursion theory, proof theory, category theory ⋮ A category-theoretic characterization of functional completeness ⋮ Universal homogeneous event structures and domains ⋮ Domains for logic programming ⋮ On stable domains ⋮ Towards Lambda Calculus Order-Incompleteness ⋮ Function spaces, cartesian closedness and nonstandard methods ⋮ Computer science and decision theory ⋮ Computability in higher types, P\(\omega\) and the completeness of type assignment ⋮ Coherence and consistency in domains ⋮ Data types over multiple-valued logics ⋮ An adequacy theorem for dependent type theory ⋮ Domain theoretic models of polymorphism ⋮ From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models ⋮ Almost Every Domain is Universal ⋮ Type 2 recursion theory
This page was built for publication:
