We introduce the design of Mondrian, a functional scripting language for glueing together components on the .NET platform. Mondrian is monadic statement centric with pure expressions and nonstrict evaluation and explores the melding of the OO and the purely lazy functional paradigms.

This research explores the effects of three computer-mediated feedback modalities, that is, elicitation, recast, and meta-linguistics, on the learning of English participial, gerund, and infinitival phrases among Iranian intermediate-level EFL learners. The overriding focus of the present study was to investigate whether different types of feedback given through form-focused computer-human exch...

In this work, we introduce and study the S-pseudospectra of linear operators defined by nonstrict inequality in a Hilbert space. Inspired A. B?ttcher?s result [3], prove that S-resolvent norm bounded is not constant any open set set. Beside, find characterization S-pseudospectrum operator means S-spectra all perturbed with perturbations have norms strictly less than ?.

This paper studies system theoretic properties of the class difference inclusions convex processes. We will develop a framework considering eigenvalues and eigenvectors, weakly strongly invariant cones, decomposition lead to characterizations reachability, stabilizability, (null-)controllability for nonstrict processes in terms spectral properties. These generalize all previously known results ...

For arbitrary equally sized square complex matrices A and Q (Q Hermitian), the paper provides a complete algebraic test for verifying the existence of a Hermitian solution X of the nonstrict Lyapunov inequality A X + XA + Q 0: If existing, we exhibit how to construct a solution. Our approach involves the validation problem for the linear matrix inequality P k j=1 (A j X j B j + B j X j A j) + Q...

We develop a technique for computing tolerable solution set for interval linear systems with convex polyhedral ties upon its coefficients. The tolerable solution set in the above problem is proved to be the intersection of finite number of hyperstripes, i.e. a solution set to a finite system of two-sided nonstrict linear inequalities. For some specific ties on the coefficients, we propose simpl...