Publication:3959414
From MaRDI portal
zbMath0495.68025MaRDI QIDQ3959414
Publication date: 1982
information system; computability; lambda calculus; finite approximations; fixed-point operator; cpo's; S- expression
54A05: Topological spaces and generalizations (closure spaces, etc.)
68Q65: Abstract data types; algebraic specification
68P05: Data structures
06A12: Semilattices
03B40: Combinatory logic and lambda calculus
18A15: Foundations, relations to logic and deductive systems
Related Items
Unnamed Item, A domain-theoretic approach to functional and logic programming, Recursive Domain Equations of Filter Models, A \(\kappa\)-denotational semantics for map theory in ZFC+SI, From concepts to consistent object specifications: Translation of a domain-oriented feature framework into practice, Domains via graphs, Intersection types for \(\lambda\)-trees, Describing semantic domains with sprouts, Domain theoretic models of polymorphism, Building continuous webbed models for system F, A cartesian closed category in Martin-Löf's intuitionistic type theory, Discrimination by parallel observers: the algorithm., Relational interpretations of recursive types in an operational setting., Toward an infinitary logic of domains: Abramsky logic for transition systems, A timed concurrent constraint language., Clausal logic and logic programming in algebraic domains, Three dual ontologies, Topological games in domain theory, Infinite intersection types, Towards the computational complexity of \(\mathcal{PR}^ \omega\)-terms, Recursive topological spaces, A type theoretic interpretation of constructive domain theory, Information systems for continuous posets, Mediating secure information flow policies, Some categorical aspects of information systems and domains, A general view of approximation, Cartesian closed stable categories, A stable programming language, On the parallel between the suplattice and preframe approaches to locale theory, A concrete realization of the Hoare powerdomain, Unnamed Item, Composition aspects of programmology. I, A fully abstract may testing semantics for concurrent objects, Convex powerdomains. I, A compositional semantic basis for the analysis of equational Horn programs, Nondeterminism and infinite computations in constraint programming, Filter models for conjunctive-disjunctive \(\lambda\)-calculi, Quasi-prime algebraic domains, Equational theories for inductive types, A presentation of the initial lift-algebra, I-categories as a framework for solving domain equations, Logical foundations for programming semantics, Graph rewriting for a partial ordering semantics of concurrent constraints programming, Subrecursive hierarchies on Scott domains, The probabilistic powerdomain for stably compact spaces, Computer theorem proving in mathematics, A note on inconsistencies caused by fixpoints in a cartesian closed category, Inverse image analysis generalises strictness analysis, Functorial polymorphism, Type inference with recursive types: Syntax and semantics, Using information systems to solve recursive domain equations, First order theories for partial models, A logical approach to stable domains, On the relations between monadic semantics, A new generic scheme for functional logic programming with constraints, Two-level semantics and abstract interpretation, The Hoare and Symth power domain constructors commute under composition, Non-deterministic information systems and their domains, Semantics of types for database objects, An algebraic approach to stable domains, Contractions in comparing concurrency semantics, An irregular filter model, On computational environments of topological spaces, Information systems revisited -- the general continuous case, Machine semantics, On some definition of physical state, On powerdomains and modality, A characterization of F-complete type assignments, The system \({\mathcal F}\) of variable types, fifteen years later, An algebraic semantics approach to the effective resolution of type equations, A refinement of strong sequentiality for term rewriting with constructors, Universal profinite domains, Two-level semantics and code generation, Hilbert space representation of time evolution of pure states, Type theories, normal forms, and \(D_{\infty}\)-lambda-models, Normal functors, power series and \(\lambda\)-calculus, A quantitative interpretation of Girard's System F, Semantics of production systems, Attributes and rough properties in information systems, On Church's formal theory of functions and functionals. The \(\lambda\)- calculus: Connections to higher type recursion theory, proof theory, category theory, Full abstraction and limiting completeness in equational languages, Event structures and domains, Domain theory in logical form, Recursive types for Fun, A semantics for complex objects and approximate answers, Relation algebraic domain constructions, Towards a semantics-based information theory, Using powerdomains to generalize relational databases, Domains for logic programming, Strictness analysis via abstract interpretation for recursively defined types, Some economic applications of Scott domains, \(dI\)--domains as prime information systems, Total sets and objects in domain theory, Coherence and consistency in domains, Categories of embeddings, Infinite \(\lambda\)-calculus and types, A fully abstract semantics for concurrent constraint programming, Logic programs, well-orderings, and forward chaining, \({\mathcal M}^\omega\) considered as a programming language, A note on fuzzy power relations, On a generalized product for domains, Type inference, abstract interpretation and strictness analysis, Historical introduction to ``Concrete domains by G. Kahn and G. D. Plotkin, Set-theoretical and other elementary models of the \(\lambda\)-calculus, An abstract machine for concurrent modular systems: CHARM, Type inference with partial types, Information categories, A context for belief revision: forward chaining-normal nonmonotonic rule systems, Spectral sets, Annotations in formal specifications and proofs, Synchronization trees, Linear time and branching time semantics for recursion with merge, Algebraic domains of natural transformations, Adequacy for a lazy functional language with recursive and polymorphic types, Constructive domain theory as a branch of intuitionistic pointfree topology, On completeness theorems for feature logics, Liminf convergence in \(\Omega\)-categories, Defaults in domain theory, The presence of lattice theory in discrete problems of mathematical social sciences. Why., A note on injective spaces., Probabilistic argumentation systems. A new way to combine logic with probability., Computational topology: Ambient isotopic approximation of 2-manifolds., Ideal models of spaces., Some points in formal topology., Behavioural inverse limit \(\lambda\)-models, Domain theory for concurrency, Presenting locale pullback via directed complete posets, Entailment systems for stably locally compact locales, From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models, On Scott's thesis for domains of information and well-quasi-orderings, Continuously generated fixed points, Recursive domain equations for concrete data structure
