Probably building non procedural languages is the most prospective way for parallel programming just because non procedural means no fixed way for execution. The article consists of 3 parts. In first part we consider formal systems for definition a named datasets and studying an expression power of different subclasses. In the second part we consider a complexity of algorithms of building sets ...

Most interpreters for functional languages (as well as Lisp) employ at some level in the implementation a notion of sharing, whether manifested indirectly through an environment or directly via pointers. Sharing is essential to an efficient implementation, saving time by not recomputing values, and saving space by having only one copy of each value. From the perspective of lambda calculus, shar...

y Abstract Lambda lifting is a technique for transforming a functional program with local function deenitions, possibly with free variables in the function deenitions, into a program consisting only of global function (combinator) deenitions which will be used as rewrite rules. Diierent ways of doing lambda lifting are presented, as well as reasons for rejecting or selecting the method used in ...

The position of the lunate sulcus in fossil endocasts (when it can be determined) may serve as a potential marker of cognitive development in extinct hominid species. While the lunate sulcus is reliably present in the brains of great apes and forms the anterolateral boundary of the primary visual cortex, in humans its presentation is much more variable, and even if present, it does not correspo...

In this research, a new method named δ to solve non-linear constrained and un optimal control problems for trajectory optimization was proposed. The main objective of defined as solving by the combination orthogonal functions, heuristic techniques, principles theory. Three functions Fourier, Chebyshev, Legendre were considered approximate variables. Also, GA-PSO imperialist competition algorith...

Lambda calculus is the basis of functional programming and higher order proof assistants. However, little is known about combinatorial properties of lambda terms, in particular, about their asymptotic distribution and random generation. This paper tries to answer questions like: How many terms of a given size are there? What is a “typical” structure of a simply typable term? Despite their osten...

One of the most attractive features of functional languages is that functions are first-class. To support first-class functions many functional languages created heap-allocated closures to store the bindings of free variables. This makes it difficult to predict how the heap is accessed and makes accesses to free variables slower than accesses to bound variables at runtime. This article presents...