Name
Abstract | ||
|---|---|---|
We present a realizability model for reasoning about contextual equivalence of higher-order programs with impredicative polymorphism, recursive types, and higher-order mutable state. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1016/j.jlap.2012.03.004 | The Journal of Logic and Algebraic Programming |
Keywords | Field | DocType |
Abstract data types,Logical relations,Local state,Parametricity | Abstract data type,Discrete mathematics,Logical data model,Mathematical proof,Equivalence (measure theory),Impredicativity,Parametricity,Recursion,Realizability,Mathematics | Journal |
Volume | Issue | ISSN |
81 | 4 | 1567-8326 |
Citations | PageRank | References |
1 | 0.35 | 21 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Lars Birkedal | 1 | 1481 | 96.84 |
| Kristian Støvring | 2 | 64 | 6.91 |
| Jacob Thamsborg | 3 | 72 | 5.77 |