The following pages link to (Q3959414):
Displayed 50 items.
- Re-visiting axioms of information systems (Q259056) (← links)
- Unification of several distance functions and a common fixed point result (Q269952) (← links)
- Representations of algebraic domains and algebraic L-domains by information systems (Q276406) (← links)
- On the largest Cartesian closed category of stable domains. (Q276408) (← links)
- A domain-theoretic model of nominally-typed object-oriented programming (Q276420) (← links)
- A note on finitely derived information systems (Q276427) (← links)
- Formal contexts for algebraic domains (Q276430) (← links)
- Some corollaries of the correspondence between partial metrics and multivalued equalities (Q277333) (← links)
- Atomicity, coherence of information, and point-free structures (Q290637) (← links)
- A survey of constraint-based programming paradigms (Q458465) (← links)
- Natural congruences and isomorphism theorems for directed complete partially ordered sets (Q509532) (← links)
- On the largest Cartesian closed category of stable domains (Q517047) (← links)
- Proving concurrent constraint programming correct, revisited (Q530860) (← links)
- Topology vs generalized rough sets (Q541823) (← links)
- A fully abstract may testing semantics for concurrent objects (Q557787) (← links)
- Convex powerdomains. I (Q581432) (← links)
- The patch construction is dual to algebraic DCPO representation (Q633791) (← links)
- Locatedness and overt sublocales (Q638474) (← links)
- Formal neighbourhoods, combinatory Böhm trees, and untyped normalization by evaluation (Q651316) (← links)
- A fixed point theorem in partial quasi-metric spaces and an application to software engineering (Q668250) (← links)
- A compositional semantic basis for the analysis of equational Horn programs (Q671509) (← links)
- Nondeterminism and infinite computations in constraint programming (Q671989) (← links)
- Filter models for conjunctive-disjunctive \(\lambda\)-calculi (Q672044) (← links)
- Quasi-prime algebraic domains (Q672133) (← links)
- Equational theories for inductive types (Q678762) (← links)
- A presentation of the initial lift-algebra (Q678845) (← links)
- I-categories as a framework for solving domain equations (Q685401) (← links)
- Logical foundations for programming semantics (Q685420) (← links)
- Graph rewriting for a partial ordering semantics of concurrent constraints programming (Q685459) (← links)
- Subrecursive hierarchies on Scott domains (Q688507) (← links)
- The probabilistic powerdomain for stably compact spaces (Q703479) (← links)
- Computer theorem proving in mathematics (Q704001) (← links)
- Quotient-reflective and bireflective subcategories of the category of preordered sets (Q719745) (← links)
- A note on inconsistencies caused by fixpoints in a cartesian closed category (Q749648) (← links)
- Inverse image analysis generalises strictness analysis (Q751835) (← links)
- Functorial polymorphism (Q753948) (← links)
- Type inference with recursive types: Syntax and semantics (Q756435) (← links)
- Ambiguous representations of semilattices, imperfect information, and predicate transformers (Q781536) (← links)
- Using information systems to solve recursive domain equations (Q808273) (← links)
- First order theories for partial models (Q813079) (← links)
- Modeling misconceptions in knowledge space theory (Q826913) (← links)
- Generalised information systems capture L-domains (Q831140) (← links)
- A logical approach to stable domains (Q859843) (← links)
- On the relations between monadic semantics (Q879354) (← links)
- A new generic scheme for functional logic programming with constraints (Q880985) (← links)
- A representation of L-domains by information systems (Q896923) (← links)
- Two-level semantics and abstract interpretation (Q911319) (← links)
- The Hoare and Symth power domain constructors commute under composition (Q912880) (← links)
- Non-deterministic information systems and their domains (Q914401) (← links)
- Semantics of types for database objects (Q915443) (← links)