In this work we focus on a formalisation of the algorithms of lazy exact arithmetic `a la Edalat–Potts in type theory. We choose the constructive type theory extended with coind...
Type classes were originally developed in Haskell as a disciplined alternative to ad-hoc polymorphism. Type classes have been shown to provide a type-safe solution to important ch...
Bruno C. d. S. Oliveira, Adriaan Moors, Martin Ode...
Description logics (DLs) are widely employed in recent semantic web application systems. However, classical description logics are limited when dealing with imprecise concepts and ...
This paper proposes a new technique for computing the distance to an unknown planar surface and, at the same time, estimating the material of the surface through the use of low-co...
The present work is dedicated to the study of modes of data-presentation in the range between text and informant within the framework of inductive inference. In this study, the le...