Zobrazeno 1 - 10
of 74
pro vyhledávání: '"Doaitse Swierstra"'
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 106, Iss Proc. TFPIE 2012, Pp 50-62 (2013)
This paper documents our experience using declarative languages to give secondary school students a first taste of Computer Science. The course aims to teach students a bit about programming in Prolog, but also exposes them to important Computer Scie
Externí odkaz:
https://doaj.org/article/5d5d1c1d480242eeafd831ad5e38f2ab
Publikováno v:
Science of Computer Programming. 137:98-124
Compilers, amongst other programs, often work with data that (slowly) changes over time. When the changes between subsequent runs of the compiler are small, one would hope the compiler to incrementally update its results, resulting in much lower rebu
Autor:
Marcos Viera, S. Doaitse Swierstra
Publikováno v:
Science of Computer Programming. 96:211-229
Having extensible languages is appealing, but raises the question of how to construct extensible compilers and how to compose compilers out of a collection of pre-compiled components. We show how having attribute grammar fragments as first-class valu
Autor:
Alberto Pardo, S. Doaitse Swierstra
This book constitutes the proceedings of the 19th Brazilian Symposium on Progamming Languages, SBLP 2015, held in Belo Horizonte, Brazil, in September 2015. The 10 papers presented in this volume were carefully reviewed and selected from 26 submissi
Publikováno v:
Journal of Functional Programming. 14:635-646
A permutation phrase is a sequence of elements (possibly of different types) in which each element occurs exactly once and the order is irrelevant. Some of the permutable elements may be optional. We show how to extend a parser combinator library wit
Publikováno v:
ICFP
We present the derivation of a space efficient parser combinator library: the constructed parsers do not keep unnecessary references to the input, produce online results and efficiently handle ambiguous grammars. The underlying techniques can be appl
Publikováno v:
ICFP
To improve the quality of type error messages in functional programming languages,we propose four techniques which influence the behaviour of constraint-based type inference processes. These techniques take the form of externally supplied type infere
Autor:
Arthur I. Baars, S. Doaitse Swierstra
Publikováno v:
ACM SIGPLAN Notices. 37:157-166
Even when programming in a statically typed language we every now and then encounter statically untypable values; such values result from interpreting values or from communicating with the outside world. To cope with this problem most languages inclu
Publikováno v:
Practical Aspects of Declarative Languages ISBN: 9783319041315
PADL
PADL
The Pandoc program is a versatile tool for converting between document formats. It comes with a great variety of readers, each converting a specific input format into the universal Pandoc format, and a great variety of writers, each mapping a documen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0783c947c65181c5c6342fd24ae8a36f
https://doi.org/10.1007/978-3-319-04132-2_14
https://doi.org/10.1007/978-3-319-04132-2_14
Autor:
Marcos Viera, S. Doaitse Swierstra
Publikováno v:
IFL
Ideally complexity is managed by composing a system out of quite a few, more or less independent, and much smaller descriptions of various aspects of the overall artefact. When describing (extensible) programming languages, attribute grammars have tu