HN Simulatornew | past | comments | lists | submit | GregDavidson's commentslogin

Ivan Sutherland's Sketchpad (1963) [1] greatly antedates Lisp Machines (but not Lisp!) and is still the best model imnsho for CAD. [1] https://en.wikipedia.org/wiki/Sketchpad


The first Lisp machines at MIT were mid 1970s, and by that time Evans & Sutherland had been founded and were on their second or third generation CAD products.

I'm less sure about this chronology but I think the Evans & Sutherland CAD systems were some of the first examples of multiple graphics coordinate systems that were the progenitor of overlapping windows and the desktop metaphor.


For folks who want to know more of this there is:

https://www.shapr3d.com/content-library/history-of-cad


Is there a contemporary implementation of these concepts which is readily accessible and well-documented and easy-to-use?


I would point you to Bill Atkinson's Quickdraw: https://github.com/computerhistory/Historical-Source-Code-Qu...


In the context of CAD applications as being discussed


I can run Maxima on my phone. Heaven!


A UK roundabout us not a European traffic circle or a new traffic calming device. The commentary is conflating at least four entirely different things! A UK roundabout has no place for a decorative feature in the middle. It is a device of ruthless efficiency with typically nothing in the middle but a shiny brass plate in the center set flush with the pavement. Traffic barely slows and rarely stops in the UK, necessitating pedestrian underpasses, Pelican crossings, et al.


I'm delighted this exists as all too many students have used Mathematica in their education and now can't afford it. Yet I'm always wondering why one would write an interpreter for something like this. I've used Maxima much longer than Mathematica has existed. There's no Maxima interpreter or compiler. It's just a read table in Common Lisp. So you're really using CL without needing to know that and some CLs, e.g. SBCL, are extraordinarily efficient. Doing such a thing for other SW tools also gives you seemless interop!


If someone can't implement the very simplest Graph Structure, Linked Lists, then I assume they can't implement any linked data structure. Learning variations of Linked Lists is where you start, e.g. https://rust-unofficial.github.io/too-many-lists/


Many working programmers have no need to implement linked data structures in their day to day jobs.


Guidelines | FAQ | Lists | API | Security | DMCA | Apply to YC | Contact

Search: