The following pages link to (Q4160405):
Displaying 50 items.
- On the largest Cartesian closed category of stable domains. (Q276408) (← links)
- \(\mathbb T^\omega\) as a stable universal domain. (Q276416) (← links)
- Atomicity, coherence of information, and point-free structures (Q290637) (← links)
- Cartesian closed subcategories of \(\mathrm{CONT}_\ll^\ast\) (Q304184) (← links)
- Visible acyclic differential nets. I: Semantics (Q409321) (← links)
- The Scott model of linear logic is the extensional collapse of its relational model (Q418011) (← links)
- On the largest Cartesian closed category of stable domains (Q517047) (← links)
- Preface to the special volume (Q534064) (← links)
- The largest cartesian closed category of stable domains (Q671652) (← links)
- On maximal stable functions (Q673145) (← links)
- Stable domains are generalized topological spaces (Q685417) (← links)
- On stable domains (Q685428) (← links)
- Forcing in stable models of untyped \(\lambda\)-calculus (Q698623) (← links)
- Exponentials in a Cartesian closed category which contains all algebraic domains (Q748705) (← links)
- Stability and computability in coherent domains (Q752707) (← links)
- Distributive semantics for nondeterministic typed \(\lambda\)-calculi (Q760418) (← links)
- Expressive power of typed and type-free programming languages (Q761790) (← links)
- Retractions of dI-domains as a model for Type:Type (Q805221) (← links)
- Prime algebraicity (Q843107) (← links)
- A logical approach to stable domains (Q859843) (← links)
- Implementing term rewrite languages in DACTL (Q912591) (← links)
- An algebraic approach to stable domains (Q917677) (← links)
- Uniformity and the Taylor expansion of ordinary lambda-terms (Q944386) (← links)
- Normal functors, power series and \(\lambda\)-calculus (Q1103618) (← links)
- A quantitative interpretation of Girard's System F (Q1107514) (← 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)
- Sequential algorithms on concrete data structures (Q1170880) (← links)
- Universal homogeneous event structures and domains (Q1175945) (← links)
- Stable neighbourhoods (Q1185012) (← links)
- Towards a theory of parallel algorithms on concrete data structures (Q1194326) (← links)
- \(dI\)--domains as prime information systems (Q1198950) (← links)
- Coherence and consistency in domains (Q1262787) (← links)
- Categories of embeddings (Q1263665) (← links)
- Representation of computations in concurrent automata by dependence orders (Q1269906) (← 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)
- A natural semantics of first-order type dependency (Q1314402) (← links)
- Stability, sequentiality and demand driven evaluation in dataflow (Q1346605) (← links)
- Stable power domains (Q1349652) (← links)
- Algebraic domains of natural transformations (Q1349657) (← links)
- Stone duality and representation of stable domain (Q1368465) (← links)
- Glueing and orthogonality for models of linear logic (Q1398466) (← links)
- From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models (Q1583485) (← links)
- Relative definability of boolean functions via hypergraphs (Q1605175) (← links)
- A partial solution to an open problem of Amadio and Curien (Q1753999) (← links)
- Domain theoretic models of polymorphism (Q1824612) (← links)
- Sequential evaluation strategies for parallel-or and related reduction systems (Q1825644) (← links)
- The sequentially realizable functionals (Q1849853) (← links)
- Contextual Petri nets, asymmetric event structures, and processes (Q1854468) (← links)
- Order-incompleteness and finite lambda reduction models (Q1884896) (← links)
