DMCA
Generic Conversions of Abstract Syntax Representations (2012)
| Venue: | PROCEEDINGS OF THE 9TH ACM SIGPLAN WORKSHOP ON GENERIC PROGRAMMING |
| Citations: | 1 - 1 self |
BibTeX
@MISC{Keuchel12genericconversions,
author = {Steven Keuchel and Johan Jeuring},
title = {Generic Conversions of Abstract Syntax Representations},
year = {2012}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
In this paper we present a datatype-generic approach to syntax with variable binding. A universe specifies the binding and scoping structure of object languages, including binders that bind multiple variables as well as sequential and recursive scoping. Two interpretations of the universe are given: one based on parametric higher-order abstract syntax and one on well-typed de Bruijn indices. The former provides convenient interfaces to embedded domain-specific languages, but is awkward to analyse and manipulate directly, while the latter is a convenient representation in implementations, but is unusable as a surface language. We show how to generically convert from the parametric HOAS interpretation to the de Bruijn interpretation thereby taking the pain from DSL developer to write the conversion themselves.
Keyphrases
abstract syntax representation generic conversion parametric hoas interpretation parametric higher-order abstract syntax object language domain-specific language convenient interface variable binding multiple variable datatype-generic approach recursive scoping bruijn interpretation convenient representation scoping structure dsl developer surface language bruijn index
