Journal ArticleA programming language kernel is presented where an algorithm is a function defined through a functional expression. The only data structure introduced is an object that may be an atom or a sequence of objects. A number of functional forms are defined, with a notation close to ordinary mathematical notation, and their usage is demonstrated through several examples. The language allows a high degree of parallelism in an underlying interpreting machine
