Sciweavers

6740 search results - page 295 / 1348
» Using Classification as a Programming Language
Sort
View
ICFP
2003
ACM
16 years 2 months ago
An effective theory of type refinements
We develop an explicit two level system that allows programmers to reason about the behavior of effectful programs. The first level is an ordinary ML-style type system, which conf...
Yitzhak Mandelbaum, David Walker, Robert Harper
120
Voted
PLDI
2006
ACM
15 years 8 months ago
Effective static race detection for Java
We present a novel technique for static race detection in Java programs, comprised of a series of stages that employ a combination of static analyses to successively reduce the pa...
Mayur Naik, Alex Aiken, John Whaley
123
Voted
ICFP
1998
ACM
15 years 7 months ago
Recycling Continuations
If the continuations in functional data-structure-generating programs are made explicit and represented as records, they can be recycled." Once they have served their purpose...
Jonathan Sobel, Daniel P. Friedman
79
Voted
BIRTHDAY
2003
Springer
15 years 8 months ago
Automata Mista
Abstract. We present a general methodology for non-deterministic programming based on pure functional programming. We construct families of automata constructions which are used as...
Gérard P. Huet
120
Voted
ENTCS
2002
65views more  ENTCS 2002»
15 years 2 months ago
Superposition: Composition vs refinement of non-deterministic action-based systems
We show that the traditional notion of superposition as used for supporting parallel program design can subsume both composition and refinement relationships when non-deterministi...
Antónia Lopes, José Luiz Fiadeiro