1770 search results - page 1 / 354 » Implementing Typeful Program Transformations |
FUIN
2006
14 years 9 months ago
2006
The notion of program transformation is ubiquitous in programming language studies on interpreters, compilers, partial evaluators, etc. In order to implement a program transformat...
POPL
1992
ACM
15 years 1 months ago
1992
ACM
This paper presents a program transformation that allows languages with polymorphic typing (e.g. ML) to be implemented with unboxed, multi-word data representations, more efficien...
TACAS
2007
Springer
15 years 3 months ago
2007
Springer
Symbolic execution can be problematic when applied to real applications. This paper addresses two of these problems: (1) the constraints generated during symbolic execution may be ...
MPC
2010
Springer
15 years 2 months ago
2010
Springer
Parser combinators are a popular tool for designing parsers in functional programming languages. If such combinators generate an abstract representation of the grammar as an interm...
173
click to vote
POPL
2009
ACM
15 years 10 months ago
2009
ACM
We present HML, a type inference system that supports full firstclass polymorphism where few annotations are needed: only function parameters with a polymorphic type need to be an...