Abstract. One of the open problems in higher category theory is the systematic construction of the higher dimensional analogues of the Gray tensor product. In this paper we begin t...
A monadic parser combinator library which guarantees termination of parsing, while still allowing many forms of left recursion, is described. The library's interface is simil...
Abstract. There is a very simple way in which the safe/normal variable discipline of Bellantoni-Cook recursion (1992) can be imposed on arithmetical theories like PA: quantify over...
In designing learning algorithms it seems quite reasonable to construct them in such a way that all data the algorithm already has obtained are correctly and completely reflected...
Abstract. The aim of this work is to characterize constructive real numbers through a minimal axiomatization. We introduce, discuss and justify 16 constructive axioms. Then we addr...