## A Well-typed Interpreter for a Dependently Typed LanguageA Well-typed Interpreter for a Dependently Typed Language ## AbstractGADTs are often introduced with the "well-typed interpreter" example. A simple programming language is encoded as a GADT in such a way that only well-typed terms can be defined, and then an interpreter which cannot get stuck is implemented. I'll show how to do this for a dependently typed lambda calculus, in the dependently typed meta-language AgdaLight. To accomplish this I'll use inductive-recursive families, a generalisation of GADTs. Nils Anders DanielssonDisclaimer Last updated Sat Feb 16 14:24:14 UTC 2008. |