|
|
|
|
Trees that grow
|
|
|
|
|
|
|
|
نویسنده
|
najd s. ,jones s.p.
|
|
منبع
|
journal of universal computer science - 2017 - دوره : 23 - شماره : 1 - صفحه:42 -62
|
|
چکیده
|
We study the notion of extensibility in functional data types,as a new approach to the problem of decorating abstract syntax trees with additional information. we observed the need for such extensibility while redesigning the data types representing haskell abstract syntax inside glasgow haskell compiler (ghc). specifically,we describe a programming idiom that exploits type-level functions to allow a particular form of extensibility. the approach scales to support existentials and generalised algebraic data types,and we can use pattern synonyms to make it convenient in practice. © j.ucs.
|
|
کلیدواژه
|
Algebraic data types; Expression problem; Extensible data types; Functional programming; Haskell; Open data types; Pattern matching; Tree decoration tree annotation
|
|
آدرس
|
laboratory for foundations of computer science,the university of edinburgh,scotland, United Kingdom, microsoft research,cambridge, United Kingdom
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|