Typed Self-Interpretation by Pattern Matching

Publication Type:
Conference Proceeding
The 16th ACM SIGPLAN International Conference on Functional Programming, 2011, pp. 247 - 258
Issue Date:
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2011001714OK.pdf1.17 MB
Adobe PDF
Self-interpreters can be roughly divided into two sorts: self-recognisers that recover the input program from a canonical representation, and self-enactors that execute the input program. Major progress for statistically-typed languages was achieved in 2009 by Rendal, Ostermann, and Hofer who presented the first typed self-recogniser that allows representations of different terms to have different types. A key feature of their type system is a type:type rule that renders the kind system of their language inconsistent.
Please use this identifier to cite or link to this item: