EuLisp
   HOME

TheInfoList



OR:

EuLisp is a statically and dynamically scoped Lisp dialect developed by a loose formation of industrial and academic Lisp users and developers from around Europe. The standardizers intended to create a new Lisp "less encumbered by the past" (compared to Common Lisp), and not so
minimalist In visual arts, music and other media, minimalism is an art movement that began in post– World War II in Western art, most strongly with American visual arts in the 1960s and early 1970s. Prominent artists associated with minimalism include Do ...
as Scheme. Another objective was to integrate the
object-oriented programming Object-oriented programming (OOP) is a programming paradigm based on the concept of "objects", which can contain data and code. The data is in the form of fields (often known as attributes or ''properties''), and the code is in the form of ...
paradigm well. It is a
third-generation programming language A third-generation programming language (3GL) is a high-level computer programming language that tends to be more machine-independent and programmer-friendly than the machine code of the first-generation and assembly languages of the second-gene ...
.


Origin

The language definition process first began in a meeting in 1985 in
Paris Paris () is the Capital city, capital and List of communes in France with over 20,000 inhabitants, most populous city of France, with an estimated population of 2,165,423 residents in 2019 in an area of more than 105 km² (41 sq mi), ma ...
and took several years. The complete specification and a first implementation ( interpreted-only) were made available in 1990.


Distinguishing features

Its main traits are that it is a Lisp-1 (no separate function and variable namespaces), has a ''
Common Lisp Object System The Common Lisp Object System (CLOS) is the facility for object-oriented programming which is part of ANSI Common Lisp. CLOS is a powerful dynamic object system which differs radically from the OOP facilities found in more static languages such ...
'' (CLOS) style generic-function type object-oriented system named ''The EuLisp Object System'' (TELOS) integrated from the ground up, has a built-in module system, and is defined in layers to promote the use of the Lisp on small, embedded hardware and educational machines. It supports
continuation In computer science, a continuation is an abstract representation of the control state of a computer program. A continuation implements ( reifies) the program control state, i.e. the continuation is a data structure that represents the computati ...
s, though not as powerfully as Scheme. It has a simple lightweight process mechanism ( threads).


Summary

* A definition in levels, currently Level-0 and Level-1 * Modules based on (non- first-class)
lexical Lexical may refer to: Linguistics * Lexical corpus or lexis, a complete set of all words in a language * Lexical item, a basic unit of lexicographical classification * Lexicon, the vocabulary of a person, language, or branch of knowledge * Lex ...
environments. *
Lexically scoped In computer programming, the scope of a name binding (an association of a name to an entity, such as a variable) is the part of a program where the name binding is valid; that is, where the name can be used to refer to the entity. In other parts ...
, with dynamic or
late binding In computing, late binding or dynamic linkage—though not an identical process to dynamically linking imported code libraries—is a computer programming mechanism in which the method being called upon an object, or the function being called ...
available in Level-1. * A single name space for function and variable names (like Scheme). * Lightweight processes. * A fully integrated
object system Object-oriented programming (OOP) is a programming paradigm based on the concept of " objects", which can contain data and code. The data is in the form of fields (often known as attributes or ''properties''), and the code is in the form of p ...
with
single inheritance Multiple inheritance is a feature of some object-oriented programming, object-oriented computer programming languages in which an object or class (computer programming), class can inheritance (object-oriented programming), inherit features from mor ...
at Level-0 and
multiple inheritance Multiple inheritance is a feature of some object-oriented computer programming languages in which an object or class can inherit features from more than one parent object or parent class. It is distinct from single inheritance, where an object or ...
and
meta-object protocol In computer science, a metaobject is an object that manipulates, creates, describes, or implements objects (including itself). The object that the metaobject pertains to is called the base object. Some information that a metaobject might define inc ...
at Level-1. * An
object-oriented Object-oriented programming (OOP) is a programming paradigm based on the concept of " objects", which can contain data and code. The data is in the form of fields (often known as attributes or ''properties''), and the code is in the form of p ...
condition system Condition or conditions may refer to: In philosophy and logic * Material conditional, a logical connective used to form "if...then..." statements * Necessary and sufficient condition, a statement which is true if and only if another given state ...
.


Implementations

