The following pages link to John C. Reynolds (Q1260642):
Displaying 29 items.
- On functors expressible in the polymorphic typed lambda calculus (Q1260643) (← links)
- Definitional interpreters revisited (Q1290336) (← links)
- Definitional interpreters for higher-order programming languages (Q1290337) (← links)
- Syntactic control of interference for separation logic (Q2942883) (← links)
- (Q3216629) (← links)
- Local reasoning about a copying garbage collector (Q3452262) (← links)
- Separation and information hiding (Q3452266) (← links)
- Theories of Programming Languages (Q3631317) (← links)
- (Q3677139) (← links)
- (Q3932278) (← links)
- (Q4068054) (← links)
- (Q4072829) (← links)
- (Q4080709) (← links)
- Semantics of the Domain of Flow Diagrams (Q4130961) (← links)
- Reasoning about arrays (Q4176940) (← links)
- (Q4178462) (← links)
- (Q4178467) (← links)
- Theories of Programming Languages (Q4226069) (← links)
- (Q4766005) (← links)
- (Q4783297) (← links)
- (Q4855337) (← links)
- The coherence of languages with intersection types (Q5096244) (← links)
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science (Q5465879) (← links)
- From Algol to polymorphic linear lambda-calculus (Q5487826) (← links)
- (Q5585029) (← links)
- GEDANKEN—a simple typeless language based on the principle of completeness and the reference concept (Q5588137) (← links)
- (Q5612475) (← links)
- (Q5624680) (← links)
- Types, abstraction, and parametric polymorphism, part 2 (Q6171748) (← links)