From 7d7973c8c02f5fcebbfc7bf2fcc97d6c6163b6cb Mon Sep 17 00:00:00 2001 From: Ben Greenman Date: Tue, 3 Sep 2024 13:31:24 -0400 Subject: [PATCH] Hejduk title: rouble -> Trouble (#327) --- rcon/2024/index.rkt | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/rcon/2024/index.rkt b/rcon/2024/index.rkt index 657e61d8..8b091442 100644 --- a/rcon/2024/index.rkt +++ b/rcon/2024/index.rkt @@ -477,7 +477,7 @@ extensibility. #:who @speaker[#:url "https://github.com/ndh4"]{Nathaniel Hejduk} #:what -@talk{rouble with Typed Racket? Try a Boundary Profiler!} +@talk{Trouble with Typed Racket? Try a Boundary Profiler!} #:more @abstract{ When you add types to a portion of your partially-untyped code base in Typed Racket (TR), the type soundness guarantees you gain will make you feel warm and fuzzy. Sometimes, however, doing so will cause your running time to skyrocket, turning your cute, fluffy type annotations into an unexpected tribulation. When such troubles occur, a boundary profiler can help you ease the runtime wrath of contract checking. In this talk, I’ll demonstrate how to use a boundary profiler to boldly reduce the overhead of type-checking in your program, without violating the following prime directive: once a component has been typed, it must stay typed forever.