Unembedding Domain-Specific Languages

被引:0
作者
Atkey, Robert [1 ]
Lindley, Sam [1 ]
Yallop, Jeremy [1 ]
机构
[1] Univ Edinburgh, Sch Informat, LFCS, Edinburgh EH8 9YL, Midlothian, Scotland
来源
HASKELL'09: PROCEEDINGS OF THE 2009 ACM SIGPLAN HASKELL SYMPOSIUM | 2009年
关键词
domain-specific languages; higher-order abstract syntax; type classes; unembedding; SYNTAX;
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Higher-order abstract syntax provides a convenient way of embedding domain-specific languages, but is awkward to analyse and manipulate directly. We explore the boundaries of higher-order abstract syntax. Our key tool is the unembedding of embedded terms as de Bruijn terms, enabling intensional analysis. As part of our solution we present techniques for separating the definition of an embedded program from its interpretation, giving modular extensions of the embedded language, and different ways to encode the types of the embedded language.
引用
收藏
页码:37 / 48
页数:12
相关论文
共 45 条
[1]  
ABADI M, 1993, P POPL 93 NEW YORK N, P157
[2]  
*ADGA2 DEV TEAM, AGDA2 WEBS
[3]  
ALONSO C, 1940, J SYMBOLIC LOGIC, V5, P56
[4]  
[Anonymous], P 23 ACM SIGPLAN SIG
[5]  
[Anonymous], COQ PROOF ASS REF MA
[6]  
Appel A. W., 1997, Journal of Functional Programming, V7, P515, DOI 10.1017/S0956796897002839
[7]  
Atkey R, 2009, LECT NOTES COMPUT SC, V5608, P35, DOI 10.1007/978-3-642-02273-9_5
[8]   Parameterised notions of computation [J].
Atkey, Robert .
JOURNAL OF FUNCTIONAL PROGRAMMING, 2009, 19 :335-376
[9]  
Augustsson L, 2008, ICFP'08: PROCEEDINGS OF THE 2008 SIGPLAN INTERNATIONAL CONFERENCE ON FUNCTIONAL PROGRAMMING, P225
[10]  
BAARS AI, 2002, 1CFP 02, P157