Linear Logic is based on the analogy between algebraic linearity (i.e. commutation with sums and scalar products) and the computer science linearity (i.e. calling inputs only once...
Abstract. Having effective and efficient methods to get access to desired images is essential nowadays with the huge amount of digital images. This paper presents an analogy betwee...
Ismail Elsayad, Jean Martinet, Thierry Urruty, Cha...
A common subproblem of DNF approximate counting and derandomizing RL is the discrepancy problem for combinatorial rectangles. We explicitly construct a poly(n)-size sample space t...
Roy Armoni, Michael E. Saks, Avi Wigderson, Shiyu ...
Monads are commonplace programming devices that are used to uniformly structure computations with effects such as state, exceptions, and I/O. This paper further develops the monad...
Neil Ghani, Patricia Johann, Tarmo Uustalu, Varmo ...
In this paper we discuss extensions of Feferman's theory T0 for explicit mathematics by the so-called limit and Mahlo axioms and present a novel approach to constructing natu...