Publication:5649639
From MaRDI portal
zbMath0239.54006MaRDI QIDQ5649639
Publication date: 1972
Related Items
Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, A \(\kappa\)-denotational semantics for map theory in ZFC+SI, Intersection types for \(\lambda\)-trees, Two applications of analytic functors, On the construction of stable models of untyped \(\lambda\)-calculus, First-countability, sequentiality and tightness of the upper Kuratowski convergence, Intersection types and domain operators, Behavioural inverse limit \(\lambda\)-models, Generalized filter models, From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models, Function-space compactifications of function spaces, Self-similar sets as Tarski's fixed points, Continuously generated fixed points, Recursive domain equations for concrete data structure, Describing semantic domains with sprouts, Equational logic of circular data type specification, Caratterizzazione dei reticoli continui per la teoria della computazione di Dana Scott, Integration in Real PCF, Taut monads and \(T0\)-spaces., Borel measures in consonant spaces, When does the Fell topology on a hyperspace of closed sets coincide with the meet of the upper Kuratowski and the lower Vietoris topologies?, A type theoretic interpretation of constructive domain theory, On \(d\)-spaces, A note on continuous partially ordered sets, The HASCASL prologue: Categorical syntax and semantics of the partial \(\lambda\)-calculus, Intersection types and lambda models, The monad of probability measures over compact ordered spaces and its Eilenberg-Moore algebras, Projective sup-algebras: a general view, A stable programming language, Precedence-inclusion patterns and relational learning, A concrete realization of the Hoare powerdomain, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Stability of efficient sets: continuity of mobile polarities, Unnamed Item, Unnamed Item, Algebraic specification of data types: A synthetic approach, Unnamed Item, Unnamed Item, Computability in higher types, P\(\omega\) and the completeness of type assignment, Convex powerdomains. I, Specification of topological spaces by algebraic systems of continuous functions, I-categories as a framework for solving domain equations, Logical foundations for programming semantics, A general theory of fuzzy arithmetic, Solving reflexive domain equations in a category of complete metric spaces, Functorial polymorphism, Type inference with recursive types: Syntax and semantics, The largest Cartesian closed category of domains, Expressive power of typed and type-free programming languages, A systematic study of models of abstract data types, Closure functions and general iterates as reflectors, A uniform approach to inductive posets and inductive closure, Insertion of lattice-valued and hedgehog-valued functions, Inconsistency and semantic unification, Two categories of effective continuous cpos, Towards a descriptive set theory for domain-like structures, Non-deterministic information systems and their domains, Fuzzy topology with respect to continuous lattices, An irregular filter model, Computability and the morphological complexity of some dynamics on continuous domains, Monotone insertion of lattice-valued functions, Formal topological characterizations of various continuous domains, Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms, Algebraic domain equations, \(T_ 0\)-spaces and pointwise convergence, Admissible representations of effective cpo's, A characterization of Plotkin's order in powerdomains, and some of its properties, On a 'good' dense class of topological spaces, Some modifications of Scott's theorem on injective spaces, A characterization of F-complete type assignments, Retracts of the closure space of filters in the lattice of all subsets, Universal profinite domains, Implication and analysis in classical Frege structures, Recursively defined domains and their induction principles, Type theories, normal forms, and \(D_{\infty}\)-lambda-models, Recursion theorems and effective domains, \(\kappa\)-continuous lattices and comprehension principles for Frege structures, A mathematical theory of randomized computation. I, A guided tour of the mathematics of MetaSoft '88, Generalization of Scott's formula for retractions from generalized Alexandroff's cube, On the uniqueness of fixed points of endofunctors in a category of complete metric spaces, On Church's formal theory of functions and functionals. The \(\lambda\)- calculus: Connections to higher type recursion theory, proof theory, category theory, A type-free system extending (ZFC), The contraction property is sufficient to guarantee the uniqueness of fixed points of endofunctors in a category of complete metric spaces, Enlargements of functional algebras for the lambda calculus, \(\mathbb{T}^\omega\) as a universal domain, Least fixed point of a functor, Continuous posets and adjoint sequences, Effectively given domains, The concept of a proposition in classical and quantum physics, Varieties of chain-complete algebras, Colimits of continuous lattices, Chain properties in Pomega, Recursion-closed algebraic theories, Computing with infinite objects, The IO- and OI-hierarchies, A lemma on flatness, Embedding metric spaces into CPO's, Graph grammars and operational semantics, Continuous categories and exponentiable toposes, A class of fuzzy theories, Sequential algorithms on concrete data structures, Towards a foundation for semantics in complete metric spaces, Recursion over realizability structures, Recursive types for Fun, Finite type structures within combinatory algebras, CABool is monadic over almost all categories, Quantitative domains and infinitary algebras, An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus, From algebra to operational semantics, On the cardinality of some lattices, Completeness results for the equivalence of recursive schemas, Computability concepts for programming language semantics, Irreducibility and generation in continuous lattices, The retracts in \(P\omega\) do not form a continuous lattice - a solution to Scott's problem, Categories of chain-complete posets, PASCAL in LCF: Semantics and examples of proof, A global representation of the recursive functions in the \(\lambda\)- calculus, Fixed-point constructions in order-enriched categories, Sobrification of partially ordered sets, A generalized setting for fixpoint theory, Induction and recursion on the partial real line with applications to Real PCF, Inconsistency without contradiction, Properly injective spaces and function spaces, The way-below relation of function spaces over semantic domains, Topology, domain theory and theoretical computer science, Fuzzy cores and their extensions, Type inference, abstract interpretation and strictness analysis, The genericity theorem and parametricity in the polymorphic \(\lambda\)- calculus, Set-theoretical and other elementary models of the \(\lambda\)-calculus, The comparison of a cpo-based semantics with a cms-based semantics for \(CSP\), Combining type disciplines, Banach's fixed-point theorem as a base for data-type equations, Essential extensions of Hausdorff spaces, The connection between initial and unique solutions of domain equations in the partial order and metric approach, Limiting semantics of numerical programs, A note on injective spaces., Constructive metrisability in point-free topology.
