Recent constraint logic programming (CLP) languages, such as HAL and Mercury, require type, mode and determinism declarations for predicates. This information allows the generatio...
d by recent research in abstract model checking, we present a new approach to inferring dependent types. Unlike many of the existing approaches, our approach does not rely on prog...
We describe a new grounder system for logic programs under answer set semantics, called GrinGo. Our approach combines and extends techniques from the two primary grounding approach...
se a new abstraction for pointer analysis that represents reads and writes to memory instead of traditional points-to relations. Compared to points-to graphs, our Assign-Fetch Gra...
Marcio Buss, Daniel Brand, Vugranam C. Sreedhar, S...
Abstract. We investigate an extension of a lazy functional logic language, which uses term disequations both in programs and in computed answers. The semantic properties of the lan...