We present a bunched intermediate language for strong (type-changing) update and disposal of first-order references. In contrast to other substructural type systems, the additive ...
It is shown how to restrict recursion on notation in all finite types so as to characterize the polynomial time computable functions. The restrictions are obtained by using a rami...
Stephen J. Bellantoni, Karl-Heinz Niggl, Helmut Sc...
We describe how to embed a simple typed functional logic programming language in Haskell. The embedding is a natural extension of the Prolog embedding by Seres and Spivey [16]. To...
This paper presents a novel extension of Hidden Markov Models (HMMs): type-2 fuzzy HMMs (type-2 FHMMs). The advantage of this extension is that it can handle both randomness and f...
— Geometric Type-2 Fuzzy sets allow us to model type-2 fuzzy sets using geometry providing significant improvement in speed of computation. This paper explores in detail how wel...