soegaard

35 ms·

451.
by soegaard 9y ago
Probably means that there ARD no duplicates among the elements.
452.
Microcode-level HP-35 Emulator(blogs.msdn.microsoft.com)
12 points by soegaard 9y ago|0 comments
453.
by soegaard 9y ago
Schedule: https://con.racket-lang.org/
454.
RacketCon 2017 – Live
6 points by soegaard 9y ago|0 comments
455.
by soegaard 9y ago
How do you describe the semantics of `nest` without showing the implementation?
456.
by soegaard 9y ago
Buy a copy for a friend!
457.
by soegaard 9y ago
Some differences between Racket and Chez: - module system - macro system - number of available libraries - community size
458.
by soegaard 9y ago
Brinch Hansen's book is a classic. It contains all necessary code for a self-compiling Pascal compiler (If I recall correctly).
459.
User-programmable infix operators in Racket(lexi-lambda.github.io)
2 points by soegaard 9y ago|0 comments
460.
by soegaard 9y ago
Also: It is rare to use `do`. #lang racket (require math) (for ([i 100]) (displayln (cond [(divides? 15 i) "FizzBuzz"] [(divides? 3 i) "Fizz"] [(divides? 5 i) &quot
461.
by soegaard 9y ago
Python On Racket: https://github.com/pedropramos/PyonR
462.
by soegaard 9y ago
Scheme has a really nice way of representing numbers. The socalled numerical tower can be hard to implement for the language implementors, but it is really nice to have as an user.
463.
by soegaard 9y ago
Apropos: The meaning of # in Scheme number syntax: https://stackoverflow.com/q/10935110/23567
464.
The Yin Yang Puzzle
2 points by soegaard 9y ago|0 comments
465.
by soegaard 9y ago
FWIWI The term "Reader macros" has slightly different meanings in Common Lisp and Racket. In Racket reader macros are used to modify the existing reader. Languages that have "almost" the same syntax as Racket can therefo
466.
by soegaard 9y ago
How so? Can we program Haskell's Hindley-Milner based type checking into Lisp with macros and homoiconicity, and have it run during compile-time? Take a look at Hackett "a fanciful sketch of a programming langua
467.
Asi64 – A Racket-based 6502 assembler(pinksquirrellabs.com)
89 points by soegaard 9y ago|8 comments
468.
by soegaard 9y ago
The plan sounds fine to me.
469.
by soegaard 9y ago
Thanks for info. Cadence? Any relation to Chez Scheme? https://en.wikipedia.org/wiki/Chez_Scheme (Look at the box at the right?)
470.
by soegaard 9y ago
Is Scheme still used by Texas Instruments?
471.
Texas Instruments on Scheme (1984)(groups.csail.mit.edu)
65 points by soegaard 9y ago|13 comments
472.
A Small Nanopass Example(rootmos.github.io)
38 points by soegaard 9y ago|0 comments
473.
by soegaard 10y ago
For anyone interested in how Racket (Matthew Flatt) pulled it off : http://blog.racket-lang.org/2010/12/rebuilding-rackets-graph...
474.
by soegaard 10y ago
Maybe "Beautiful Racket" ? http://beautifulracket.com/
475.
by soegaard 10y ago
Not for long! The Racket community is in the process of relicensing under a more permissive license. See https://github.com/racket/racket/issues/1570
476.
by soegaard 10y ago
Scheme (as in the R5RS spec and earlier) is a very minimal language specification. This means that all practical Scheme implementation add features not present in the specification. In some areas the Scheme implementors agree - and in other
477.
by soegaard 10y ago
FWIW Racket has two types of cons cells: mutable and immutable. And if you know what you are doing - then you can abuse the FFI to mutate the immutable ones (but don't tell anyone) using unsafe-set-mcar! and unsafe-set-mcdr!.
478.
[pdf] 6502 Hacks (from DrDobbs 1987)(archive.6502.org)
3 points by soegaard 10y ago|0 comments
479.
by soegaard 10y ago
Hi Phil, A very nice article! I like that you show how to "remove the magic". I noticed you "aside" at the bottom and wanted to give you a tip. If you open a source file in DrRacket and then click the "Check Syntax&
480.
by soegaard 10y ago
Yes. Use #lang r5rs as the first line in your program to get standard Scheme. Or get #lang sicp from pkgs.racket-lang.org.

More ›