The following pages link to (Q3205213):
Displayed 14 items.
- Distributive semantics for nondeterministic typed \(\lambda\)-calculi (Q760418) (← links)
- Expressive power of typed and type-free programming languages (Q761790) (← links)
- An algebraic approach to stable domains (Q917677) (← links)
- Needed reduction and spine strategies for the lambda calculus (Q1097253) (← links)
- Sequential algorithms on concrete data structures (Q1170880) (← links)
- The chemical abstract machine (Q1190491) (← links)
- Historical introduction to ``Concrete domains'' by G. Kahn and G. D. Plotkin (Q1314353) (← links)
- Combinatory reduction systems: Introduction and survey (Q1314356) (← links)
- Stability, sequentiality and demand driven evaluation in dataflow (Q1346605) (← links)
- Sequential evaluation strategies for parallel-or and related reduction systems (Q1825644) (← links)
- Descendants and origins in term rewriting. (Q1854348) (← links)
- A stable programming language (Q2492185) (← links)
- A complete characterization of primitive recursive intensional behaviours (Q3514635) (← links)
- Full abstraction and the Context Lemma (preliminary report) (Q5096215) (← links)