Open access
Oct 2026
Programming with Composable Recursive Patterns and Transformations
Data processing using traditional pattern matching syntax and direct recursive functions is straightforward to write but becomes awkward in ambiguous (i.e., nondeterministic) cases: when programmers wish to avoid backtracking, they often end up having to write complicated code that sacrifices clarity and modularity. Ho...
Lu-Yu Cheng, Florent Ferrari, Michael D. Adams et al.
· Proceedings of the ACM on Pr... · 0 citations