Typed self-interpretation by pattern matching

  title={Typed self-interpretation by pattern matching},
  author={C. Barry Jay and Jens Palsberg},
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 statically-typed languages was achieved in 2009 by Rendel, 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… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 2 times over the past 90 days. VIEW TWEETS

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
11 Extracted Citations
12 Extracted References
Similar Papers

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 12 references

λ-definability and recursiveness

  • Stephen C. Kleene
  • Duke Math. J.,
  • 1936
Highly Influential
8 Excerpts

Similar Papers

Loading similar papers…