Sixteenth RacketCon in Oakland, CA

See https://con.racket-lang.org/.

Subscribe to Racket.

It's fun. They have a corresponding amount (16 years or so) of cruft they need to deal with though:

See Matthew Flatt's Sunday morning talk A New Foreign-Function Interface: ffi2.

Subscribe to The Functional Cruft of Programming. I mean craft!

I am interested in the general problem, of how you build runtime systems and interfaces to existing code. I thought of using Standard ML modules to specify the interfaces in terms of something like GNU lightning, and then meta-programming the runtimes in the high-level language. I guess I could do this by writing a Standard ML #lang for racket, ... The GNU people weren't interested (see Graham Hutton, Zac Garby and Patrick Bahr - Calculating (Correct) Compilers (Effectively) and Matthew Flatt on Rhombus and Syntax Transformers). See also Matthias Felleisen's 2019 talk on Racket where he talks about throwing away code.


Subscribe to Lambda World.

Then see Brian Kernighan on How To Succeed in Language Design Without Really Trying and The Story of Unix - Chapter Ω: The Captains All Jumped Ship. 

Comments

Post a Comment

Popular posts from this blog

How Could One Unify CMU and MIT

Image
I mean, how to get the best of the two different philosophies of computation. One is based on typed programming languages and the other on engineering with diagrams . This is about practical computing and the cost and feasibility of software development in general. Here is the problem: We have a lot of algorithms which can all be described abstractly using some sort of pseudocode, or perhaps using some particular language (usually Python!). These algorithms are often well-studied and a lot is known about them in terms of their computational complexity in time and space. Substantive practical software systems invariably employ many such algorithms, often implemented in libraries with more or less well-specified APIs. But very few of these libraries are capable of interoperating because they are either packages written in some specific programming language like Java or Haskell, say, or they are written in C and used as object code, or they are written in an interpreted language like Sc...
Read more

Tensor Fields and Simplicial Complexes

Image
Listening to Freya Holmér last night I started to get glimmers of an idea I had long ago about how to represent vector spaces in computational processes using this recursive abstract type :  abstype 'a point = POINT   of {getx :  'a vector,       diff :  'a point -> 'a point,       move :  'a point -> 'a point,       scale : 'a -> 'a point,       proj :  'a point -> 'a} with    fun new i (op +) (op -) (op * ) dot =    let fun self x =  POINT       {getx = x,        move = fn (POINT pr) =>           (self (x + (#getx pr))),        diff = fn (POINT pr) =>          self (x - (#getx pr)),        scale = fn i =>          (self (x * i)),        proj = fn (POINT pr) =>     ...
Read more

HTML in Blog Posts

Just testing stuff: SVG You can click on the blue circle: MathML There is not much you can do with this. See Mathematical Markup Language 1.01 Specification   7.1.5 Mixing and Linking MathML and HTML . It's the big problem  of how you compose languages.   a x 2 + b x + c = 0 You can click on the discriminant: x = − b ± b 2 − 4 ⁢ a ⁢ c 2 ⁢ a 2D Canvas Sound  Beep! WebGPU Next level Parser expression grammar compiler:  https://peggyjs.org/online.html Devine Lu Linvega's unxtal assembler/debugger:  https://wiki.xxi...
Read more