The following pages link to (Q4040912):
Displaying 29 items.
- There is no fully abstract fixpoint semantics for non-deterministic languages with infinite computations (Q286953) (← links)
- Full abstraction for Reduced ML (Q388212) (← links)
- A direct characterization of completion (Q672756) (← links)
- Semantical analysis of specification logic (Q913527) (← links)
- Full abstraction and limiting completeness in equational languages (Q1121676) (← links)
- The semantics of the combination of atomized statements and parallel choice (Q1267037) (← links)
- On the approximation of denotational mu-semantics (Q1306709) (← links)
- Fully abstract denotational models for nonuniform concurrent languages (Q1341758) (← links)
- Full abstraction and recursion (Q1365671) (← links)
- Full abstraction for the second order subset of an Algol-like language (Q1369235) (← links)
- Full abstraction for PCF (Q1854394) (← links)
- Concurrent testing of processes (Q1902297) (← links)
- A blocking model for reactive objects (Q1918937) (← links)
- From operational semantics to domain theory (Q1923089) (← links)
- Types and full abstraction for polyadic \(\pi\)-calculus (Q2387197) (← links)
- A uniform approach to completions of posets (Q2423773) (← links)
- Infinite trace equivalence (Q2474445) (← links)
- On dynamically generated ontology translators in agent communication (Q2739004) (← links)
- Infinite trace equivalence (Q2852364) (← links)
- Modelling Local Variables: Possible Worlds and Object Spaces (Q3178266) (← links)
- Relating full abstraction results for different programming languages (Q3976061) (← links)
- A categorical foundation for structured reversible flowchart languages: Soundness and adequacy (Q4585070) (← links)
- A Higher-Order Calculus of Computational Fields (Q4617982) (← links)
- On abstraction and the expressive power of programming languages (Q5096222) (← links)
- Formal models for some features of programming languages (Q5402520) (← links)
- Equationally fully abstract models of PCF (Q5887519) (← links)
- Sequential functions on indexed domains and full abstraction for a sub-language of PCF (Q5890055) (← links)
- From operational to denotational semantics (Q6116563) (← links)
- Continuous functions and parallel algorithms on concrete data structures (Q6116580) (← links)
