The following pages link to E. A. Ashcroft (Q1152948):
Displaying 15 items.
- A mathematical semantics for a nondeterministic typed lambda-calculus (Q1152949) (← links)
- Proving assertions about parallel programs (Q1215264) (← links)
- Remarks on 'Program proving: Jumps and functions' by M. Clint and C.A.R. Hoare (Q1225928) (← links)
- A generalized setting for fixpoint theory (Q1259161) (← links)
- Translating Program Schemas to While-Schemas (Q3214370) (← links)
- (Q3678639) (← links)
- (Q3776591) (← links)
- R for Semantics (Q3936221) (← links)
- Decidable Properties of Monadic Functional Schemas (Q4041106) (← links)
- (Q4062665) (← links)
- Lucid, a nonprocedural language with iteration (Q4130974) (← links)
- Lucid—A Formal System for Writing and Proving Programs (Q4136511) (← links)
- (Q4138082) (← links)
- (Q4159365) (← links)
- (Q5679697) (← links)