Pages that link to "Item:Q1327401"

The following pages link to Fully abstract semantics for observably sequential languages (Q1327401):

Displaying 18 items.

• A synthetic theory of sequential domains (Q424548) (← links)
• Historical introduction to ``Concrete domains'' by G. Kahn and G. D. Plotkin (Q1314353) (← links)
• Parallel and serial hypercoherences (Q1583243) (← links)
• The sequentially realizable functionals (Q1849853) (← links)
• A relative PCF-definability result for strongly stable functions and some corollaries (Q1854294) (← links)
• Games and full abstraction for FPC. (Q1854351) (← links)
• Comparing hierarchies of types in models of linear logic (Q1881220) (← links)
• A stable programming language (Q2492185) (← links)
• Locally Boolean domains (Q2566030) (← links)
• Non-Uniform Hypercoherences (Q2842815) (← links)
• Definability and Full Abstraction (Q2864154) (← links)
• Non-uniform (hyper/multi)coherence spaces (Q3081320) (← links)
• Nondeterminism and Observable Sequentiality (Q3644761) (← links)
• Symmetry and Interactivity in Programming (Q4650295) (← links)
• (Q5028431) (← links)
• (Q5111308) (← links)
• Concrete data structures and functional parallel programming (Q5941198) (← links)
• Sequential algorithms for unbounded nondeterminism (Q5971404) (← links)