CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

A generic abstract syntax model for embedded languages

Emil Axelsson (Institutionen för data- och informationsteknik, Programvaruteknik (Chalmers))
17th ACM SIGPLAN International Conference on Functional Programming, ICFP 2012. Copenhagen, 9 - 15 September 2012 (0362-1340). Vol. 47 (2012), 9, p. 323-334.
[Konferensbidrag, refereegranskat]

Representing a syntax tree using a data type often involves having many similar-looking constructors. Functions operating on such types often end up having many similar-looking cases. Different languages often make use of similar-looking constructions. We propose a generic model of abstract syntax trees capable of representing a wide range of typed languages. Syntactic constructs can be composed in a modular fashion enabling reuse of abstract syntax and syntactic processing within and across languages. Building on previous methods of encoding extensible data types in Haskell, our model is a pragmatic solution to Wadler's "expression problem". Its practicality has been confirmed by its use in the implementation of the embedded language Feldspar.

Nyckelord: embedded domain-specific languages, generic programming, the expression problem

Den här publikationen ingår i följande styrkeområden:

Läs mer om Chalmers styrkeområden  

Denna post skapades 2012-11-14. Senast ändrad 2017-10-17.
CPL Pubid: 166054


Läs direkt!

Länk till annan sajt (kan kräva inloggning)