The following pages link to (Q3756499):
Displaying 10 items.
- Domain theory in logical form (Q1174593) (← links)
- About primitive recursive algorithms (Q1176246) (← links)
- Towards a theory of parallel algorithms on concrete data structures (Q1194326) (← links)
- A specification structure for deadlock-freedom of synchronous processes (Q1960536) (← links)
- Definability and Full Abstraction (Q2864154) (← links)
- What is a universal higher-order programming language? (Q4630303) (← links)
- Full abstraction and the Context Lemma (preliminary report) (Q5096215) (← links)
- Redexes are stable in the λ-calculus (Q5269004) (← links)
- Sequential functions on indexed domains and full abstraction for a sub-language of PCF (Q5890055) (← links)
- Concrete data structures and functional parallel programming (Q5941198) (← links)