We study the type inference problem for a system with type classes as in the functional programminglanguage Haskell. Type classes are an extension of ML-style polymorphismwith ove...
Vienna Fortran is a machine-independent language extension of Fortran, which is based upon the Single-Program-Multiple-Data SPMD paradigm and allows the user to write programs f...
Barbara M. Chapman, Piyush Mehrotra, Hans Moritsch...
—In the past, researchers have developed specialized programs to aid programmers in detecting concurrent programming errors such as deadlocks, livelocks, starvation, and data rac...
We define the reachability-bound problem to be the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in ...
We describe a code reuse tool for use in the Looking Glass IDE, the successor to Storytelling Alice [17], which enables middle school students with little to no programming experi...
Paul A. Gross, Micah S. Herstand, Jordana W. Hodge...