Normalization by evaluation with typed abstract syntax
In higher-order abstract syntax, the variables and bindings of an object language are represented by variables and bindings of a meta-language. Let us consider the simply typed λ-calculus as object language and Haskell as meta-language. For concreteness, we also throw in integers and addition, but o...
Gespeichert in:
Veröffentlicht in: | Journal of functional programming 2001-11, Vol.11 (6), p.673-680 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | In higher-order abstract syntax, the variables and bindings of an object language are
represented by variables and bindings of a meta-language. Let us consider the simply
typed λ-calculus as object language and Haskell as meta-language. For concreteness,
we also throw in integers and addition, but only in this section. |
---|---|
ISSN: | 0956-7968 1469-7653 |
DOI: | 10.1017/S0956796801004166 |