EuLisp explained

EuLisp
Family:Lisp
Paradigm:multi-paradigm

functional, procedural, meta, object-oriented

Latest Preview Version:0.991[1]
Standard Reference:Latest draft
Typing:strong, dynamic
Scope:static and dynamic
Implementations:EuXLisp,[2] Youtoo, Eu2C
Influenced By:Common Lisp, InterLisp, LeLisp, Lisp/VM, Scheme, T, CLOS, ObjVlisp, Oaklisp, MicroCeyx, MCS, Standard ML, Haskell
Influenced:Dylan, ISLISP, Evelin
Operating System:Linux
File Ext:.em

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 as Scheme. Another objective was to integrate the object-oriented programming paradigm well. It is a third-generation programming language.

Origin

The language definition process first began in a meeting in 1985 in Paris and took several years. The complete specification and a first implementation (interpreted-only) were made available in 1990.

Distinguishing features

See also: Lisp (programming language). Its main traits are that it is a Lisp-1 (no separate function and variable namespaces), has a Common Lisp Object System (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 continuations, though not as powerfully as Scheme. It has a simple lightweight process mechanism (threads).

Summary

Implementations

An early implementation of EuLisp was Free and Eventually Eulisp (FEEL). The successor to FEEL was Youtoo (interpreted and compiled versions), by University of Bath in the United Kingdom.[3] 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 EuScheme EuScheme but the most recent version is renamed EuXLisp https://github.com/Henry/EuLisp/ to avoid confusion. Also Eu2C https://github.com/Henry/EuLisp/, a EuLisp optimizing compiler, was created by Fraunhofer ISST under the APPLY project in Germany http://publica.fraunhofer.de/dokumente/PX-46999.html.

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" 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

    External links

    Notes and References

    1. Web site: Eulisp . GitHub . 2017-09-20 . 2012-03-06 . https://web.archive.org/web/20120306014143/http://henry.github.com/EuLisp/Doc/EuLisp-0.991/eulisp.pdf . dead .
    2. Web site: Eulisp . GitHub.
    3. Web site: Youtoo . Kind . Andreas . School of Mathematical Sciences . University of Bath . England . 2018-10-28.

    This article is licensed under the GNU Free Documentation License. It uses material from the Wikipedia article "EuLisp".

    Except where otherwise indicated, Everything.Explained.Today is © Copyright 2009-2024, A B Cryer, All Rights Reserved. Cookie policy.