The following pages link to (Q3698292):
Displaying 10 items.
- Nondeterministic flowchart programs with recursive procedures: Semantics and correctness. I (Q1143165) (← links)
- Recursion-closed algebraic theories (Q1157899) (← links)
- Denotational models for programming languages: Applications of Banach's fixed point theorem (Q1295293) (← links)
- Computing in unpredictable environments: semantics, reduction strategies, and program transformations (Q1389440) (← links)
- On the structural properties of the set of fixpoints for nondeterministic recursive definitions (Q1915506) (← links)
- (Q3723678) (← links)
- Comparaison et équivalence de sémantiques pour les schémas de programmes non déterministes (Q3774922) (← links)
- Programs, Recursion and Unbounded Choice (Q4023579) (← links)
- (Q5740430) (← links)
- Computing in unpredictable environments: Semantics, reduction strategies, and program transformations (Q5878908) (← links)