61 search results - page 8 / 13 » Partial Order Reduction for Rewriting Semantics of Programmi... |
168
click to vote
POPL
2003
ACM
15 years 9 months ago
2003
ACM
We introduce a new framework of algebraic pure type systems in which we consider rewrite rules as lambda terms with patterns and rewrite rule application as abstraction applicatio...
PLANX
2007
14 years 11 months ago
2007
Although monadic second-order logic (MSO) has been a foundation of XML queries, little work has attempted to take MSO formulae themselves as a programming construct. Indeed, MSO f...
ENTCS
2008
14 years 9 months ago
2008
Lazy evaluation (or call-by-need) is widely used and well understood, partly thanks to a clear operational semantics given by Launchbury. However, modern non-strict functional lan...
POPL
1998
ACM
15 years 1 months ago
1998
ACM
We present a formal specification of unCurrying for a higher-order, functional language with ML-style let-polymorphism. This specification supports the general unCurrying of func...
PEPM
2009
ACM
15 years 6 months ago
2009
ACM
This article introduces a new program transformation in order to enhance the numerical accuracy of floating-point computations. We consider that a program would return an exact r...