Zobrazeno 1 - 10
of 169
pro vyhledávání: '"Martin Erwig"'
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 66, Iss Proc. DSL 2011, Pp 1-23 (2011)
We present an embedded DSL to support adaptation-based programming (ABP) in Haskell. ABP is an abstract model for defining adaptive values, called adaptives, which adapt in response to some associated feedback. We show how our design choices in Haske
Externí odkaz:
https://doaj.org/article/161ce5f2a5a34dd48e0729cdb66848e9
Autor:
Eric Walkingshaw, Martin Erwig
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 66, Iss Proc. DSL 2011, Pp 143-167 (2011)
We present a domain-specific embedded language (DSEL) in Haskell that supports the philosophical study and practical explanation of causation. The language provides constructs for modeling situations comprised of events and functions for reliably det
Externí odkaz:
https://doaj.org/article/602420f4b05b4456be9ee98749691c29
Autor:
Jennifer Parham-Mocello, Martin Erwig, Margaret Niess, Jason Weber, Madelyn Smith, Garrett Berliner
Publikováno v:
Proceedings of the 54th ACM Technical Symposium on Computer Science Education V. 1.
Publikováno v:
Journal of Computer Languages. 75:101199
Publikováno v:
Proceedings of the 27th ACM Conference on on Innovation and Technology in Computer Science Education Vol. 1.
Autor:
Prashant Kumar, Martin Erwig
Publikováno v:
GPCE
MADMAX is a Haskell-embedded DSL for multi-attribute, multi-layered decision making. An important feature of this DSL is the ability to generate explanations of why a computed optimal solution is better than its alternatives. The functional approach
Publikováno v:
VL/HCC
In this poster, we report our experiences with implementing two virtual computer science camps for middle school children. The camps use a two-part curriculum: One designed for 6th grade students using computer science concepts from familiar unplugge
Publikováno v:
VL/HCC
Program traces are often used for explaining the dynamic behavior of programs. Unfortunately, program traces can grow quite big very quickly, even for small programs, which compromises their usefulness. In this paper we present a visual notation for
Publikováno v:
Programming Languages and Systems ISBN: 9783030890506
Program traces are a sound basis for explaining the dynamic behavior of programs. Alas, program traces can grow big very quickly, even for small programs, which diminishes their value as explanations.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::272f27e63a3afd591a247ae1b8b98699
https://doi.org/10.1007/978-3-030-89051-3_12
https://doi.org/10.1007/978-3-030-89051-3_12
Autor:
Prashant Kumar, Martin Erwig
Publikováno v:
Journal of Functional Programming. 31
In this paper, we present a method for explaining the results produced by dynamic programming (DP) algorithms. Our approach is based on retaining a granular representation of values that are aggregated during program execution. The explanations that