Are there any women / poc that are historically notable in the development of lisp/scheme?

I am having trouble thinking of any.

(I can think of current ones, of course)

@krismicinski watch (skim) this one: https://www.youtube.com/watch?v=hGY3uBHVVr4

ok, will do.

He tells about human “computers” which were women. The editor of the Lisp 1.5 manual (I think it was that one) was a woman. He implies that she deserves more credit.

(than given)

Can’t remember where in the video.

Does anyone know a Racket package/library that allows something like this:

#lang racket

(:= a  0)
(:= b  2)
(:= c  0)
(:= d (- (expt b 2) (* 4 a c)))

d ; evaluates to 4

(:= a 1)
(:= c 1)

d ; evaluates to 0

The variables defined with := can depend on each other in the same manner cells in a spread sheet can. I.e. no circular references.

would that be possible with racklog ?

@soegaard2 This reminds me of something one of my friends at Northeastern University did at one point maybe 1 or 2 years ago. It didn’t need to use logic-programming, just mutable state combined with “recomputing” values every time you wanted to use something. It wasn’t very useful as it was though, because it didn’t have a notion of “when” it would need to recompute the values (because a dependency has changed) and when it could use a cached value (because no dependencies have changed between then and now).

it sounds like what you’re talking about is dataflow programming

Suprisingly long list of dataflow programming languages.

The section on SICP on simulation of digital circuits might fall into this category?

@soegaard2 yes, digital circuits are a kind of dataflow language. You can get similar things with FRP, so new-cell/set-cell! in frtime might give you what you want

ftime still works?

last i used it!

(which was two years ago or so admitedly)

but I think its tests are still part of the release process since its in the main distro so it probably does

I vaguely recall having problems with the examples from the paper.

(A long, long time ago)

last time I tried I was able to run the frtime examples but most with memory leaks

ISTR there was some issue with rendering behaviors in drracket at some point…

Yeah FRP is notorious for data leaks…

new-cell, set-cell! sounds useable - but I need to read up on signals.

@soegaard2 Your example reminds me also of one of the languages in @mbutterick’s Beautiful Racket: https://beautifulracket.com/wires/intro.html, maybe some useful ideas there?

@soegaard2 maybe relevant: http://adapton.org/

@andreiformiga thanks for the point

pointer

There is even an adapton for Racket: https://github.com/plum-umd/adapton.racket

I think, adapton, might be it: https://docs.racket-lang.org/adapton/index.html?q=adapton

yeah, I was always meaning to try the racket version of adapton, but didn’t get around to it

What does Ring mean in the package server’s package details page? It has a value of 2 for my package.

https://docs.racket-lang.org/pkg/Future_Plans.html

@sorawee got it, thanks

@ryanc would it be a good idea to change sql-null from the db package into a prefab struct? I think that gives the same “singleton” kinda behavior that you would look for. The struct constructor would need to have a different name for backward compatibility, I suppose.

I’m having an issue that’s tangentially related: checking for SQL-Null from require typed/db causes problems I don’t really understand. What I do understand is that if I require/typed a #:struct form, eg #:struct sql-timestamp and then typecheck based on that, everything works fine. I tried the same trick with sql-null and found that since sql-null is an instantiated version of the struct, I don’t get the same result.

Most common first words of identifiers exported by racket/base, where words are split on hyphens: make 98 syntax 64 current 54 string 44 in 37 read 35 hash 35 bytes 24 regexp 24 char 24