Data Types as Lattices
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Operational domain theory and topology of sequential programming languages
- Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms
- Kleene chain completeness and fixedpoint properties
- Algebraic domain equations
- Algebraic relations and presentations
- Order completion monads
- An effectively given initial semigroup
- Rewrite systems on a lattice of types
- Admissible representations of effective cpo's
- A characterization of Plotkin's order in powerdomains, and some of its properties
- Type 2 recursion theory
- Theory of representations
- On merging software extensions
- Infinite-word languages and continuous mappings
- A characterization of F-complete type assignments
- An algebraic semantics approach to the effective resolution of type equations
- Universal profinite domains
- Two-level semantics and code generation
- Type theories, normal forms, and \(D_{\infty}\)-lambda-models
- Polymorphic type inference and containment
- A mathematical theory of randomized computation. I
- A guided tour of the mathematics of MetaSoft '88
- A small complete category
- 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 - calculus: Connections to higher type recursion theory, proof theory, category theory
- Borel ideals vs. Borel sets of countable relations and trees
- The contraction property is sufficient to guarantee the uniqueness of fixed points of endofunctors in a category of complete metric spaces
- A decidable canonical representation of the compact elements in Scott's reflexive domain in \(P\omega\)
- Algebraic processing of programming languages
- Enlargements of functional algebras for the lambda calculus
- \(\mathbb{T}^\omega\) as a universal domain
- The denotational semantics of sequential machines
- Effectively given domains
- Varieties of chain-complete algebras
- Invertible terms in the lambda calculus
- Petri nets, event structures and domains. I
- Theory construction in psychology: The interpretation and integration of psychological data
- Chain properties in Pomega
- Recursion-closed algebraic theories
- Free upper regular bands
- Tree constructions of free continuous algebras
- Graph grammars and operational semantics
- Fixed point theorems and semantics: A folk tale
- Towards a foundation for semantics in complete metric spaces
- Recursion over realizability structures
- Domain theory in logical form
- Universal homogeneous event structures and domains
- Rewrite, rewrite, rewrite, rewrite, rewrite, \dots
- Quantitative domains and infinitary algebras
- Strictness analysis via abstract interpretation for recursively defined types
- Categories of chain-complete posets
- IO and OI. I
- IO and OI. II
- A theory of type polymorphism in programming
- Data types, abstract data types and their specification problem
- Fixed-point constructions in order-enriched categories
- Denotational semantics of an object-oriented programming language with explicit wrappers
- Coherence and consistency in domains
- A note on complexity measures for inductive classes in constructive type theory
- An algebraic generalization of Frege structures -- binding algebras
- A finite equational axiomatization of the functional algebras for the lambda calculus
- Properly injective spaces and function spaces
- Topology, domain theory and theoretical computer science
- Nominalization, predication and type containment
- Computational foundations of basic recursive function theory
- Set-theoretical and other elementary models of the \(\lambda\)-calculus
- The comparison of a cpo-based semantics with a cms-based semantics for \(CSP\)
- Deductive and inductive synthesis of equational programs
- An algebraic semantics of higher-order types with subtypes
- Testing equivalences for processes
- Linear time and branching time semantics for recursion with merge
- Tree structure for distributive lattices and its applications
- The equational logic of fixed points
- From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models
- On the algebraic models of lambda calculus
- Locally cartesian closed exact completions
- Resource traces: A domain for processes sharing exclusive resources.
- A coinductive completeness proof for the equivalence of recursive types
- Equilogical spaces and algebras for a double-power monad
- Triposes, exact completions, and Hilbert's \(\varepsilon\)-operator
- Extensions of Scott's graph model and Kleene's second algebra
- Can LCF be topped! Flat lattice models of typed \(\lambda{}\)-calculus
- On Scott's thesis for domains of information and well-quasi-orderings
- A unifying theorem for algebraic semantics and dynamic logics
- Continuously generated fixed points
- Retracts of numerations
- Equational logic of circular data type specification
- Building continuous webbed models for system F
- The completeness theorem for typing lambda-terms
- The sequentially realizable functionals
- Intersection and singleton type assignment characterizing finite Böhm-trees
- Effective inseparability in a topological setting
- New perspectives of granular computing in relation geometry induced by pairings
- A Cartesian closed category of domains with almost algebraic bases
- An algebraic theory for data linkage
- Stochastic \(\lambda\)-calculi: an extended abstract
- Sobriety for equilogical spaces
- Anatomy of a domain of continuous random variables. I
- A type-theoretic semantics of arrays
- On paradoxes in normal form
This page was built for publication: Data Types as Lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4103509)
