Through the Curry-Howard isomorphism between logics and calculi, necessity modality in logic is interpreted as types representing program code. Particularly, λ◯, which was proposed in influential work by Davies, and its successors have been widely used as a logical foundation for syntactic meta-programming. However, it is less known how to extend calculi based on modal type theory to handle mor...

in this article, a speed control of dc motor is designed and illustrated using fuzzy logic-based programmable logic controller (plc). the dc motor is an attractive part of electrical equipment in many industrial applications requiring variable speed and load specifications due to its ease of controllability. the designed system is consisted of three main parts including programmable logic contr...

We present two rewriting systems that define labelled explicit substitution λ -calculi. Our work is motivated by the close correspondence between Lévy’s labelled λ -calculus and paths in proof-nets, which played an important role in the understanding of the Geometry of Interaction. The structure of the labels in Lévy’s labelled λ -calculus relates to the multiplicative information of paths; the...

Running the TD(λ) algorithm for complex simulated tasks may take several days of computation time. In order to reduce this time, it is possible to take advantage of parallel computation architectures. In this paper, we present a method to parallelize the TD(λ) algorithm. This method consists in running episodes in parallel, and summing the weight changes obtained by each processor at some synch...

The famous slogan by Robin Milner said that ”well-typed programs do not go wrong”. This slogan essentially asserts the soundness of the type system of the programming language. This is the question whether the type system prevents us from writing meaningful and errorfree programs. The proof generation capabilities of proof construction systems based on type theory. The ground of the theory is t...

Slot and van Emde Boas’ weak invariance thesis states that reasonable machines can simulate each other within a polynomial overhead in time. Is λ-calculus a reasonable machine? Is there a way to measure the computational complexity of a λ-term? This paper presents the first complete positive answer to this long-standing problem. Moreover, our answer is completely machine-independent and based o...

according to world health organization, breast cancer is one of the most deadly cancers occurred in women. therefore accurate diagnosis and prediction is important to decrease the high death rate. the aim of this paper is twofold. first, improving breast cancer detection accuracy using modified fuzzy logic (mfl) then improving the performance of mfl algorithm using gpu platform. the experimenta...