lispm

248 ms·

2191.
by lispm 8y ago
> How does javascript qualify? It has symbols as a basic data type, slightly similar to Lisp. > But none of them integrate seamlessly with the language, because there's fundamental conflicts with the language's default evalu
2192.
by lispm 8y ago
>a programming language that treats symbols as a first-class concept is indeed a rare beast JavaScript > Only computer algebra systems really attempt this There are a bunch of programming systems (incl. computer algebra systems) on to
2193.
by lispm 8y ago
CLISP is an implementation of Common Lisp. The language is called Common Lisp. Common Lisp has an object system with classes since the early 90s. In fact it was the first standardized object-oriented language. Common Lisp also has optional
2194.
by lispm 8y ago
> lisp interpreter Lisp has compilers. Some do also some type checking, here SBCL 1.5.2: (declaim (ftype (function (fixnum) fixnum) foo)) (defun foo (a) (+ a 1)) (declaim (ftype (function (fixnum) string) bar)) (defun bar
2195.
by lispm 8y ago
CLOS is a part of Common Lisp. Fully integrated.
2196.
by lispm 8y ago
sure, go ahead. The type information is there.
2197.
by lispm 8y ago
LISP is imperative.
2198.
by lispm 8y ago
CLOS code: (defclass foo (superfoo1 superfoo2) ((some-slot :type bar))) (defmethod baz ((some-foo foo) (some-bar bar)) ...) (defmethod foobar ((some-foo foo)) (baz foo (make-bar))) What would you need to do r
2199.
by lispm 8y ago
I thought the developer had access to the ART software system, software written in ART and ART documentation - since that was what NASA was using already to develop rule-based expert systems? Given that ART was written in Common Lisp and ex
2200.
by lispm 8y ago
McCarthy: 'Recursive Functions of Symbolic Expressions and Their Computation by Machine': 'In this article, we first describe a formalism for defining functions recursively. We believe this formalism has advantages both as a
2201.
by lispm 8y ago
Most Lisp implementations use typed memory via tags. Lisp doesn't have pointers, but references and usually knows if something is an integer or a reference - because it's encoded in the tags.
2202.
by lispm 8y ago
According to Prof. Herbert Stoyan, probably the oldest GC algorithm description is in 'J. McCarthy, M.L. Minsky: Artificial Intelligence. Quarterly Progress Report No. 53, Res. Lab, of electronics MIT, Cambridge, April 1959.' Prof
2203.
by lispm 8y ago
See the chapter 6.3 'The Free-Storage List and the Garbage Collector' in the LISP I Programmer's manual from March 1960. http://bitsavers.org/pdf/mit/rle_lisp/LISP_I_Programmers_Man...
2204.
by lispm 8y ago
> I vaguely recall stories about Lisp machine users who would turn off GC while working That was more in the early days when the GC was more primitive. The later GC was actually several different ones. A huge impact had the so-called &#x
2205.
by lispm 8y ago
AFAIK they were only a distributor in the UK... Inference Corp was then Brightware, which then was bought by Firepond, then ???
2206.
by lispm 8y ago
Clips was directly designed based on ART (Automated Reasoning Tool), an expensive early Expert System Shell written in Lisp. Unfortunately ART seems to be lost...
2207.
by lispm 8y ago
> unprecedented level of adoption for a Lisp used in commercial software if one ignores the 80s / early 90s of the AI boom
2208.
by lispm 8y ago
> The concept of a seperate app seems trivial/non-existant when everything is running in the same address space. It just looks different inside. Genera is an object-oriented system. Whether objects run in different memory-spaces or
2209.
by lispm 8y ago
Zmacs is basically an editor, but not an IDE. The IDE tools are not part of Zmacs. Listener, Debugger, Window Debugger, Step, Trace, Profiler, Window designer, Flavor examiner, inspector, UI inspector, Documentation browser, ... But one get
2210.
by lispm 8y ago
Have you used Zmacs? What was better than the Racket IDE?
2211.
by lispm 8y ago
> DrRacket is a pedagogic IDE, originally intended to be simple for new students and non-majors. I know that. But it's far from being generally 'awesome', when the look & feel is actually below average. > P.S., Than
2212.
by lispm 8y ago
> a truly awesome IDE. That's a lot of hyperbole for a not so great IDE. It's even sluggish on my Mac - there are basic GUI functions, like resizing windows, which are poorly implemented (run something in a loop, then the UI st
2213.
by lispm 8y ago
Compiling will not change READ into PARSE. READ is still there. > Most CL implementations compile before calling eval Many or a lot, but I'm not sure actually most. There are quite a lot which use an Interpreter in the REPL, but whe
2214.
by lispm 8y ago
Not because of the software, but because of the customers and the dev team?
2215.
by lispm 8y ago
> Slack has a huge opportunity in front of them (become the messaging platform for every business that exists). How about: being bought by Microsoft.
2216.
by lispm 8y ago
> Well, resumable exceptions are not so great... I thought they are? > We really don't want them in Java (remember that Java is a language originally designed by Lispers). Who of the Oak team were Lispers? Not even Gosling has ev
2217.
by lispm 8y ago
> We don't want resumable exceptions for Java. So the Java libs I'd have to use would not support them. Not so great. > I have never used Allegro So the totality of your opinion of the JVM being better for Lisp comes from ex
2218.
by lispm 8y ago
> I'm the technical lead for that project, and we're very likely to have continuations soon. What relationship have continuations to making Java exceptions resumeable? > But by comparing capabilities I did not mean one by on
2219.
by lispm 8y ago
> Other JVMs So I need to switch to exotic JVMs to get better performance? > I think Clojurists (which probably outnumber all other professional Lispers combined several times over) would disagree Does the number matter, since most of
2220.
by lispm 8y ago
> I would cringe to see SBCL with terabytes of heap and hundreds of CPU cores running a serious workload That's nothing SBCL can do, but one can save an executable and start that in a subsecond without the need for a terabyte of RAM

More ›