swatson741

6 ms·

1. 31.▲
   Practical Common Lisp (2006) [video](youtube.com)

   2 points by swatson741 11mo ago|0 comments
2. 32.▲
   Nanopass Framework(nanopass.org)

   3 points by swatson741 11mo ago|0 comments
3. 33.▲
   by swatson741 11mo ago

   I think the term transpiler is ok. It’s not pedagogical or anything but most engineering jargon is like that, and this defiantly isn’t the worst one I’ve seen.
4. 34.▲
   Project Euler(projecteuler.net)

   566 points by swatson741 11mo ago|134 comments
5. 35.▲
   ChezScheme v10.3.0(github.com)

   3 points by swatson741 11mo ago|0 comments
6. 36.▲
   An Algebraic Language for the Manipulation of Symbolic Expressions (1958) [pdf](softwarepreservation.computerhistory.org)

   101 points by swatson741 11mo ago|11 comments
7. 37.▲
   Heroes of the Hardware Revolution: Bob Widler (2014)(hackaday.com)

   1 points by swatson741 11mo ago|0 comments
8. 38.▲
   by swatson741 11mo ago

   So he wants a good parallel language? What's the issue? I haven't had problems with concurrency, multiplexing, and promises. They've solved all the parallelism tasks I've needed to do.
9. 39.▲
   by swatson741 11mo ago

   Norvig actually did comment on this publicly once on the Lex Friedman podcast. Basically what he said was that lisp ended up not working well for larger software projects with 5 or more people on them, and the reason why they never used lis
10. 40.▲
    by swatson741 11mo ago

    I'm referring to the fundamental idea in AI of knowledge representation. Lisp is ideal for chapters 1 through 4 of AIMA, and TensorFlow has shown that NN can be solved well with a domain specific language which lisp is known to be grea
11. 41.▲
    by swatson741 11mo ago

    We know in hindsight that lisp became most useful for representing computation, but what ever happened to AI? McCarthy says it's characteristic of LISP. SICP also mentions AI as being fundamental to lisp at the beginning of the book. N
12. 42.▲
    Backpropagation is a leaky abstraction (2016)(karpathy.medium.com)

    353 points by swatson741 11mo ago|160 comments
13. 43.▲
    Artificial Intelligence – A Modern Approach (visualization of concepts)(aimacode.github.io)

    7 points by swatson741 1y ago|0 comments
14. 44.▲
    The Scheme Machine (1994) [pdf](burgerrg.com)

    32 points by swatson741 1y ago|0 comments
15. 45.▲
    by swatson741 1y ago

    It works but it can’t do much other than demonstrate semantics. The evaluator won’t even be able to add numbers for example.
16. 46.▲
    by swatson741 1y ago

    You're right `virtmach` only works on things that are output from `compile` and maintaining the invariant that virtmach lisp uses those pointers isn't difficult to do in with how the evaluator is presented. It gives virtmach lisp
17. 47.▲
    by swatson741 1y ago

    A C compiler can output fairly readable code if you turn off optimizations, and it's definitely not going to take thousands of lines to do this in modern assembly. It may be only just barely a thousand lines to do this in aarch64, and
18. 48.▲
    by swatson741 1y ago

    You'll still probably need the `strcmp` because the pointers won't be the same unless you check for them and make them the same. You may be thinking about how `eq?` (reference equality) works in scheme. That's usually done by
19. 49.▲
    Show HN: Kent Dybvig's Scheme Machine in 400 Lines of C (Heap-Memory Model)(gist.github.com)

    226 points by swatson741 1y ago|44 comments
20. 50.▲
    by swatson741 1y ago

    The Japanese paper culture is pretty wild. They use them to make fusuma (sliding doors), decorative strips, gift wrapping, etc. And like they say in the report they've done this since forever. There was once a time in history when the
21. 51.▲
    Google Common Lisp Style Guide (Revision 1.28)(google.github.io)

    18 points by swatson741 1y ago|0 comments
22. 52.▲
    Thoughts on Racket and Chez Scheme (2021)(beautifulracket.com)

    4 points by swatson741 1y ago|2 comments
23. 53.▲
    Fundamental Concepts in Programming Languages (1967) [pdf](fpl.cs.depaul.edu)

    3 points by swatson741 1y ago|0 comments
24. 54.▲
    Compiling with Continuations(swatson555.github.io)

    82 points by swatson741 1y ago|25 comments
25. 55.▲
    The Revised Report on Scheme or An UnCommon Lisp (1985) [pdf](dspace.mit.edu)

    47 points by swatson741 1y ago|8 comments
26. 56.▲
    How to Debug Chez Scheme Programs (2002)(scheme.com)

    50 points by swatson741 1y ago|5 comments
27. 57.▲
    by swatson741 1y ago

    Very true but the other side of this is first class continuations are no worse than compiling try-catch semantics, and hygienic macros are still just macros so the complexity is kept simple (sort of. maybe simple isn't always so simple
28. 58.▲
    Software Design for Flexibility (2021)(mitpress.ublish.com)

    1 points by swatson741 1y ago|0 comments
29. 59.▲
    Introduction to Nyquist and Lisp Programming(manual.audacityteam.org)

    100 points by swatson741 1y ago|1 comments
30. 60.▲
    Featured Article: Final Fantasy VII(en.wikipedia.org)

    2 points by swatson741 1y ago|0 comments