NewLisp - Programming language

NewLisp is an open source programming language created in 1991 by Lutz Mueller.

#467on PLDB

33Years Old

476Repos

Download source code:

git clone https://github.com/kosh04/newlisp

Homepage · REPL · Try It Online · Source Code · Wikipedia · Twitter · Docs

newLISP is an open source scripting language in the Lisp family of programming languages developed by Lutz Mueller and released under the GNU General Public License.. Read more on Wikipedia...

Tags: programming language
NewLisp is developed on GitHub and has 94 stars
There are at least 476 NewLisp repos on GitHub
Early development of NewLisp happened in http://kosh.sdf.org
NewLisp is written in Lisp, C, HTML, Bourne shell, Make, YAML, Vim script, CSS, Markdown, XML
The Google BigQuery Public Dataset GitHub snapshot shows 774 users using NewLisp in 812 repos on GitHub
There are 1 Project Euler users using NewLisp
Explore NewLisp snippets on Rosetta Code
Pygments supports syntax highlighting for NewLisp
GitHub supports syntax highlighting for NewLisp
newlisp.org was registered in 1999
See also: (17 related languages) Lisp, Common Lisp, Scheme, Pascal, C, Tcl, S-expressions, XML, UTF-8, TCP, UDP, Linux, Solaris, SQLite, SMTP, FTP, OpenGL

Example from hello-world:

#!/usr/bin/newlisp
(print "Hello World\n")
(exit)

Example from Linguist:

#!/usr/bin/env newlisp

(constant 'NUM 8)

(define (intersects? q1 q2)
	(or
		(= (q1 0) (q2 0))
		(= (q1 1) (q2 1))
		(= (abs (- (q1 0) (q2 0))) (abs (- (q1 1) (q2 1))))))

(define (variant? alist)
	(set 'logic nil)
	(cond
		((= (length alist) 1) true)
		((> (length alist) 1)
			(while (> (length alist) 1)
				(set 'q (pop alist -1))
				(dolist (el alist)
					(push
						(intersects?
							(list q (inc (length alist)))
							(list el (+ 1 $idx)))
					logic -1)))
			(not (apply or logic)))))

(define (fork-by-line alist)
	(let (res '())
		(dolist (i (sequence 1 NUM))
			(set 'tmp alist)
			(push i tmp -1)
			(setf res (push tmp res -1)))
		res))

(define (find-variants num)
	(let (res '())
		(cond
			((< num 1)
				(begin (println "num < 1") (exit)))
			((= num 1)
				(dolist (i (sequence 1 NUM)) (push (list i) res -1)))
			((> num 1)
				(dolist (v (find-variants (dec num)))
					(set 'passed (filter variant? (fork-by-line v)))
					(if (not (empty? passed)) (extend res passed)))))
		res))
		
(set 'solutions (find-variants NUM))
(println (length solutions))
;;(exit)

Language features

Feature	Supported	Token
Line Comments	✓
Print() Debugging	✓	print
Comments	✓
Semantic Indentation	X