Just Testing

  • Archive
  • RSS

Converting typed term representations: from HOAS to de Bruijn.

Given a GADT representation of a typed higher-order term language using higher-order abstract syntax (HOAS), it is more difficult to convert to an alternative GADT representation using de Bruijn indices for bound variables than I at first expected.  Here is a solution using explicit type representations (with Data.Typeable).

    • #haskell
    • #GADTs
  • 3 years ago
  • Permalink
Share

Short URL

TwitterFacebookPinterestGoogle+
← Previous • Next →

About

Avatar

I research and teach programming languages, compilers, and their applications at the University of New South Wales (UNSW), Sydney. My main interest is in functional and parallel programming. Most of my code is in Haskell.

You can find me on App.net (preferred) and Twitter, or on GitHub. Check out my UNSW website.

  • RSS
  • Random
  • Archive
  • Mobile
Effector Theme by Pixel Union