Title | Citations | PageRank | Year |
---|---|---|---|
Variations on realizability: realizing the propositional axiom of choice | 0 | 0.34 | 2002 |
On full abstraction for PCF: I, II, and III | 251 | 9.55 | 2000 |
The S-Replete Constuction | 8 | 1.00 | 1995 |
Pi-Calculus, Dialogue Games and PCF | 30 | 1.51 | 1995 |
Modified Realizability Toposes and Strong Normalization Proofs | 13 | 1.70 | 1993 |
Algebraic types in PER models | 12 | 1.59 | 1989 |
A survey of some useful partial order relations on terms of the lambda calculus | 2 | 0.40 | 1975 |