Asynchronous games 2: The true concurrency of innocence

On Full Abstraction for PCF: I, II, and III

J. M. E. Hyland, C.-H. Luke Ong · Information and Computation · 2000 · 640 citations · Full text

Full Abstraction, Computational Complexity Theory, Abstract Interpretation +1

Concurrent Program Schemes and their Interpretations

Antoni Mazurkiewicz · DAIMI Report Series · 1977 · 567 citations · Full text

Engineering, Concurrent Program Schemes, Verification +18

Fully abstract models of typed λ-calculi

Robin Milner · Theoretical Computer Science · 1977 · 474 citations · Full text

Engineering, Typed λ-Calculi, Automated Reasoning +4

Term rewriting and all that

Computers & Mathematics with Applications · 1998 · 253 citations

Term Rewriting, Terminology Management, Syntax +7

Modeling concurrency with geometry

Vaughn Pratt · 1991 · 210 citations · Full text