We show how to combine the two most powerful approaches for automated termination analysis of logic programs (LPs): the direct approach which operates directly on LPs and the trans...
We propose a novel type inference algorithm for a dependentlytyped functional language. The novel features of our algorithm are: (i) it can iteratively refine dependent types wit...
Abstract— Separate processing of local luminance and contrast in biological visual systems has been argued to be due to the independence of these two properties in natural image ...
Abstract. In this paper an approach for building process models for ecommerce is proposed. It is based on the assumption that the process modeling task can be methodologically supp...
Maria Bergholtz, Prasad Jayaweera, Paul Johannesso...
Parser combinators are a popular tool for designing parsers in functional programming languages. If such combinators generate an abstract representation of the grammar as an interm...