A Simple Take on Typed Abstract Syntax in Haskell-like Languages

Forfattere

  • Olivier Danvy
  • Morten Rhiger

DOI:

https://doi.org/10.7146/brics.v7i34.20169

Resumé

We present a simple way to program typed abstract syntax in a
language following a Hindley-Milner typing discipline, such as Haskell and ML, and we apply it to automate two proofs about normalization functions as embodied in type-directed partial evaluation for the simply typed lambda calculus: normalization functions (1) preserve types and (2) yield long beta-eta normal forms.

Keywords: Type-directed partial evaluation, normalization functions, simply-typed lambda-calculus, higher-order abstract syntax, Haskell.

Downloads

Publiceret

2000-06-04

Citation/Eksport

Danvy, O., & Rhiger, M. (2000). A Simple Take on Typed Abstract Syntax in Haskell-like Languages. BRICS Report Series, 7(34). https://doi.org/10.7146/brics.v7i34.20169

Nummer

Nr. 34 (2000): RS-34 A Simple Take on Typed Abstract Syntax in Haskell-like Languages

Sektion

Artikler

Licens

Authors who publish with this journal agree to the following terms:

    1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.

    1. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.

  1. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).