Cellular automata (CA) are dynamical systems defined by a finite local rule but they are studied for their global dynamics. They can exhibit a wide range of complex behaviours an...
The Universe Type System is an ownership type system for object-oriented programming languages that hierarchically structures the object store; it is used to reason modularly about...
Dave Cunningham, Werner Dietl, Sophia Drossopoulou...
Lawvere theories and monads have been the two main category theoretic formulations of universal algebra, Lawvere theories arising in 1963 and the connection with monads being esta...
We offer two noiseless codes for blocks of integers Xn = (X1, . . . , Xn). We provide explicit bounds on the relative redundancy that are valid for any distribution F in the class...
Abstract. This paper provides a framework enabling to define and determine the complexity of various universal programs U for various machines. The approach consists of first defin...