home.social

#picolisp — Public Fediverse posts

Live and recent posts from across the Fediverse tagged #picolisp, aggregated by home.social.

fetched live
  1. 🌐 Ah yes, the #mystical PicoLisp—a veritable treasure trove of code so scattered across the interwebs that someone just had to corral it into yet another #wiki nobody asked for. 📚✨ Dive into this endless abyss of "coherent" #documentation and maybe, just maybe, you'll emerge as a wizard in a language nobody uses. 🧙‍♂️🔮 Good luck, brave soul!
    picolisp.com/wiki/?Documentati #PicoLisp #Coding #Languages #HackerNews #ngated

  2. 🌐 Ah yes, the #mystical PicoLisp—a veritable treasure trove of code so scattered across the interwebs that someone just had to corral it into yet another #wiki nobody asked for. 📚✨ Dive into this endless abyss of "coherent" #documentation and maybe, just maybe, you'll emerge as a wizard in a language nobody uses. 🧙‍♂️🔮 Good luck, brave soul!
    picolisp.com/wiki/?Documentati #PicoLisp #Coding #Languages #HackerNews #ngated

  3. 🌐 Ah yes, the #mystical PicoLisp—a veritable treasure trove of code so scattered across the interwebs that someone just had to corral it into yet another #wiki nobody asked for. 📚✨ Dive into this endless abyss of "coherent" #documentation and maybe, just maybe, you'll emerge as a wizard in a language nobody uses. 🧙‍♂️🔮 Good luck, brave soul!
    picolisp.com/wiki/?Documentati #PicoLisp #Coding #Languages #HackerNews #ngated

  4. 🌐 Ah yes, the #mystical PicoLisp—a veritable treasure trove of code so scattered across the interwebs that someone just had to corral it into yet another #wiki nobody asked for. 📚✨ Dive into this endless abyss of "coherent" #documentation and maybe, just maybe, you'll emerge as a wizard in a language nobody uses. 🧙‍♂️🔮 Good luck, brave soul!
    picolisp.com/wiki/?Documentati #PicoLisp #Coding #Languages #HackerNews #ngated

  5. @Regenaxer @borkdude @vindarel Thanks! Right, so my comparable in-REPL times for iterative factorial 1000 are

    #PicoLisp: (bench (apply * (range 1 1000)))
    0.000 sec
    #Clojure: user=> (time (apply *' (range 1 1000)))
    "Elapsed time: 2.428199 msecs"
    #SBCL: CL-USER[1]: (time (apply #'* (alexandria:iota 1000 :step 1)))
    Evaluation took:
    0.000 seconds of real time
    0.000015 seconds of total run time (0.000000 user, 0.000015 system)
    100.00% CPU
    45,990 processor cycles
    0 bytes consed

    #Lisp

  6. @Regenaxer @borkdude @vindarel Thanks! Right, so my comparable in-REPL times for iterative factorial 1000 are

    #PicoLisp: (bench (apply * (range 1 1000)))
    0.000 sec
    #Clojure: user=> (time (apply *' (range 1 1000)))
    "Elapsed time: 2.428199 msecs"
    #SBCL: CL-USER[1]: (time (apply #'* (alexandria:iota 1000 :step 1)))
    Evaluation took:
    0.000 seconds of real time
    0.000015 seconds of total run time (0.000000 user, 0.000015 system)
    100.00% CPU
    45,990 processor cycles
    0 bytes consed

    #Lisp

  7. @Regenaxer @borkdude @vindarel Thanks! Right, so my comparable in-REPL times for iterative factorial 1000 are

    #PicoLisp: (bench (apply * (range 1 1000)))
    0.000 sec
    #Clojure: user=> (time (apply *' (range 1 1000)))
    "Elapsed time: 2.428199 msecs"
    #SBCL: CL-USER[1]: (time (apply #'* (alexandria:iota 1000 :step 1)))
    Evaluation took:
    0.000 seconds of real time
    0.000015 seconds of total run time (0.000000 user, 0.000015 system)
    100.00% CPU
    45,990 processor cycles
    0 bytes consed

    #Lisp

  8. @Regenaxer @borkdude @vindarel Thanks! Right, so my comparable in-REPL times for iterative factorial 1000 are

    #PicoLisp: (bench (apply * (range 1 1000)))
    0.000 sec
    #Clojure: user=> (time (apply *' (range 1 1000)))
    "Elapsed time: 2.428199 msecs"
    #SBCL: CL-USER[1]: (time (apply #'* (alexandria:iota 1000 :step 1)))
    Evaluation took:
    0.000 seconds of real time
    0.000015 seconds of total run time (0.000000 user, 0.000015 system)
    100.00% CPU
    45,990 processor cycles
    0 bytes consed

    #Lisp

  9. @Regenaxer @borkdude @vindarel Thanks! Right, so my comparable in-REPL times for iterative factorial 1000 are

    #PicoLisp: (bench (apply * (range 1 1000)))
    0.000 sec
    #Clojure: user=> (time (apply *' (range 1 1000)))
    "Elapsed time: 2.428199 msecs"
    #SBCL: CL-USER[1]: (time (apply #'* (alexandria:iota 1000 :step 1)))
    Evaluation took:
    0.000 seconds of real time
    0.000015 seconds of total run time (0.000000 user, 0.000015 system)
    100.00% CPU
    45,990 processor cycles
    0 bytes consed

    #Lisp

  10. @borkdude @vindarel @Regenaxer #PicoLisp doesn't have macros, by design. Its `time` function returns the time of day. So while there may be a way of timing a computation in the REPL, I've not found it yet.

    #Lisp

    software-lab.de/doc/refT.html#

  11. @borkdude @vindarel @Regenaxer #PicoLisp doesn't have macros, by design. Its `time` function returns the time of day. So while there may be a way of timing a computation in the REPL, I've not found it yet.

    #Lisp

    software-lab.de/doc/refT.html#

  12. @borkdude @vindarel @Regenaxer #PicoLisp doesn't have macros, by design. Its `time` function returns the time of day. So while there may be a way of timing a computation in the REPL, I've not found it yet.

    #Lisp

    software-lab.de/doc/refT.html#

  13. @borkdude @vindarel @Regenaxer #PicoLisp doesn't have macros, by design. Its `time` function returns the time of day. So while there may be a way of timing a computation in the REPL, I've not found it yet.

    #Lisp

    software-lab.de/doc/refT.html#

  14. @borkdude @vindarel @Regenaxer #PicoLisp doesn't have macros, by design. Its `time` function returns the time of day. So while there may be a way of timing a computation in the REPL, I've not found it yet.

    #Lisp

    software-lab.de/doc/refT.html#

  15. @borkdude @vindarel @Regenaxer Again, this is true and fair. I haven't yet learned enough #PicoLisp to do a comparison timing in the REPL.

    What's interesting (to me) is that PicoLisp is also doing recursive computations at very high speeds. I need to explore further but it's an *extremely* impressive system, and I'm amazed I wasn't aware of it before today.

  16. @borkdude @vindarel @Regenaxer Again, this is true and fair. I haven't yet learned enough #PicoLisp to do a comparison timing in the REPL.

    What's interesting (to me) is that PicoLisp is also doing recursive computations at very high speeds. I need to explore further but it's an *extremely* impressive system, and I'm amazed I wasn't aware of it before today.

  17. @borkdude @vindarel @Regenaxer Again, this is true and fair. I haven't yet learned enough #PicoLisp to do a comparison timing in the REPL.

    What's interesting (to me) is that PicoLisp is also doing recursive computations at very high speeds. I need to explore further but it's an *extremely* impressive system, and I'm amazed I wasn't aware of it before today.

  18. @borkdude @vindarel @Regenaxer Again, this is true and fair. I haven't yet learned enough #PicoLisp to do a comparison timing in the REPL.

    What's interesting (to me) is that PicoLisp is also doing recursive computations at very high speeds. I need to explore further but it's an *extremely* impressive system, and I'm amazed I wasn't aware of it before today.

  19. @borkdude @vindarel @Regenaxer Again, this is true and fair. I haven't yet learned enough #PicoLisp to do a comparison timing in the REPL.

    What's interesting (to me) is that PicoLisp is also doing recursive computations at very high speeds. I need to explore further but it's an *extremely* impressive system, and I'm amazed I wasn't aware of it before today.

  20. @vindarel That's true. The startup time issue is particularly harsh on #clojure, and @borkdude's #Babashka would probably do a lot better.

    But (a) this is very rough timing, and (b) startup time is some sort of proxy for the compactness of the runtime system; and
    (c) the thing that's still astounding me is that #PicoLisp is (sort-of) an interpreter, while all the others execute compiled code, so bloody should be faster!

    #Lisp

  21. @vindarel That's true. The startup time issue is particularly harsh on #clojure, and @borkdude's #Babashka would probably do a lot better.

    But (a) this is very rough timing, and (b) startup time is some sort of proxy for the compactness of the runtime system; and
    (c) the thing that's still astounding me is that #PicoLisp is (sort-of) an interpreter, while all the others execute compiled code, so bloody should be faster!

    #Lisp

  22. @vindarel That's true. The startup time issue is particularly harsh on #clojure, and @borkdude's #Babashka would probably do a lot better.

    But (a) this is very rough timing, and (b) startup time is some sort of proxy for the compactness of the runtime system; and
    (c) the thing that's still astounding me is that #PicoLisp is (sort-of) an interpreter, while all the others execute compiled code, so bloody should be faster!

    #Lisp

  23. @vindarel That's true. The startup time issue is particularly harsh on #clojure, and @borkdude's #Babashka would probably do a lot better.

    But (a) this is very rough timing, and (b) startup time is some sort of proxy for the compactness of the runtime system; and
    (c) the thing that's still astounding me is that #PicoLisp is (sort-of) an interpreter, while all the others execute compiled code, so bloody should be faster!

    #Lisp

  24. @vindarel That's true. The startup time issue is particularly harsh on #clojure, and @borkdude's #Babashka would probably do a lot better.

    But (a) this is very rough timing, and (b) startup time is some sort of proxy for the compactness of the runtime system; and
    (c) the thing that's still astounding me is that #PicoLisp is (sort-of) an interpreter, while all the others execute compiled code, so bloody should be faster!

    #Lisp

  25. While looking into how viable it is to write Android applications in something else than Java, Kotlin or <insert web technology>, I've found a neat #picolisp blog explaining Pilbox and adjacent topics:

    picolisp-explored.com/

  26. While looking into how viable it is to write Android applications in something else than Java, Kotlin or <insert web technology>, I've found a neat #picolisp blog explaining Pilbox and adjacent topics:

    picolisp-explored.com/

  27. @lojikil @jpreisendoerfer @anticomputer So jealous you have coworkers to discuss #lisp with at depth :-)

    I've dabbled with ISLisp and InterLisp (have the thick blue book on InterLisp and have played with emulator). Mostly I use #commonlisp but lately I've been taking another look at #picolisp

  28. @lojikil @jpreisendoerfer @anticomputer So jealous you have coworkers to discuss #lisp with at depth :-)

    I've dabbled with ISLisp and InterLisp (have the thick blue book on InterLisp and have played with emulator). Mostly I use #commonlisp but lately I've been taking another look at #picolisp

  29. 16th #EuropeanLispSymposium
    #CallForPapers

    The #ELSConf invites high quality papers about novel research results, insights and lessons learned from practical applications, and educational perspectives. We also encourage submissions about known ideas as long as they are presented in a new setting and/or in a highly elegant way.

    🏷️ #Lisp #CommonLisp #Scheme #Emacs #Clojure #Racket #ACL2 #AutoLisp #ISLISP #Dylan #SKILL #Hy #Shen #Carp #Janet #uLisp #Picolisp #Gamelisp #TXR #MOP #CLOS #CfP

  30. 16th #EuropeanLispSymposium
    #CallForPapers

    🔭 Scope 🔭

    The #ELSConf is a premier forum for the discussion and dissemination of all aspects of design, implementation and application of any of the Lisp dialects, including #CommonLisp, #Scheme, #Emacs #Lisp, #Clojure, #Racket, #ACL2, #AutoLisp, #ISLISP, #Dylan, #SKILL, #Hy, #Shen, #Carp, #Janet, #uLisp, #Picolisp, #Gamelisp, #TXR, and so on.

    We encourage everyone interested in Lisp to participate!

    🏷️ #MOP #CLOS #MetaObjectSystem #AMOP

  31. 16th #EuropeanLispSymposium
    #CallForPapers

    April 24-25, 2023
    Startup Village, #Amsterdam (NL)

    ➡️ european-lisp-symposium.org/20

    📅 Important Dates 📅

    ➡️ 2023-02-26 — Submission deadline
    ➡️ 2023-03-26 — Author notification
    ➡️ 2023-04-09 — Final Papers Due
    ➡️ 2023-04-24 — Day 1, Monday
    ➡️ 2023-04-25 — Day 2, Tuesday

    🏷️ #ELSConf #Lisp #CommonLisp #Scheme #Emacs #Clojure #Racket #ACL2 #AutoLisp #ISLISP #Dylan #SKILL #Hy #Shen #Carp #Janet #uLisp #Picolisp #Gamelisp #TXR #MOP #CLOS #CfP #AMOP