Subscribe

Re: picodb

Hi Mike, you might try the series http://www.prodevtips.com/2008/04/23/simple-oodb-in-pico-lisp/ 2015-11-08 17:16 GMT+01:00 Alexander Burger : > Hi Mike, > > > as usual entry price for picolisp eco system is high. > > i'm on next level, want write trivial code to store

Re: PicoLisp is now in Arch Linux AUR

Thanks, thats great. Am 18.11.2015 16:06 schrieb "Brian Walker" : > Hi all, > > PicoLisp is now in Arch Linux/Manjaros AUR repository: > > https://aur.archlinux.org/packages/picolisp/ > > Out of the box it should build on x86-64 and i686 systems. > > If you can, please test it

Re: picolisp repo

Nice, thats helpfull. Thank you. Am 28.12.2015 15:31 schrieb "Mike Pechkin" : > hi, > > I've changed my opinion, after picolisp gone from code.google.com > > I gonna manually support synchronization in my repo between picolisp > releases. > Now in repo i have 15.11

Re: New article about bin/ssl

Thank you looks great! Question: "-" before *file* argument cause filename to be treated as string What does it mean when filename is handled as String? What kind of string? Is escaping supported? How is it treated, when its without -? I hope you clearify this in the wiki. Am 23.11.2015 08:13

Re: questions about the gui

I assume you fear that a port gets binded to a socket twice. That can not happen, since unix/linux does not allow two processes to bind the same process. (app) calls the pil function (port). The port function itself is able to find a unused port an binds it. For more details read (doc 'port) If

Re: questions about the gui

Hello, It is a local shell that connects to a local webserver. It can be used for webdevelopment, you can expect variables and so on. (app) open a new process with a new port. So each process and each single user linked to it can has a own state. The user can connects to his new port. Does it

Re: binary search

Hi have you thought about implementing a skip list? It would be implemented very easily, it in particular excels with biased queries (certain parts more often than others) and other interesting properties, but has O(log(N)) access time, you could in theory even map some functions (which do not

Re: Documentation for httpGate

> It will be started by httpGate again on demand. User sessions in turn terminate automatically after 5 minutes (if nobody logged in) or 1 hour (if a user is logged in), unless JavaScript is enabled in the client browser and the application calls ( 7) in its main 'action' function. In that case,

Re: Documentation for httpGate

> This is a valid question. I am glad it is. > The issue is rather complicated, It did not seem that hard to explain. > and the documentation terse. I agree, this is just your style of documentation. Thanks for the clear cut explanation.

Re: Redesigned Wiki is Live

> > Basically, it's super efficient. > ​I find that quote on the start site problematic. I would love to see it changed. But redesign on its own is great. 2016-03-25 11:58 GMT+01:00 Jon Kleiser : > Hi Erik, > > Great job! There is one feature I miss, however, and that’s the

Re: Future of PicoLisp?

T Am 23.02.2017 22:52 schrieb "Lindsay John Lawrence" < lawrence.lindsayj...@gmail.com>: > I am relatively new to picolisp, with limited knowledge of its development > history... but I'll politely disagree with some suggestions here regarding > making the core more 'popular' and open to

Re: P35 Prime Factors

The purpose of the list is to increase the speed of the algorithm by skipping some numbers. This is possible because of the math of Differences between consecutive primes but i am currently verifying the algorithm if it works, since the list might be wrong. 2017-02-25 7:44 GMT+01:00 Lindsay John

Re: P35 Prime Factors

; > On Sat, Feb 25, 2017 at 09:36:04AM +0100, Joh-Tob Schäg wrote: > > The purpose of the list is to increase the speed of the algorithm by > > skipping some numbers. This is possible because of the math of > Differences > > Correct. > > > between consecutive p

later and output

I tried to parallelize the following code: '(let N 2 (while (> 1000 N ) (check N) (inc 'N))) where (check N) is defined as '(ifn (= N (apply '* (prime-factors N))) (print N)) 'later has the following form '(later place_where_to_save_the_return_result . program to execute)

Workers for multicore processing (Question and RFC)

There are limits on how many processes can exist at the same time and having more 'later processes than cores is wasteful and Linux only allows for 1024 file descriptors per process. ? (for N 1 (later (cons) (* N N))) !? (pipe (pr (prog (* N N Pipe error: Too many open files ? N -> 339 Is

