We tackle the problem of detecting global variables in functional programs. We present syntactic criteria for single-threading which improves upon previous solutions (both syntact...
The premise of the work presented in this chapter is that much of the existing work on the generation of referring expressions has focused on aspects of the problem that appear to ...
We study the expressibility problem: given a finite constraint language Γ on a finite domain and another relation R, can Γ express R? We prove, by an explicit family of example...
Abstract. Controlled languages (CLs) are ambiguity-free subsets of natural languages such as English offering a good trade-off between the formal rigor of ontology and query langua...
Abstract. We describe a formal language/notation for DNA molecules that may contain nicks and gaps. The elements of the language, DNA expressions, denote formal DNA molecules. Diff...
Rudy van Vliet, Hendrik Jan Hoogeboom, Grzegorz Ro...