ys when planning meant searching for a sequence of abstract actions that satisfied some symbolic predicate. Robots can now learn their own representations through statistical infe...
In this paper, we study general questions about the solvability of the Kruppa equations and show that, in several special cases, the Kruppa equations can be renormalized and becom...
Much of what we know about how programmers refactor in the wild is based on studies that examine just a few software projects. Researchers have rarely taken the time to replicate ...
Emerson R. Murphy-Hill, Chris Parnin, Andrew P. Bl...
Previous research has documented the fragmented nature of software development work, with frequent interruptions and coordination. To explain this in more detail, we analyzed soft...
We present a possible world semantics for a call-by-value higherorder programming language with impredicative polymorphism, general references, and recursive types. The model is o...