enter search term and/or author name
First-class monadic schedules
Rajiv Mirani, Paul Hudak
Parallel functional languages often use meta-linguistic annotations to provide control over parallel evaluation. In this paper we explore a flexible mechanism to control when an expression is evaluated: first-class monadic schedules. We...
Polymorphic specialization for ML
Simon Helsen, Peter Thiemann
We present a framework for offline partial evaluation for call-by-value functional programming languages with an ML-style typing discipline. This includes a binding-time analysis which is (1) polymorphic with respect to binding times; (2) allows the...
Symmetry and reduced symmetry in model checking
A. Prasad Sistla, Patrice Godefroid
Symmetry reduction methods exploit symmetry in a system in order to efficiently verify its temporal properties. Two problems may prevent the use of symmetry reduction in practice: (1) the property to be checked may distinguish symmetric states and...
Optimistic register coalescing
Jinpyo Park, Soo-Mook Moon
Graph-coloring register allocators eliminate copies by coalescing the source and target nodes of a copy if they do not interfere in the interference graph. Coalescing, however, can be harmful to the colorability of the graph because it tends to yield...