4 ms·
Indeed, most successful FP languages have their OOP like approaches. Another thing all modern Lisps have since the 1980's, is all major data structures, not on
by pjmlp 2y ago
Indeed, most successful FP languages have their OOP like approaches.
Another thing all modern Lisps have since the 1980's, is all major data structures, not only lists as many think when discussing Lisp.
- fovc 2y agoHaving the data structures is nice and all, but using them is kind of painful. They are certainly second class. Having to use accessor functions or destructuring macros instead of just a period or -> is often annoying too. The lack of syntax has cons as well as pros.
- cenamus 2y agoI mean you can write a macro that let's you write (object -> slot) and transforms it to (slot object) "->" should be unused
- tmtvl 2y agoWriting a reader macro that allows for something like... [some-numbers 0] ...to get the first (many programming languages make this mistake, using 0 to refer to the first element of a collection, so we can forgive CL for this) element. But I'm curious how you can write... (object -> slot) ...without getting an error about OBJECT not being a valid function or macro.
- fovc 2y agoAnd also make sure that slot is a symbol in the correct package. Or do like Elisp and do without packages but then have a 16 character prefix
- Jach 2y agoA late reply but it's worth addressing one way of doing this. First, your concern about object not being a valid function or macro isn't relevant at read time. Second, note that Lisp already has similar syntax: '(1 . 2) is essentially (cons 1 2). Implementing this type of syntax is not a privilege of the implementation alone. You're allowed to redefine your own reader for left paren. In SBCL: CL-USER> (get-macro-character #\() SB-IMPL::READ-LIST You can write `(set-macro-character #\( 'sb-impl::read-list)` and everything continues to work just fine. You can also jump-to-source and modify it if you want -- though it's cleaner to just copy it out to your own project, that's what I did for a quick hack/proof of concept. Essentially I added before the existing (when...) which handles the special dot syntax: (when (and (eq firstchar #\-) (eq (peek-char t stream t nil t) #\>)) (read-char stream t) ; actually read the nextchar > to discard it (let ((next-obj (read stream))) (sb-impl::flush-whitespace stream rt) (return `(slot-value ,@listtail ',next-obj)))) I won't claim this is good or proper, but it shows that it's quite feasible. We've turned (foo -> bar) into (slot-value foo 'bar). CL-USER> (defclass vec2 () ((x :initarg :x) (y :initarg :y))) #<STANDARD-CLASS COMMON-LISP-USER::VEC2> CL-USER> (defparameter vec (make-instance 'vec2 :x 3 :y 4)) VEC CL-USER> (vec -> y) 4 CL-USER> (read-from-string "(print (vec -> x))") (PRINT (SLOT-VALUE VEC 'X)) 18 Personally I wouldn't use this even if it was more properly/carefully implemented. (There's really no reason to replace the default left-paren reader, and no reason we have to have a space surrounding the "->". One thing I like about the infix reader macro package https://github.com/quil-lang/cmu-infix https://github.com/quil-lang/cmu-infix is that it doesn't care about spaces, I can write #I(1+1 + 4) and get 6.) I'm quite happy putting my class in its own package, and thus getting the primary tab-completion behavior I care about. e.g. "(ma:<tab>" could complete to "(math:" and then "(math:v<tab>" could complete to a list of options like "vector-x" "vector-y" or so on. I also like the somewhat unusual approach of naming my accessors with a dot prefix, e.g. (.x vec) and (.y vec), or even (math:.x vec) if I haven't imported the symbol.
- tmtvl 2y agoGood things are worth waiting for. I never considered making a reader macro for a regular opening bracket, that's equal parts genius and insanity.
- kazinator 2y ago> so we can forgive CL for this The 1962 dated Lisp 1.5 Programmer's Manual already describes a 0 based array feature. Lisp was clearly one of the historic instigators of zero based array, rather than just playing along.
- tmtvl 2y agoYes, but the various Lisps that Common Lisp is the more-or-less common subset of are (were?) all 0-indexed. Between easy heap implementation (left is (ash index 1), right is (1+ (ash index 1)), parent is (ash index -1)) and easy last element selection (nth seq (length seq)) I prefer 1-indexing, but I realize that's an unpopular opinion.
- pjmlp 2y agoEverything needed is place, there is no second class about using arrays instead of lists.
- ludston 2y agoCommon Lisp isn't a functional programming language to be clear.
- pjmlp 2y agoIt definitely isn't one, when instead of looking at it with the eyes of CS knowledge, people take the mindset whatever Haskell does. FP predates Haskell by decades.
- ludston 2y agoIt also isn't one when "looking at it with the eyes of CS knowledge", given that Common Lisp has very powerful support for OO and procedural programming out of the box, and in order to most effectively use an FP style it's necessary to rely on community developed libraries...
- pjmlp 2y agoWhat FP style? Haskell style, I guess. When I learnt Lisp, Lisp and Scheme were FP, Miranda was still around, and Caml Light had just started being known outside INRIA. I really dislike revisionism regarding what it means to be FP.
- veqq 2y agoThe issue's that Schemes (and Clojure) are way more functional than Common Lisp and e.g. `funcall` feels like a kludge compared to lisp-1. If you read the old CL codebases or modern code, destructive and imperative use are common, so it doesn't feel terribly revisionist (just compared to pascal, c, bliss etc.).
- andsoitis 2y agoWikipedia page for “functional programming”: ”The first high-level functional programming language, Lisp, was developed in the late 1950s…” https://en.wikipedia.org/wiki/Functional_programming https://en.wikipedia.org/wiki/Functional_programming