作者: Lars Birkedal , Kristian Støvring , Jacob Thamsborg
DOI: 10.1016/J.JLAP.2012.03.004
关键词:
摘要: We present a realizability model for reasoning about contextual equivalence of higher-order programs with impredicative polymorphism, recursive types, and mutable state. The combines the virtues two recent earlier models: (1) Ahmed, Dreyer, Rossberg’s step-indexed logical relations model, which was designed to facilitate proofs representation independence \state-dependent" ADTs (2) Birkedal, Stvring, Thamsborg’s abstract without tedious step-index arithmetic. resulting can be used give ADTs.