An early implementation of EuLisp was ''Free and Eventually Eulisp'' (FEEL). The successor to FEEL was ''Youtoo'' (interpreted and
compiled In computing, a compiler is a computer program that translates computer code written in one programming language (the ''source'' language) into another language (the ''target'' language). The name "compiler" is primarily used for programs that ...
versions), by
University of Bath (Virgil, Georgics II) , mottoeng = Learn the culture proper to each after its kind , established = 1886 (Merchant Venturers Technical College) 1960 (Bristol College of Science and Technology) 1966 (Bath University of Technology) 1971 (univ ...
in the
United Kingdom The United Kingdom of Great Britain and Northern Ireland, commonly known as the United Kingdom (UK) or Britain, is a country in Europe, off the north-western coast of the European mainland, continental mainland. It comprises England, Scotlan ...
. An interpreter for the basic level of EuLisp, ''level-0'', was written by Russell Bradford in XScheme, an implementation of Scheme by David Michael Betz, originally named EuSchem
EuScheme
but the most recent version is renamed EuXLis

to avoid confusion. Also Eu2

a EuLisp optimizing compiler, was created by Fraunhofer ISST under the APPLY project in German

A dialect of EuLisp was developed, named Plural EuLisp. It was EuLisp with parallel computing programming extensions.


Example

Example use of classes in the algorithm to solve the "
Towers of Hanoi The Tower of Hanoi (also called The problem of Benares Temple or Tower of Brahma or Lucas' Tower and sometimes pluralized as Towers, or simply pyramid puzzle) is a mathematical game or puzzle consisting of three rods and a number of disks of v ...
" problem. (defmodule hanoi (syntax (syntax-0) import (level-0) export (hanoi)) ;;;------------------------------------------------- ;;; Tower definition ;;;------------------------------------------------- (defconstant *max-tower-height* 10) (defclass () ((id reader: tower-id keyword: id:) (blocks accessor: tower-blocks))) (defun build-tower (x n) (labels ((loop (i res) (if (= i 0) res (loop (- i 1) (cons i res))))) ((setter tower-blocks) x (loop n ())) x)) (defmethod generic-print ((x ) (s )) (sformat s "#" (tower-id x) (tower-blocks x))) ;;;------------------------------------------------- ;;; Access to tower blocks ;;;------------------------------------------------- (defgeneric push (x y)) (defmethod push ((x ) (y )) (let ((blocks (tower-blocks x))) (if (or (null? blocks) (< y (car blocks))) ((setter tower-blocks) x (cons y blocks)) (error (fmt "cannot push block of size ~a on tower ~a" y x))))) (defgeneric pop (x)) (defmethod pop ((x )) (let ((blocks (tower-blocks x))) (if blocks (progn ((setter tower-blocks) x (cdr blocks)) (car blocks)) (error (fmt "cannot pop block from empty tower ~a" x))))) ;;;------------------------------------------------- ;;; Move n blocks from tower x1 to tower x2 using x3 as buffer ;;;------------------------------------------------- (defgeneric move (n x1 x2 x3)) (defmethod move ((n ) (x1 ) (x2 ) (x3 )) (if (= n 1) (progn (push x2 (pop x1)) (print x1 nl x2 nl x3 nl nl)) (progn (move (- n 1) x1 x3 x2) (move 1 x1 x2 x3) (move (- n 1) x3 x2 x1)))) ;;;------------------------------------------------- ;;; Initialize and run the 'Towers of Hanoi' ;;;------------------------------------------------- (defun hanoi () (let ((x1 (make id: 0)) (x2 (make id: 1)) (x3 (make id: 2))) (build-tower x1 *max-tower-height*) (build-tower x2 0) (build-tower x3 0) (print x1 nl x2 nl x3 nl nl) (move *max-tower-height* x1 x2 x3))) (hanoi) ;;;------------------------------------------------- ) ;; End of module hanoi ;;;-------------------------------------------------


References


"An Overview of EuLisp"
Julian Padget, Greg Nuyens, and Harry Bretthauer, editors. ''Lisp and Symbolic Computation'', Volume 6, Number 1-2, 1993, pages 9–98.
"Balancing the EuLisp Metaobject Protocol"
Harry Bretthauer, Jürgen Kopp, Harley Davis, and Keith Playford. ''Lisp and Symbolic Computation'', Volume 6, Issue 1–2, August 1993, pages 119–138.
"EuLisp in Education"
R. Bradford and D.C. DeRoure. ''Lisp and Symbolic Computation'', Volume 6, Number 1-2, pages 99–118.
"Applications of Telos"
Peter Broadbery, Christopher Burdorf. ''Lisp and Symbolic Computation'', Volume 6, Issue 1–2, August 1993, pages 139–158.
"A Practical Approach to Type Inference for EuLisp"
Andreas Kind and Horst Friedrich. ''Lisp and Symbolic Computation'', Volume 6, Issue 1–2, August 1993, pages 159–176.
"EuLisp Threads: A Concurrency Toolbox"
Neil Berrington, Peter Broadbery, David DeRoure, and Julian Padget. ''Lisp and Symbolic Computation'', Volume 6, Issue 1–2, August 1993, pages 177–200.
"Plural EuLisp: A Primitive Symbolic Data Parallel Model"
Simon Merrall, Julian Padget. ''Lisp and Symbolic Computation'', Volume 6, Issue 1–2, August 1993, pages 201–219.
"A Conservative Garbage Collector for an EuLisp to ASM/C Compiler"
E. Ulrich Kriegel. ''OOPSLA'93 Workshop on Garbage Collection and Memory Management'', Washington, DC, September 27, 1993.
"An Implementation of Telos in Common Lisp"
, ''Object Oriented Systems'', vol. 3, pp. 31–49, 1996. ISSN 0969-9767.


External links




Version .99
of the final 1993 specification – ( PDF)
Version .991
unofficial updated draft definition (2010) – ( PDF)
EuScheme
sources * , latest versions of: EuLisp (with 64-bit support and more), EuXLisp, Eu2C {{Lisp programming language Dynamically typed programming languages Functional languages Lisp programming language family Multi-paradigm programming languages