This is probably a long shot, but does anyone have any recommendations for implementing a basic static type-system via modifying a Scheme interpreter? I’ve looked at the “Type Systems as Macros” paper, and noticed there’s a section in “Essentials of Programming Languages” which I’ve yet to get to, but I was just curious if anyone had any specific recommendations. Perhaps it’s too-advanced a topic for my current level of knowledge as the TSaM paper went over my head a fair bit, but it is something I’d like to try and start learning if at all possible. Thanks :slightly_smiling_face:

“Essentials of Programming Languages” has had (IIRC) three editions. There are parts largely the same, but there are portions of the book that are different in each edition. So if you’re checking a reference check you’re looking at the correct edition.

The 2nd edition chapter on typed languages looks pretty straight forward.

One way of implementing a type checker is to convert an interpreter from computing values to computing types