Re: later and output

I am glad i could be of some help. To be honest Linsday you do a good job for the community and a better job than i do to be honest. Maybe somebody can spend some time and spin this in to a draft for the future less terse picolisp documentation. I am currently busy with learning for pre-exames.

Re: Recursion-Loop Macro?

I will think about doing a f-expr for that. Am 12.02.2017 11:50 schrieb "Mike Pechkin" : > write yourself recursion call and you will see you don't need macro. > > > On Sun, Feb 12, 2017 at 5:40 AM, Christopher Howard < > christopher.how...@qlfiles.net> wrote: > >> Hi

Re: box? on address

Doesn't 'circ? also set the gc bit? Could it be possible that 'circ? evaluates a term which accesses something with a changed pointer? Am 10.02.2017 18:12 schrieb "Alexander Burger" : > H Danilo, > > > Please take a quick look at [path "@doc64/structures"] and > > source

Re: Segfault with huge list...?

Linsday when you want to prevent values from neing printed take a look at the 'nil function. Am 10.02.2017 19:44 schrieb "Lindsay John Lawrence" < lawrence.lindsayj...@gmail.com>: > If it even matters, the overhead of recurse is slowest here. > So impressive that picolisp can iterate/recurse over

Re: altering LOCAL list elements

Not related to your problem. You might wanna take a look at the 'need function. Furthermore i fail to understand your problem. If picolisp behaves unexpected could you please describe what behavior you expect wjat you get and provide a test case which runs the functions it defines? Alternativly

Re: box? on address

Hi Regenaxer, I realize that there is no probkem with the evaluation of 'circ?. Could 'later be (miss)used to cause some havick when it writes back data? What about timer triggered code? Am 10.02.2017 22:40 schrieb "Alexander Burger" : > Hi Joh-Tob, > > > Doesn't 'circ?

Re: altering LOCAL list elements

I understand your problem now. You have think about cells in this case. When you inc a 'symbol the value part of the symbol-cell is changed. [prop|val] represents a symbol in this case. (inc '[NIL|5]) is [NIL|6] The Symbol was changed destructivly. All earlier refernces to this cell now evaluate

Re: Segfault with huge list...?

That sounds very plausible. Am 10.02.2017 14:35 schrieb "Joe Bogner" : > It sounds like it's exceeding the stack size. Have you tried setting it to > unlimited? ulimit -s unlimited > > http://www.mail-archive.com/picolisp@software-lab.de/msg01203.html > > On Fri, Feb 10, 2017

Re: binding free symbols in a lambda definition

Why not "(de myf FList (apply (car Flist) (cdr Flist))"? Am 08.02.2017 05:04 schrieb "pd" : > Hello, > > I wonder if there is any way to bind a free symbol in a lambda in order to > pass the lambda to a defined function (for example) > > What I want to do is something

Re: Segfault with huge list...?

I had a similar experience. It tends to happen if you allocate to much at once. Should be around 16 Megabyte in this case which normally is no problem. If you have such a long list and want to apply functions to it I would use generators instead. They are less ram intensive. You do things wrong.

Re: Segfault with huge list...?

Maybe you want to try (nil (range 1 100)) and see if the problem is there. Am 10.02.2017 14:24 schrieb "Joh-Tob Schäg" <johtob...@gmail.com>: > I had a similar experience. It tends to happen if you allocate to much at > once. Should be around 16 Megabyte in th

Re: Segfault with huge list...?

