This paper presents a work whose aim is to obtain information on execution time of λ-terms by semantic means. By execution time, we mean the number of steps in a computational model. As in [Ehrhard and Regnier 2006], the computational model considered in this paper will be Krivine’s machine, a more realistic model than β-reduction. Indeed, Krivine’s machine implements (weak) head linear reducti...

We give a logic programming language based on Fiore, Plotkin and Turi’s binding algebras. In this language, we can use not only first-order terms but also terms involving variable binding. The aim of this language is similar to Nadathur and Miller’s λProlog, which can also deal with binding structure by introducing λ-terms in higher-order logic. But the notion of binding used here is finer in a...

αProlog is a logic programming language which is well-suited for rapid prototyping of type systems and operational semantics of typed λ-calculi and many other languages involving bound names. In αProlog, the nominal unification algorithm of Urban, Pitts and Gabbay is used instead of first-order unification. However, although αProlog can be viewed as Horn-clause logic programming in Pitts’ nomin...

in most industrial zones, electric energy is one of the most important energy sources. since electrical motors are the main energy consumers of industrial factories, consumption optimization in these motors can be considered as a main option related to energy saving. one very effective way to reduce the consumption of these equipment is to use a motor speed controllers or drives. since the loss...

so far various methods for optimization presented and one of most popular of them are optimization algorithms based on swarm intelligence and also one of most successful of them is particle swarm optimization (pso). prior some efforts by applying fuzzy logic for improving defects of pso such as trapping in local optimums and early convergence has been done. moreover to overcome the problem of i...

The algebraic λ-calculus [40] and the linear-algebraic λ-calculus [3] extend the λ-calculus with the possibility of making arbitrary linear combinations of λ-calculus terms (preserving ∑ αi.ti). In this paper we provide a fine-grained, System F -like type system for the linear-algebraic λ-calculus (Lineal). We show that this scalar type system enjoys both the subject-reduction property and the ...

2 Homotopy λ-calculus 16 1 Type systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16 2 Homotopy λ-calculus . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 23 3 Basic layer syntax . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 24 4 Basic layer semantics in Top . . . . . . . . . . . . . . . . . . . . . . . . ...

Linear logic enjoys strong symmetries inherited from classical logic while providing a constructive framework comparable to intuitionistic logic. However, the computational interpretation of sequent calculus presentations of linear logic remains problematic, mostly because of the many rule permutations allowed in the sequent calculus. We address this problem by providing a simple interpretation...

The main theme of this paper is to present novel controller, which is a genetic based fuzzy Logic controller, for interior permanent magnet synchronous motor drives with direct torque control. A radial basis function network has been used for online tuning of the genetic based fuzzy logic controller. Initially different operating conditions are obtained based on motor dynamics incorporating...