We study restricted computation models related to the tree evaluation problem. The TEP was introduced in earlier work as a simple candidate for the (very) long term goal of separa...
Abstract. Logic Programs with Annotated Disjunctions (LPADs) allow to express probabilistic information in logic programming. The semantics of an LPAD is given in terms of the well...
Visual programming languages can be used to make computer science more accessible to a broad range of students. The evaluative focus of current research in the area of visual lang...
Kyu Han Koh, Ashok R. Basawapatna, Vicki Bennett, ...
We present HOMER, an observational-equivalence model checker for the 3rd-order fragment of Idealized Algol (IA) augmented with iteration. It works by first translating terms of the...