The following pages link to (Q4385538):
Displaying 50 items.
- Representations of algebraic domains and algebraic L-domains by information systems (Q276406) (← links)
- Data cleaning and query answering with matching dependencies and matching functions (Q359881) (← links)
- Inverse-limit and topological aspects of abstract interpretation (Q418811) (← links)
- Reasoning about orchestrations of web services using partial correctness (Q469344) (← links)
- The largest cartesian closed category of stable domains (Q671652) (← links)
- Exponentials in a Cartesian closed category which contains all algebraic domains (Q748705) (← links)
- Generalised information systems capture L-domains (Q831140) (← links)
- A new generic scheme for functional logic programming with constraints (Q880985) (← links)
- A representation of L-domains by information systems (Q896923) (← links)
- Information systems revisited -- the general continuous case (Q949623) (← links)
- Behaviour approximated on subgroups (Q1030197) (← links)
- A characterization of distance between 1-bounded compact ultrametric spaces through a universal space (Q1127530) (← links)
- Recursive types for Fun (Q1176245) (← links)
- Some economic applications of Scott domains (Q1196207) (← links)
- The mixed powerdomain (Q1199543) (← links)
- Direct product decompositions of lattices, closures and relation schemes (Q1210557) (← links)
- Coherence and consistency in domains (Q1262787) (← links)
- A general theory of action languages (Q1286273) (← links)
- A note on fuzzy power relations (Q1311886) (← links)
- On a generalized product for domains (Q1311968) (← links)
- Rendez-vous with metric semantics (Q1313370) (← links)
- Historical introduction to ``Concrete domains'' by G. Kahn and G. D. Plotkin (Q1314353) (← links)
- A type-theoretical alternative to ISWIM, CUCH, OWHY (Q1314363) (← links)
- Algebraic domains of natural transformations (Q1349657) (← links)
- A fuzzy language. (Q1426245) (← links)
- Type dependencies for logic programs using ACI-unification (Q1575243) (← links)
- Constructive design of a hierarchy of semantics of a transition system by abstract interpretation (Q1605224) (← links)
- An extension of a Y. C. Yang theorem (Q1701728) (← links)
- On the congruence lattice of a Scott-domain (Q1802264) (← links)
- Normalization, approximation, and semantics for combinator systems (Q1853619) (← links)
- Reasoning with power defaults (Q1882904) (← links)
- A compositional dataflow semantics for Petri nets (Q1902302) (← links)
- The powerset operator on abstract interpretations (Q1960538) (← links)
- Compact continuous \(L\)-domains (Q1963068) (← links)
- Logic of convex order (Q2062214) (← links)
- Cartesian closed categories of separable Scott domains (Q2253174) (← links)
- On fixed point theory in partially ordered sets and an application to asymptotic complexity of algorithms (Q2331702) (← links)
- A remark about algebraicity in complete partial orders (Q2366057) (← links)
- Semantics of a sequential language for exact real-number computation (Q2373708) (← links)
- On quasi-metric aggregation functions and fixed point theorems (Q2445564) (← links)
- A relational account of call-by-value sequentiality (Q2506495) (← links)
- A declarative debugging system for lazy functional logic programs (Q2841290) (← links)
- Oscillating Behavior of Logic Programs (Q2900531) (← links)
- An Action Semantics Based on Two Combinators (Q3184751) (← links)
- Abstract Interpretation from a Topological Perspective (Q3392931) (← links)
- Monotone Relations, Fixed Points and Recursive Definitions (Q3600566) (← links)
- Modelling of Complex Software Systems: A Reasoned Overview (Q3613056) (← links)
- (Q4302937) (← links)
- Toward a semantics for the QUEST language (Q4365022) (← links)
- Domain mu-calculus (Q4460689) (← links)
