4 ms·

Yes, Lisp was the first memory-safe programming language. And the rich data model is part of that. Fortunately this is something other languages have been borr

Yes, Lisp was the first memory-safe programming language. And the rich data model is part of that. Fortunately this is something other languages have been borrowing from for a while now, and explicit nullability via Option and the like is pretty common.

sargstuff 4y ago
Have yet to see a non-lisp language that fully handles the lisp 'nada' stuff correctly without programmer having to do some extra work. Where equating extra work because language didn't handle primatives as language issue that causes needless problems for programmer. NIL not equivalent to NULL, "", ''. Shortest non-theory example, taken from punchcard reader operations manual. NIL -> no more cards going through card reader. NULL -> reached end of card vertical (carrage return), horizontal, "group"/tab space character all blank card, no data -> no punches, no mem, max line count all blank card, all spaces -> no punches, max mem, max line count all deleted card -> assume doesn't jam machine, no line count. Best command line example would be linearly chaining unix shell scripts using pipes & redirection to simulate a spread sheet. historical command characters (usually non-printable) become the sticking point (pipe & file names). aka is value of 0 a representation of NIL, NULL, no error code, delete character, no-character, string without line terminator, first byte in multi-byte sequence (unicode / internet mask), indirect file/memory location reference. To handle the aformentioned 'specials', have to go outside the linear pipe sequence.
sargstuff 4y ago
Original fortran / lisp era, lot of memory was 2,048 bytes. Lot of very subtle foundational distinctions. From pre-if statement era: Fortran -> 1st order logic logic language / algol / "logic or" based / vector (array/struc): (n * m) -> don't need everything to complete current task(s) / (algebra or calculus) / mealy based Lisp -> 2nd order logic based language / applicative / "logic and" base / polynomial (tree/heap): (1-n) -> MUST have everything to complete current task(s) / (algebra and calculus) / moore based --- https://www.geeksforgeeks.org/difference-between-mealy-machine-and-moore-machine/ https://www.geeksforgeeks.org/difference-between-mealy-machi...
deleted 4y ago
[deleted]
deleted 4y ago
[deleted]

sargstuff 4y ago

Have yet to see a non-lisp language that fully handles the lisp 'nada' stuff correctly without programmer having to do some extra work. Where equating extra work because language didn't handle primatives as language issue that causes needless problems for programmer. NIL not equivalent to NULL, "", ''. Shortest non-theory example, taken from punchcard reader operations manual. NIL -> no more cards going through card reader. NULL -> reached end of card vertical (carrage return), horizontal, "group"/tab space character all blank card, no data -> no punches, no mem, max line count all blank card, all spaces -> no punches, max mem, max line count all deleted card -> assume doesn't jam machine, no line count. Best command line example would be linearly chaining unix shell scripts using pipes & redirection to simulate a spread sheet. historical command characters (usually non-printable) become the sticking point (pipe & file names). aka is value of 0 a representation of NIL, NULL, no error code, delete character, no-character, string without line terminator, first byte in multi-byte sequence (unicode / internet mask), indirect file/memory location reference. To handle the aformentioned 'specials', have to go outside the linear pipe sequence.

sargstuff 4y ago

Original fortran / lisp era, lot of memory was 2,048 bytes. Lot of very subtle foundational distinctions. From pre-if statement era: Fortran -> 1st order logic logic language / algol / "logic or" based / vector (array/struc): (n * m) -> don't need everything to complete current task(s) / (algebra or calculus) / mealy based Lisp -> 2nd order logic based language / applicative / "logic and" base / polynomial (tree/heap): (1-n) -> MUST have everything to complete current task(s) / (algebra and calculus) / moore based --- https://www.geeksforgeeks.org/difference-between-mealy-machine-and-moore-machine/ https://www.geeksforgeeks.org/difference-between-mealy-machi...

deleted 4y ago

[deleted]

deleted 4y ago

[deleted]