The following pages link to (Q3664454):
Displayed 19 items.
- Cartesian closed categories of algebraic cpos (Q584381) (← links)
- Closures and fairness in the semantics of programming logic (Q799098) (← links)
- From intervals to domains: towards a general description of validated uncertainty, with potential applications to geospatial and meteorological data (Q861921) (← links)
- Two-level semantics and abstract interpretation (Q911319) (← links)
- A categorial approach to the theory of computation (Q911584) (← links)
- Domain interpretations of Martin-Löf's partial type theory (Q916656) (← links)
- Parametric \(\lambda \)-theories (Q930867) (← links)
- Kleene chain completeness and fixedpoint properties (Q1052104) (← links)
- Universal profinite domains (Q1093371) (← links)
- Two-level semantics and code generation (Q1095636) (← links)
- A safe approach to parallel combinator reduction (Q1095642) (← links)
- Fully abstract submodels of typed lambda calculi (Q1095880) (← links)
- Coherence and consistency in domains (Q1262787) (← links)
- On a generalized product for domains (Q1311968) (← links)
- Type inference, abstract interpretation and strictness analysis (Q1314350) (← links)
- A ``geometric'' view of the dynamics of trajectories of computer programs (Q1813776) (← links)
- Categorical fixed point semantics (Q1813970) (← links)
- Fixed points and closure operators: Programmological aspects (Q1907780) (← links)
- Effective inseparability in a topological setting (Q1923565) (← links)