Proof assistants based on dependent type theory are closely related to functional programming languages, and so it is tempting to use them to prove the correctness of functional p...
Andreas Abel, Marcin Benke, Ana Bove, John Hughes,...
Abstract. We present a new proof of decidability of higher-order subtyping in the presence of bounded quantification. The algorithm is formulated as a judgement which operates on b...
To create an understanding of enterprises and the ways they do business, a starting point could be to identify the main actors and the values transferred between them. Business mod...
Birger Andersson, Maria Bergholtz, Ananda Edirisur...
Ontologies are viewed as increasingly important tools for structuring domains of intrests. In this paper we propose a reference ontology of business models using concepts from thre...
Birger Andersson, Maria Bergholtz, Ananda Edirisur...
This work presents a study of the nature of expertise in geology, which demands visual recognition methods to describe and interpret petroleum reservoir rocks. In an experiment usi...