Rhombus is a new language that provides Racket-style extensibility with conventional (infix) notation. This talk is is not about that notation; it’s about many other design choices in Rhombus that that are different than Scheme and Racket. We’ll look at Rhombus’s pervasive pattern matching, generalized repetitions, Lisp-N binding, lists as RRB trees, and mixture of static and dynamic hierarchical binding.

Matthew Flatt is a professor in the School of Computing at the University of Utah, where he works on extensible programming languages, runtime systems, and applications of functional programming. He is one of the developers of the Racket programming language. He received his PhD from Rice University in 1999.