Abstract. We convert, via a version that uses constraints, a type inference system for strictness analysis into an algorithm which given an expression finds the set of possible typ...
We add functional continuations and prompts to a language with an ML-style type system. The operators signicantly extend and simplify the control operators in SML/NJ, and can be ...
Cellular automata are usually updated synchronously and thus deterministically. The question of stochastic dynamics arises in the development of cellular automata resistant to nois...
Three versions of the Covington algorithm for non-projective dependency parsing have been tested on the ten different languages for the Multilingual track of the CoNLLX Shared Tas...
Abstract. This paper proposes a modified, genomial, version of function - architecture co-design rnethod so that wider cvaluation of architecturcs from both functional arrd structu...