Gerald Sussman on Rewriting Systems

I wrote something similar to what he describes at 17:45 in Standard ML using parsers defined to work on quasi-quotations specifying the rewrite rules. See this example, which is a kind of simplifier for C language type declarations. Terms like specifier-qualifier-list and declaration-specifiers are terms that come from the C language grammar originally written by Brian Kernighan and Dennis Ritchie. 

The guts of the rewrite engine are here: https://github.com/IanANGrant/red-october/blob/master/src/dynlibs/ffi/GrammarSyntax.sml but there is a lot of other code to allow the quasi-quotations to be written in a user-friendly syntax. There are a lot of better ways to do this, witnessed by the debugging infrastructure I had to build in just to get the f*cking thing to work!

These kinds of rewriting systems are capable of evaluating expressions, so this language is a programmable evaluator for interpreted languages.

19:32 But I never thought of it as a biological process! See Stuart Kauffman on Irreducible Systems. I did however see it as a musical process, where things like key changes and chord resolutions were programmed to evolve as a phrase develops and other instruments and voices enter the composition.

35:33 Such term rewriters were called expert systems back in the late eighties, ... It's funny how much more interest the students have after he says they're worth a few megabucks each.

The next level is using a rewriter like this to rewrite the rewrite rules themselves, using something like Knuth Bendix completion to produce convergent rewriting systems. See Gerald Sussman on Using Languages To Construct Continuous Solutions.

Subscribe to MIT Open Courseware.

Comments

Post a Comment

Popular posts from this blog

David Turner Obituary by Sarah Nicholas Fri 24 Nov 2023

Image
This was in The Guardian: David Turner obituary , only eight days after I posted  David Turner Talking About Sixty Years of Functional Programming History : This talk was given in London in 2017: See  Turner, D. A. "Some History of Functional Programming Languages" also  John Hughes - Why Functional Programming Matters  and David MacQueen's talk at ICFP 2015 in  Numberphile - Sophie Maclean on the Catalan Numbers . At 10:30 This whole discussion abut combinator reduction is especially interesting. I didn't know Arthur Norman had tried building hardware for combinator machines. I'll look that up: maybe start here A.C. Norman  Faster combinator reduction using stock hardware  in LFP '88: Proceedings of the 1988 ACM conference on LISP and functional programming. At 26:25 on the ISWIM virtual machine implemented in the PAL compacting garbage collector?! This work Reynolds and others did was at MIT in Masecheusetts and Argonne National Laboratory Illinois. Did
Read more

Live Science - Leonardo da Vinci's Ancestry

Image
... and his posterity too? See  On Communication in Linear Time And Hypertext And The Gospel of Sophia . So it looks like El Cielo of the cistine [sic!😂] chapel is not the limit anymore.  I think I just met one of his descendents. A guy called Versailles Toledo who is from Chiapas. That might explain the murals I mention in my recent untitled post , just before the post mentioning this video. I also just took this photo of Rafael Gonzales, born here in Tecate, B.C., who told me about a spring near here called Agua Fría , half way from Tecate to Loma Tova , where, a few decades ago, people used to go to have barbecues and stuff, but now he thinks it may be private land. If someone reading this has a Facebook account, please write a link to this post onto his FB page. To see why I took the photo, look at his T-shirt and the horse-shoes and ponder this: Subscribe to BeatrizER and her video(s?) about mathematical logic, ... Sounds like Edith (II) Rix has been online all the time, ...
Read more