Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
This conference talk explores the type-checking of heterogeneous sequences through rational type expressions, a generalization of regular expressions designed for declaring regular patterns in heterogeneous sequences. Discover how symbolic finite automata can be constructed and manipulated using a portable, simple, embeddable type system. Learn about the challenges of working with type systems that have subtyping, where subtype relations and type vacuity aren't always computationally decidable, and examine a sound solution for constructing finite automata for type-based regular expressions. The presentation demonstrates the system's portability through implementations in Common Lisp, Clojure, Scala, and Python. Presented by Jim Newton from EPITA/LRE at the 27th International Symposium on Practical Aspects of Declarative Languages (PADL'25), this 30-minute talk is part of the ACM SIGPLAN-sponsored conference held in January 2025.
