The following pages link to (Q3959414):
Displayed 50 items.
- An algebraic approach to stable domains (Q917677) (← links)
- Contractions in comparing concurrency semantics (Q919834) (← links)
- An irregular filter model (Q930872) (← links)
- On computational environments of topological spaces (Q949611) (← links)
- Information systems revisited -- the general continuous case (Q949623) (← links)
- Machine semantics (Q959818) (← links)
- The multiple facets of the canonical direct unit implicational basis (Q974107) (← links)
- Ordinal decompositions for preordered root systems (Q1035655) (← links)
- On some definition of physical state (Q1059065) (← links)
- On powerdomains and modality (Q1067409) (← links)
- A characterization of F-complete type assignments (Q1089331) (← links)
- The system \({\mathcal F}\) of variable types, fifteen years later (Q1091379) (← links)
- An algebraic semantics approach to the effective resolution of type equations (Q1093359) (← links)
- A refinement of strong sequentiality for term rewriting with constructors (Q1093366) (← links)
- Universal profinite domains (Q1093371) (← links)
- Two-level semantics and code generation (Q1095636) (← links)
- Hilbert space representation of time evolution of pure states (Q1101559) (← links)
- Type theories, normal forms, and \(D_{\infty}\)-lambda-models (Q1102936) (← links)
- Normal functors, power series and \(\lambda\)-calculus (Q1103618) (← links)
- A quantitative interpretation of Girard's System F (Q1107514) (← links)
- Semantics of production systems (Q1110314) (← links)
- Attributes and rough properties in information systems (Q1110351) (← links)
- On Church's formal theory of functions and functionals. The \(\lambda\)- calculus: Connections to higher type recursion theory, proof theory, category theory (Q1120558) (← links)
- Full abstraction and limiting completeness in equational languages (Q1121676) (← links)
- Event structures and domains (Q1124367) (← links)
- Domain theory in logical form (Q1174593) (← links)
- Recursive types for Fun (Q1176245) (← links)
- A semantics for complex objects and approximate answers (Q1176289) (← links)
- Relation algebraic domain constructions (Q1177156) (← links)
- Towards a semantics-based information theory (Q1179806) (← links)
- Using powerdomains to generalize relational databases (Q1183586) (← links)
- Domains for logic programming (Q1185016) (← links)
- Strictness analysis via abstract interpretation for recursively defined types (Q1193597) (← links)
- Some economic applications of Scott domains (Q1196207) (← links)
- \(dI\)--domains as prime information systems (Q1198950) (← links)
- Total sets and objects in domain theory (Q1210138) (← links)
- Coherence and consistency in domains (Q1262787) (← links)
- Categories of embeddings (Q1263665) (← links)
- Infinite \(\lambda\)-calculus and types (Q1275621) (← links)
- A fully abstract semantics for concurrent constraint programming (Q1275748) (← links)
- Logic programs, well-orderings, and forward chaining (Q1295428) (← links)
- \({\mathcal M}^\omega\) considered as a programming language (Q1304541) (← links)
- A note on fuzzy power relations (Q1311886) (← links)
- On a generalized product for domains (Q1311968) (← links)
- Type inference, abstract interpretation and strictness analysis (Q1314350) (← links)
- Historical introduction to ``Concrete domains'' by G. Kahn and G. D. Plotkin (Q1314353) (← links)
- Set-theoretical and other elementary models of the \(\lambda\)-calculus (Q1314361) (← links)
- An abstract machine for concurrent modular systems: CHARM (Q1314422) (← links)
- Type inference with partial types (Q1318726) (← links)
- Information categories (Q1320330) (← links)