(de natsum (N) (if (=0 N) 0 ( + N ( natsum ( dec N) Like that? Am 10.02.2017 15:28 schrieb "Mike Pechkin" : > hi, > > On Fri, Feb 10, 2017 at 3:07 PM, Christopher Howard < > christopher.how...@qlfiles.net> wrote: > > > Hi list. When I try to do >

Re: altering LOCAL list elements

it with something new...as you say though it > creates a whole new AND GLOBAL list because of setq. > (setq L (insert '1 (remove '1 L) 2)) > > Irrespective...thank you for your further advice. > > > > > On 11 February 2017 at 10:51, Joh-Tob Schäg <johtob...@gmail.com&

Re: BBWT

> Yes, gotta love lisp for the ability to do this (and other things). :) > But more often than not this features are not required in practice. Sadly it is just cool and not significant. :( 2017-02-26 17:06 GMT+01:00 Rick Hanson : > A bit off-topic, but I like how this

Re: exercism.io

Thanks for sharing. Can you link the list of tasks or is it behind a login wall? 2017-02-25 9:42 GMT+01:00 Alexander Burger : > Hi Mike, > > > I've implemented tasks from A to F: > > https://bitbucket.org/mihailp/tankfeeder/src/ >

Re: Scaled division and sqrt

Now there are before there were not. Am 27.02.2017 10:07 schrieb "Lindsay John Lawrence" < lawrence.lindsayj...@gmail.com>: > Hi, > > Are there scaled (fixed point) versions of division and sqrt in picolisp? > I may have missed them.. > > In any event I wrote a couple of functions to provide that

Re: slow nth

hi, would you mind sharing the performance improvement you achieved using a better suited data structure (tree vs linked list) on your machine once you fully implemented the SBOXES for both cyphers? On my machine (2010 netbook with Intel Atom core using PIL version (3 1 8 0)) i get the following

Re: forgotten password

Forgot your password for what service? Am 17.11.2016 07:53 schrieb : > Hi, > > my login name is vikid > > but I forgot my password. > > thanks, > > vidyuth > > -- > > vuk...@fastmail.com > -- > UNSUBSCRIBE: mailto:picolisp@software-lab.de?subject=Unsubscribe >

Re: First post

I I V [p1; p2; +date] : relationship I ^ V I [Edi Ward; LOVES] : person > > If so we have a property graph database!! > > Best, > Eric Best, freeemint_ > > Le 16/11/2016 à 08:19, Joh-Tob Schäg a écrit : >> >

Re: map-reduce

"Any technology distinguishable from magic is insufficiently advanced." Or something like that … freeemint_ Am 16.11.2016 12:15 schrieb "Mike Pechkin" : > > > >> The parallel magic seems to be here: >> >> > ​PicoLisp is pure magic itself. > > Mike > ​ > > >

Re: First post

Dear Regenaxer, Just out of curiosity: Is there a more elegant way to have links with properties than the way i mentioned? Am 16.11.2016 15:44 schrieb "Alexander Burger" : > Hi Joh-Tob, Eric, > > > i talked about storing Pilog rules in a database with Regenaxer(Alexander >

Re: misunderstanding executing data as code

First things first. One does not simply say that the pil interpreter is missunderstanding. Secondly does 'pack fix your problem? Do you know the difference between a list of chars and a "string-like Symbol"? 2016-12-10 23:01 GMT+01:00 dean : > The following program

Re: misunderstanding executing data as code

You can produce a readable version of a function by (pp 'function) 2016-12-11 8:12 GMT+01:00 Alexander Burger : > Hi Dean, > > first of all, could you please try to produce some readable, Lisp-style > formatted code for your posts? If possible, boiled-down and simplified >

Re: help extracting number from string

If i understood it correctly he wants to get all groups of number. "35f79" -> (35 79) Am 16.12.2016 09:28 schrieb "Joe Bogner" : > how about > > : (extract format (chop 'ab33Cd)) > -> (3 3) > > or > > : (format (pack (extract format (chop 'ab33Cd > -> 33 > > > On Thu,

Re: help extracting number from string

I am just telling you pick can not help you here. In this case just write a coroutine. You can handle different reading modes (numbers vs strings) in there easily. Am 16.12.2016 06:24 schrieb "dean" : > I've seen num? and chop but think I need something in the middle to

Re: Loosing elements in a sorted list

If they become unreachable, they will be collected. That is a more compact way ofnsaying what i just said. If you want to get more technicalnread mine but this one is easier to understand Am 17.12.2016 03:53 schrieb "John Duncan" : > If they become unreachable, they will

Re: Loosing elements in a sorted list

Assuming ( 1 . Pointertotheonecontaining(2)) and ( 2 . Pointertotheonecontaining(3)) are no longer referenced by a node referenced by the global name space. They will be reclaimed during next gabarage collection and added to the free cell list. Am 17.12.2016 03:33 schrieb "Bruno Franco"

Re: help with list of capital letters as symbol property key

Maybe can hepl you with that it inserts 15 numbers with different keys and prints the result after each insert or at least it should. Could not try it

Re: help with list of capital letters as symbol property key

assoc '(a) '(((a) vlu_a1 vlu_a2) ((a b).vlu_ab1))) #'(a) is the key (vlu_a1 vlu_a2 ) to be exact. Since ((a) vlu_a1 vlu_a2) is ((a) . (vlu_a1 vlu_a2)) Am 17.12.2016 04:53 schrieb "dean" : > >'assoc'iation list for such purposes. That is probably the fastest, and > surely

Re: best way to create global list variable/symbol

is " *L) ) ) > > (doit *L) > (prinl "outside fn *L is " *L) > > #inside of fn *L is ab > #outside fn *L is ab > > > > On 17 December 2016 at 22:51, Joh-Tob Schäg <johtob...@gmail.com> wrote: > >> For the case: >> (setq A ( 1 2 3 )

Re: best way to create global list variable/symbol

For the case: (setq A ( 1 2 3 )) There is no (efficient) way to find the symbol (1 2 3) is bound to. So would you have to know the symbol all the time. (de add-to-global-list (Sym Value) (setq Sym (cons Value Sym))) (de delete-from-global-list (Sym) (setq Sym (cdr Sym))) But i guess you do

Re: Incomplete documentation on 'need'

You are welcome. But from my personal experience the documentation is rather terse and changes happen not that often. Also (doc 'need) does state what it does do. Read the last two lines `second form`. It is very unclear and i hope Regenaxer takes a look and clarifies it. 2016-12-03 23:41

Re: Login Problems Wiki

If you would create an account for testing purposes other people could give there feedback when testing other browsers. providing an login would improve reproducability. Am 02.12.2016 04:45 schrieb : > Hi, > > For my blog: thevikidtruth.com > > I did some testing on logging

Re: qurious quoting

Are there any questions remaining? Am 01.01.2017 16:43 schrieb "Danilo Kordic" : > : (setq E > '(= (quote 'quote quote) > (quote (quote . quote) quote) > (quote . ((quote . quote) . (quote . NIL))) ) ) > : (eval E) > -> T > : (view (cadr E)) > +-- quote > | >

Re: Advice on learning the picolisp asm?

I think if Regenaxer adds a new function the function pointer and thereby the binary(assembly code) becomes invalid. Am 31.12.2016 13:17 schrieb "Alexander Burger" : > On Sat, Dec 31, 2016 at 12:28:06AM -0500, Bruno Franco wrote: > > I don't really know any asm, but since

Re: qurious quoting

' is a read macro. (4 ' 4 7 8 6) is read is replaced a quoted version of the next list/atom. Not sure that helps try to understand the problem by drawing memory cells. There is a structural difference which is handled in another ways by the printer. Am 31.12.2016 05:49 schrieb "Bruno Franco"

Re: why does my thread appear to have been started by Willie Arnold who

Please if you find a solution to your own problem next time append it as answer to your question to prevent others from waisting there time responding... 2016-12-22 22:28 GMT+01:00 dean : > BTW I seem to have answered my own queston i.e. > If I wrap an evaluated symbol

Re: how to append an element with nested parens and an evaluated centre

What is the purpose of the symbol V? Is seems like dead code to me. Please check your code for correctness before asking question. The first line does not make any sense for another reason. If you want to have a the list (a (("String"))) use: (setq L (append L '((("String") I assume you

Re: (= code data)

Classic Am 27.12.2016 19:08 schrieb "Lindsay John Lawrence" < lawrence.lindsayj...@gmail.com>: > I've been working my way through the Rosetta code examples as a way to > build fluency in picolisp. This little gem was an epiphany in my > understanding of the equivalence of code and data in lisp. >

Re: Full documentation in a single document?

There is not. I talked about he same thing with Regenaxer the day before yesterday. It would be very helpfull if you did create such a script. You might also think about updating the hyperlinks. I have an idea for a long term solution but the implemenation migjt take a while. Am 19.12.2016 22:51

Re: Documenting PicoLisp code?

Either comments inside the code.# Like that Transistent Symbols at the beginn of the funtion. (de power (N E) "Calculates the exponent in a wastefull manner" (apply '* (need E N))) I have not seen another approach in Picolisp yet Am 24.03.2017 04:15 schrieb "Christopher Howard" <

Re: Random Access?

> Hi list. I noticed that when I evaluate > > (list (box) (box) (box)) > > I get > > ($177760526373112 $177760526373114 $177760526373116) > That is common if you just restarted the session or you just needed to allocate a new block of cells. > Where each memory location is two more than the

Re: Random Access?

Damn you were faster. Am 25.03.2017 07:57 schrieb "Alexander Burger" : > Hi Christopher, > > > (list (box) (box) (box)) > > ... > > ($177760526373112 $177760526373114 $177760526373116) > > > Where each memory location is two more than the previous. I am wondering > > Yes.

Re: Documenting PicoLisp code?

@@@ with these. The resulting code is also slower. Comments are often preferred for that reason. 2017-03-28 19:26 GMT+02:00 Tim Johnson <t...@akwebsoft.com>: > * Joh-Tob Schäg <johtob...@gmail.com> [170323 22:18]: > > Either comments inside the code.# Like that > > >

Re: Documenting PicoLisp code?

My pleasure 2017-03-28 20:20 GMT+02:00 Tim Johnson <t...@akwebsoft.com>: > * Joh-Tob Schäg <johtob...@gmail.com> [170328 10:09]: > > It is no doc string in the elisp sense even though function and syntax > are > > similar. > > > > (de do_nothing

Re: Fixed-point scaling and lookup tables

I'll wait. 2017-04-01 22:45 GMT+02:00 Lindsay John Lawrence < lawrence.lindsayj...@gmail.com>: > My next little picolisp project... > > Picolisp's built-in functions for scaled arithmetic are brilliant once you > understand how they work. Still, it would be great to get more scientific >

Re: Is there documentation for the libraries in @lib/ ?

Yes you can not find any documentation. 2017-04-02 3:36 GMT+02:00 Bruno Franco : > I can find the documentation for the default functions, and for the form > functions, but how about libraries like pilog.l or http.l? >

Re: Evaluation confusion

You seem to want to implement a search binary tree. Take a look at 'idx it already does that for you. A possible source of the trouble could be related to 'cadr in '(pp 'rooms). Also what project are you working on? (Just curious) 2017-04-01 7:46 GMT+02:00 Christopher Howard

Re: Evaluation confusion

No that is not true. : (setq "ABC" 3) -> 3 : "ABC" -> 3 : (setq "ABD" 2) -> 2 : (> "ABC" "ABD") -> T But it is always true if the transient symbols do not refer to themselves. See Comparing in the docs. > Numbers are comparable by their numeric value, strings by their name, and > lists

Re: Header parsing

If people are currently working on improving the mailing list. I would be very pleased not receive automated emails about thanking people for joining or leaving. Has anybody else strong opinions about that? 2017-04-19 22:16 GMT+02:00 Henrik Sarvell : > Hi Rowan, > > If it

Re: L-system rules with PicoLisp

Makes sense probably. The greatest compliment i received in months. 2017-03-03 20:04 GMT+01:00 Alexander Burger <a...@software-lab.de>: > On Fri, Mar 03, 2017 at 01:39:25PM +0100, Joh-Tob Schäg wrote: > > I haven't figured out how to do it yet, but I think, in this case, a

Re: future?

Today i learned something on IRC regarding hosting Picolisp: [11:30] I found a mistake in (doc '+Joint) > [11:30] oh > [11:31] is the missing part: pos (+Ord)) ? > [11:32] then parenthesis? > [11:32] yes, something is missing > [11:33] it depends how much we want to write > [11:33] The

Re: Announce: PilBox - Building Mobile Apps in PicoLisp

need to buy a new smartphone. ​ 2017-03-12 20:15 GMT+01:00 Joh-Tob Schäg <johtob...@gmail.com>: > Non homebrew iOS will not be possible since it is not allowed to create > apps which run user code with access to the device api. > > 2017-03-12 18:54 GMT+01:00 Amaury

Re: Announce: PilBox - Building Mobile Apps in PicoLisp

Non homebrew iOS will not be possible since it is not allowed to create apps which run user code with access to the device api. 2017-03-12 18:54 GMT+01:00 Amaury Hernández Águila : > Will it be possible to have iOS apps in the future too? > > On Sun, Mar 12, 2017 at 10:42 AM

Storing functions in the database

Hello, i try to store a function is a database. Can somebody spot what i am doing wrong? (pool "types.db") #empty : (class +Function +Entity) -> +Function : (rel name (+Idx +String)) -> +Function : (rel body (+Bag +Bag +Need)) -> +Function ? (select +Function) {5} (+Function) name

Re: Unclear licensing

*Actions over Words:* Step 1. Patch the latest download so it contains the license information locally. Step 2.? Step 3. Profit! Hint: ? is finding a new place to host and go to 1. 2017-03-13 19:09 GMT+01:00 Bruno Franco : > I think that what

Re: native calling

I am not sure this sensible or even doable, but a binding to the torch library (http://torch.ch) would be cool. Since Picolisp could use high speed high dimensional math and machine learning. It is written in C++ and already has a LUA interface. It needs a newer (< 4 years, i guess) NVIDIA

Re: L-system rules with PicoLisp

Is the garbage collection in picolisp immediate if the resource can be released? No, picolisp uses a mark and sweep halt the world garage collector. During sweep phase the complete allocated RAM is checked. If that would happen after each release of a resource picolisp would be very slow.

Re: L-system rules with PicoLisp

onger accessible so it can be deallocated call: 4 4 The copy of A is no longer accessible so it can be deallocated call: 5 5 The copy of A is no longer accessible so it can be deallocated 2017-03-03 12:47 GMT+01:00 Joh-Tob Schäg <johtob...@gmail.com>: > Is the garbage collection in picoli

Re: PilMCU status

If you are still searching an FPGA board you might want to get in contact with j-core.org They build an open source processor and are developing an RasPi form factor compatible FPGA board. Am 18.04.2017 10:49 schrieb "Rowan Thorpe" : > On 18 April 2017 at 09:32, Alexander

Re: PicoLisp as first language

Hello, i would update Definitions, assignment and bindings Let is only used for local Am 31. Juli 2017 16:07:38 MESZ schrieb Nehal : >Dear PicoLisp programmers, > >Hi! I am Nehal, a new PicoLisp learner and programmer from India. > >I am currently working on making

Re: PicoLisp as first language

Hello I would update Definitions, assignment and bindings Let is only used for local assignments. setq compares to best to the examples of the other languages. Sincerely, Am 31. Juli 2017 16:07:38 MESZ schrieb Nehal : >Dear PicoLisp programmers, > >Hi! I am Nehal,

Re: Picolisp within Picolisp (for games, etc.)? Or, PicoLisp VM?

I thought about the same. My insights are: You can 'let all relevant symbols with alternative functions or just NIL. Adresses 1 & 2 You might want to change the repl in a way that if for example the symbols car and list are evaluated they return a meaningless number. (It might be possible to

Re: Introduction

While your long write-up is certainly welcome it is also unnecessary in my humble opinion. We gladly welcome you in the community. Just visit the IRC-channel #picolisp on freenode.net 2017-05-24 17:27 GMT+02:00 Jimmie Houchin : > Hello, I just want to take an opportunity to

Re: Less powerful 'str?

Take a look at 'read. You may need to 'eval the result. If 'read does not suit your needs i wrote a tokenizer and parser but the source code is not yet ready fot publication Am 17.06.2017 23:42 schrieb "Christopher Howard" < christopher.how...@qlfiles.net>: > Hi list. I find that the 'str

Re: Order by database question

That could be because of +Key. Am 01.05.2017 02:18 schrieb "Henrik Sarvell" : > Hi list, > > I've been looking through the docs and all my notes but it looks like I'm > not managing to get the result I want no matter how I try. > > I've got this E/R: > > (class +UrlTag

Re: Subscribe

As another young person (maybe even younger than you) i can only recommend two things. Hang around in the #picolisp IRC on freenode.net and improve your skills by self cultivation. I had the biggest insights about the nature of picolisp when i tried to solve problems which i found interesting.

Re: Screenshot of local Wiki

Hello, i find the black on black text very hard to read 2018-06-23 12:16 GMT+02:00 Arie van Wingerden : > >

Re: Wiki css

I would also keep it and somebody finds something annoying (like italic headlines) they should just send an "upgraded" css to the mailing list and have some people try it out. 2018-06-25 11:03 GMT+02:00 Manuel Cano : > Hi all, > > I like as it is now. Ari has made a good job, don't throw it

Re: Math exp issue?

Hi since i basically study mathematics at the moment i will implement exp in pure picolisp when i find the time. 2018-01-29 8:25 GMT+01:00 Alexander Burger : > On Mon, Jan 29, 2018 at 08:14:31AM +0100, Alexander Burger wrote: > > To the question why it returns 101

Re: address sanitize

Hello mike, why would we want address sanitation? Thanks 2018-07-04 22:25 GMT+02:00 Mike : > hi, > > 1. pil32 (C version) passed builtin tests in gcc 8.1.1. under address > sanitize (-fsanitize=address). > 2. undefined behavior still cant understand trivial shifts math in big.c > and generates

My 5 minutes lightning talk at FrosCon

Since there is some much stir around the presentation made by mtsd. (Great work by the way) I decided it is a good time to put my lightning talk at FrosCon out there. Attached is the original version i gave. Inline is an updated version with more content which could function as a PicoLisp tutorial

FrosCon lighting talk [German]

Hi, I did an lighting talk on PicoLisp at FrosCon this year. The video is now out. My part starts at https://media.ccc.de/v/froscon2018-2322-lightning_talks#t=975 While I was terribly exited and my presentation skills where not as good as they might have been if I prepared more I still wanted to

Re: PicoLisp v. MicroPython ?

well there is MicroPicoLisp which aims for the low ram embedded space. PicoLisp itself depends on some Unix abstractions which are not present in all systems but MicroPicoLisp should be fine.   Ursprüngliche Nachricht   Von: hbak...@pipeline.com Gesendet: 23. Januar 2019 01:06 An:

Re: FrosCon lighting talk [German]

. :)  Solid, man!  Again, thanks, freemint! On Fri, 16 Nov 2018 21:23 +0100, Joh-Tob Schäg wrote: > Hi, > > I did an lighting talk on PicoLisp at FrosCon this year. The video is > now out. > My part starts at > https://media.ccc.de/v/froscon2018-2322-lightning_talk

Re: PicoLisp for 9-11 years' kids

Hello Nehal, here are several tangent thoughts. First: PicoLisp is great for mathematics, as long as you stay with integers or fractions (frac.l). Working with 2.321 by *Scl is cumbersome and there is no good way to hide the scaling for a new users yet. Even when it is very irritating. I

Re: Database question

Your code has several unclearities/problems. Why do you create and store a new Symbol in the property and then set it's value to the value you want to store? Why don't you just store the value in the property? (Like (put *DB k v) for kv-add) Why do you set the value of the first symbol to "Root"

Re: Waiting for a forked child to finish

The docs: (later 'var . prg) -> varExecutes prg in a pipe'ed child process. The return value of prg will later be available in var. Note that later uses pr and rd to communicate the result, so prg should not write any data to standard output as a side effect. : (prog1 # Parallel background

Re: cloud host for picolisp

Hi Derenik, i know of no hoster which provides setup or support for PicoLisp. You are on your own, but that is less scary that it sounds: 1. Pick a Linux/BSD of your choice 2. install PicoLisp from source or package manager 3. Setup a proxy server to handle encryption etc. (NGINX + HTTP-Gate or

Re: Creating slides in Picolisp

I know of no such solution but there is a texbinding

Re: Why List?

Lisp is language where expression are executed in order. Since lisp code is expressed in data, we need something that has a way of expression of express ordering. That is possible in a dictionary too. Let's imagine the code: {fak => {1 => {1 => N}, {2=>{1=>if, 2=>{1 => =, 2=> N, 3=>0}, 3=>1,

Re: PicoLisp for 9-11 years' kids

Hello Nehal, I've been doing some catching up on these videos. Mr. Alabhya Singh took quiet some time to explain this mathematical problem with the different approaches. I recall that in Germany when i was confronted with the same problem (apply + (range 1 N)), i was taught the Gauss approach (/

Re: Picolisp Facebook Page (@picolisp)

SuperSaiyanBlue, you do not need to be there. You were invited but that does not mean you need to come. I won't come either. Let them found a FB group if they want. Maybe something good will come out of it. I do not think it will have a negative impact on the rest off the community. On Thu, 21

Re: Merry Christmas!!

  Ursprüngliche Nachricht   Von: matt...@inogu.se Gesendet: 24. Dezember 2019 23:47 An: picolisp@software-lab.de Antworten: picolisp@software-lab.de Betreff: Re: Merry Christmas!! Merry Christmas everyone! Mattias George-Phillip Orais skrev: (24 december 2019 15:01:45 CET)

  1   2   >