5090 search results - page 386 / 1018 » Constructing Strategies for Programming |
207
click to vote
ESOP
2010
Springer
16 years 4 months ago
2010
Springer
In search for a foundational framework for reasoning about observable behavior of programs that may not terminate, we have previously devised a trace-based big-step semantics for W...
181
click to vote
TLDI
2010
ACM
16 years 3 months ago
2010
ACM
In the GADT (Generalized Algebraic Data Types) type system, a pattern-matching branch can draw type information from both the scrutinee type and the data constructor type. Even th...
161
click to vote
SAS
2007
Springer
16 years 27 days ago
2007
Springer
Abstract. Shape analyses are often imprecise in their numerical reasoning, whereas numerical static analyses are often largely unaware of the shape of a program’s heap. In this p...
171
click to vote
SCAM
2003
IEEE
16 years 1 days ago
2003
IEEE
The Program Dependence Graph was introduced by Ottenstein and Ottenstein in 1984. It was suggested to be a suitable internal program representation for monolithic programs, for th...
186
click to vote
SAIG
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. Short cut fusion is a particular program transformation technique which uses a single, local transformation — called the foldr-build rule — to remove certain intermed...