







At Scottish Ruby Conference 2013 and GoGaRuCo 2013 I gave a talk called Impossible Programs, adapted from chapter 8 of Understanding Computation. It’s a talk about programs that are impossible to write in Ruby — it covers computational universality, undecidability, the halting problem and Rice’s theorem, explained in plain English and illustrated with Ruby code. The slides are available, and here’s the video:
Building on Bluesky's AT Protocol with Ruby
Overview of the architecture of the AT Protocol network, some examples of the projects I've built on it with Ruby, and a showcase of some other people's…

Ruby Programming Language - GeeksforGeeks
Your All-in-One Learning Portal: GeeksforGeeks is a comprehensive educational platform that empowers learners across domains-spanning computer science and programming, school education, upskilling, commerce, software tools, competitive exams, and more.

Why Writing Correct Software Is Hard
We try to understand the relationship between programs and correctness, and in particular, why writing correct programs must be hard. We will review results from computability theory and complexity theory, and see that programs and complete understanding – which is required for correctness – are fundamentally at odds.
The Rust Programming Language - The Rust Programming Language
by Steve Klabnik, Carol Nichols, and Chris Krycho, with contributions from the Rust Community
Practical Foundations for Programming Languages
Programming Language Foundations in Agda – Table of Contents
This book is an introduction to programming language theory using the proof assistant Agda.

The Ruby Story
Ruby has always been one of my favorite languages, though I’ve sometimes found it hard to express why that is. The best I’ve been able to do is this musical analogy: Whereas Python feels to me like punk rock—it’s simple, predictable, but rigid—Ruby feels like jazz. Ruby gives programmers a radical freedom to express themselves, though that comes at the cost of added complexity and can lead to programmers writing programs that don’t make immediate sense to other people.

Nobody Cracks Open a Programming Book Anymore · unix.foo
A sad look at the state of modern programming books.
Domain Theory: the forgotten step in program verification - Bertrand Meyer's technology+ blog
Program verification is making considerable progress but is hampered by a lack of abstraction in specifications. A crucial step is, almost always, absent from the process; this omission is the principal obstacle to making verification a standard component of everyday software development. 1. Steps in software verification In the first few minutes of any ... Read more

eurucamp 2015 - Programming as a Performance by Joseph Wilk
Theory Beyond Theorems and Proofs: A Guest Post
Scott’s foreword: I’m extremely grateful to my brilliant colleagues, Pravesh Kothari, Raghu Meka, and Prasad Raghavendra, for sharing the guest post below about how theoretical computer…
On Making Impossible States Impossible
A listing of impossible state symptoms and how to circumvent them.

Turing tarpit
54. Beware of the Turing tar-pit in which everything is possible but nothing of interest is easy.
Rust for Java developers
Introduction to the Rust programming language for java developers, (complete with code sampes) with a focus on shared concepts.

RubyConf 2017: Keynote - You're Insufficiently Persuasive by Sandi Metz