Teaching People How To Design Programs and How To Code

There is this quite good EdX course developed by Gregor Kiczales, Professor of Computer Science at the University of British Columbia. It's called How to Code: Simple Data and it uses Racket and various modules from the book How to Design Programs by Matthias Felleisen, Robert Bruce Findler, Matthew Flatt and Shriram Krishnamurthi. See this: Review: Introduction to Systematic Program Design – Part 1 and for more on HtDP, see Felleisen, Findler, Flatt, Krishnamurthi (Journal of Functional Programming) The Structure and Interpretation of the Computer Science Curriculum.

The method consists in writing a carefully selected number of concrete test cases as examples of basic constructions and then using them to test the fully abstract representation.

The approach seems, to me, to be almost total functional programming with dependent types. See Checking Dependent Types with Normalization by Evaluation: A Tutorial by David Thrane Christiansen. The early examples use an event-loop/world state model: see Worlds and the Universe "universe.rkt". This sort of thing ought to interest people trying to design secure online interactive web pages. See Automatically Restructuring Programs for the Web by Matthews, Findler, Graunke, Krishnamurthi and Felleisen.

This prompted me to look up Olivier Danvy's TDPE paper and now I understand what it's about. 

See Type-directed partial evaluation.

Comments

  1. SensorAugust 26, 2024 at 4:49 AM

    Unfortunately or unfortunately soon all the problems will be listed and solved by ai. So, the programming language will natural language. I argued about it 6 or 7 years ago on meetups of Cambridge programmers study groupe and folks didn't believe it could happen in their carrier lifetime. So finally came llms, transformers, etc..

    ReplyDelete
  2. Ian GrantAugust 26, 2024 at 5:24 AM

    Well, I look forward to hearing from you when this happens!

    ReplyDelete
    Replies
    1. SensorOctober 20, 2024 at 11:37 AM

      Sure, it would be around 2 years. Already is few entry level positions for software devs on the market.

      Delete
  3. Ian GrantAugust 26, 2024 at 5:33 AM

    Here's one problem with listing all the problems: https://eternaldoorman.blogspot.com/2024/08/jade-richards-paradox-in-one-minute.html

    ReplyDelete

Post a Comment

Popular posts from this blog

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

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