Data Types as Lattices
From MaRDI portal
Cited in
(only showing first 100 items - show all)- From operational to denotational semantics
- Constructive natural deduction and its ‘ω-set’ interpretation
- Functorial polymorphism
- Denotational semantics of an object-oriented programming language with explicit wrappers
- Type 2 recursion theory
- Using information systems to solve recursive domain equations
- Linear time and branching time semantics for recursion with merge
- From Böhm's theorem to observational equivalences: an informal account
- Retracts of numerations
- Fixed point theorems and semantics: A folk tale
- Codatatypes in ML
- The Wadge order on the Scott domain is not a well-quasi-order
- Sheaf toposes for realizability
- Set-theoretical and other elementary models of the \(\lambda\)-calculus
- Deductive and inductive synthesis of equational programs
- Term rewriting induction
- Actors without Directors: A Kahnian View of Heterogeneous Systems
- CSP is a retract of CCS
- Comparing free algebras in topological and classical domain theory
- Collapsing partial combinatory algebras
- Correctness of compiling polymorphism to dynamic typing
- On the uniqueness of fixed points of endofunctors in a category of complete metric spaces
- The contraction property is sufficient to guarantee the uniqueness of fixed points of endofunctors in a category of complete metric spaces
- Towards a foundation for semantics in complete metric spaces
- Wrapper semantics of an object-oriented programming language with state
- Resource traces: A domain for processes sharing exclusive resources.
- A coinductive completeness proof for the equivalence of recursive types
- A decidable canonical representation of the compact elements in Scott's reflexive domain in \(P\omega\)
- An abstract approach to stratification in linear logic
- Topology-free type structures with conditioning events
- The Scott model of linear logic is the extensional collapse of its relational model
- Stabilized profunctors and stable species of structures
- State-transition machines for lambda-calculus expressions
- The comparison of a cpo-based semantics with a cms-based semantics for \(CSP\)
- Expressing computational complexity in constructive type theory
- A domain-theoretic model of nominally-typed object-oriented programming
- Logic and functional programming by retractions
- Universal profinite domains
- Locally cartesian closed exact completions
- Can LCF be topped! Flat lattice models of typed \(\lambda{}\)-calculus
- Universal homogeneous event structures and domains
- An algebraic generalization of Frege structures -- binding algebras
- Quantitative domains and infinitary algebras
- Graph grammars and operational semantics
- Strictness analysis via abstract interpretation for recursively defined types
- New perspectives of granular computing in relation geometry induced by pairings
- On the construction of stable models of untyped \(\lambda\)-calculus
- Prime algebraicity
- The order-K-ification monads
- A note on complexity measures for inductive classes in constructive type theory
- Sobriety for equilogical spaces
- What is a universal higher-order programming language?
- Gentzen-Mints-Zucker duality
- A mathematical theory of randomized computation. I
- A guided tour of the mathematics of MetaSoft '88
- Continuously generated fixed points
- On stable domains
- Verifying of interface assertions for infinite state Mealy machines
- Categories of chain-complete posets
- Coherent Taylor expansion as a bimonad
- Set relations and set systems induced by some families of integral domains
- Semantics of the second order lambda calculus
- Domain theory in logical form
- Petri nets, event structures and domains. I
- Anatomy of a domain of continuous random variables. II
- IO and OI. II
- In Scott-Strachey style denotational semantics, parallelism implies nondeterminism
- An algebraic approach to stable domains
- Type inference with simple subtypes
- Two models of synthetic domain theory
- scientific article; zbMATH DE number 3909728 (Why is no real title available?)
- An abstract interpretation for ML equality kinds
- Rétractions et interprétation interne du polymorphisme : le problème de la rétraction universelle
- scientific article; zbMATH DE number 7243674 (Why is no real title available?)
- The equational logic of fixed points
- Infinite-word languages and continuous mappings
- A finite equational axiomatization of the functional algebras for the lambda calculus
- Classifying topoi in synthetic guarded domain theory
- On the computational content of the Lawson topology
- \(\mathbb{T}^\omega\) as a universal domain
- Computability in higher types, P and the completeness of type assignment
- Convex powerdomains. I
- A stable universal domain related to \(\mathbb{T}^{\omega}\)
- Rewrite, rewrite, rewrite, rewrite, rewrite, \dots
- scientific article; zbMATH DE number 3818648 (Why is no real title available?)
- Trees from functions as processes
- Algebraic processing of programming languages
- The denotational semantics of sequential machines
- Computability and realizability for interactive computations
- Intersection types for \(\lambda\)-trees
- From term models to domains
- On the ubiquity of certain total type structures
- Properly injective spaces and function spaces
- From parametric polymorphism to models of polymorphic FPC
- On combinatory algebras and their expansions
- Unified algebras and action semantics
- Varieties of chain-complete algebras
- Assertions and recursions
- R n - and G n -logics
- Completeness of type assignment in continuous lambda models
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)
