A correspondence between type checking via reduction and type checking via evaluation

Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal article

    Ilya Sergey, Dave Clark, DistriNet & IBBT, Dept. Computer Science, Katholieke Universiteit Leuven, Netherlands
We describe a derivational approach to proving the equivalence of different representations of a type system. Different ways of representing type assignments are convenient for particular applications such as reasoning or implementation, but some kind of correspondence between them should be proven. In this paper we address two such semantics for type checking: one, due to Kuan et al., in the form of a term rewriting system and the other in the form of a traditional set of derivation rules. By employing a set of techniques investigated by Danvy et al., we mechanically derive the correspondence between a reduction-based semantics for type checking and a traditional one in the form of derivation rules, implemented as a recursive descent. The correspondence is established through a series of semantics-preserving functional program transformations.
Original languageEnglish
JournalInformation Processing Letters
Issue number1-2
Pages (from-to)13-20
Number of pages8
StatePublished - 2012

See relations at Aarhus University Citationformats

ID: 40585470