Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Arie Middelkoop"'
Autor:
Bastiaan Heeren, Stefan Holdermans, Eelco Dolstra, Jurriaan Hage, John van Schie, Johan Jeuring, Alexey Rodriguez, Clara Löh, Arie Middelkoop, Andres Löh
Publikováno v:
ICFP
Scopus-Elsevier
Scopus-Elsevier
The ICFP programming contest is a 72-hour contest, which attracts thousands of contestants from all over the world. In this report we describe what it takes to organise this contest, the main ideas behind the contest we organised, the task, how to so
Publikováno v:
LDTA
The Utrecht University Attribute Grammar Compiler takes attribute grammar declarations from multiple source files and generates an attribute grammar evaluator consisting of a single Haskell source text. The problem with such generative approaches is
Publikováno v:
Implementation and Application of Functional Languages ISBN: 9783642344060
IFL
IFL
Within the context of the FITTEST project, one of our tasks was to instrument ActionScript bytecode, so that aspects of the execution of the running application are logged. Although the decision what to log and when requires manual intervention, the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0acd32c248741616b8a8280533ea0711
https://doi.org/10.1007/978-3-642-34407-7_1
https://doi.org/10.1007/978-3-642-34407-7_1
Publikováno v:
Practical Aspects of Declarative Languages ISBN: 9783642276934
PADL
PADL
Attribute Grammars (AGs) are a powerful tool for defining an executable semantics of a programming language, and thus for implementing a compiler. An execution plan for an AG determines a static evaluation order for the attributes which are defined a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b11c7acd4f0116b33dbd3e9d2751af7e
https://doi.org/10.1007/978-3-642-27694-1_14
https://doi.org/10.1007/978-3-642-27694-1_14
Publikováno v:
LDTA
Attribute Grammars are a powerful formalism to specify and implement the semantics of programming languages (e.g. as in a compiler), in particular when the semantics are syntax directed. Advanced type systems, however, use nondeterminism in their spe
Publikováno v:
Implementation and Application of Functional Languages ISBN: 9783642242755
IFL
IFL
Attribute Grammars (AGs) are a domain-specific language for functional and composable descriptions of tree traversals. Given such a description, it is not immediately clear how to state and prove properties of AGs formally. To meet this challenge, we
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::96697c00cdd394649897d427645bf4eb
https://dspace.library.uu.nl/handle/1874/210223
https://dspace.library.uu.nl/handle/1874/210223
Publikováno v:
GPCE
Type inference is the process of constructing a typing derivation while gradually discovering type information. During this process, inference algorithms typically make subtle decisions based on the derivation constructed so far. Because a typing der
Publikováno v:
PODC
Twilight STM enhances a transaction with twilight code that executes between the preparation to commit the transaction and its actual commit or abort. Twilight code runs irrevocably and concurrently with the rest of the program. It can detect and rep
Publikováno v:
ICFP
Sharing analysis and uniqueness typing are static analyses that aim at determining which of a program's objects are to be used at most once. There are many commonalities between these two forms of usage analysis. We make their connection precise by d
Publikováno v:
Higher-Order and Symbolic Computation. 23(2):145-166
Generalized Algebraic Data Types are a generalization of Algebraic Data Types with additional type equality constraints. These found their use in many functional programs, including the development of embedded domain specific programming languages an