Outrageous but meaningful coincidences: dependent type-safe syntax and evaluation

Research output: Chapter in Book/Report/Conference proceedingConference contribution book

20 Citations (Scopus)

Abstract

Tagless interpreters for well-typed terms in some object language are a standard example of the power and benefit of precise indexing in types, whether with dependent types, or generalized algebraic datatypes. The key is to reflect object language types as indices (however they may be constituted) for the term datatype in the host language, so that host type coincidence ensures object type coincidence. Whilst this technique is widespread for simply typed object languages, dependent types have proved a tougher nut with nontrivial computation in type equality. In their type-safe representations, Danielsson [2006] and Chapman [2009] succeed in capturing the equality rules, but at the cost of representing equality derivations explicitly within terms. This article constructs a type-safe representation for a dependently typed object language, dubbed KIPLING, whose computational type equality just appropriates that of its host, Agda. The KIPLING interpreter example is not merely de rigeur - it is key to the construction. At the heart of the technique is that key component of generic programming, the universe.
Original languageEnglish
Title of host publicationProceedings of the 6th ACM SIGPLAN workshop on Generic programming
Place of PublicationNew York
Pages1-12
Number of pages12
DOIs
Publication statusPublished - 2010
EventWGP 2010 - Baltimore, United States
Duration: 26 Sep 201026 Sep 2010

Conference

ConferenceWGP 2010
CountryUnited States
CityBaltimore
Period26/09/1026/09/10

Keywords

  • programming techniques
  • applicative programming
  • functional programming
  • design
  • languages
  • theory

Cite this