Longest r-chain: thinning by grouping
Abstract
r ⊆ s⇒ length (longest-chain r xs) ⩽ length (longest-chain s xs).If we set the distance to, say, 13, then the poem is almost completely uncovered.> longest-chain (close 13) .unlines .take 2 .lines .
Related papers
- The Drinking Philosopher's Problem TOPLAS 1984
- Dynamic AspectJ DLS 2008
- Longest segment of balanced parentheses: an exercise in program inversion in a segment problem JFP 2021
- Thin Guards: A Simple and Effective Technique for Reducing the Penalty of Dynamic Class Loading ECOOP 2002
- Falcon: A Fused Approach to Path-Sensitive Sparse Data Dependence Analysis PLDI 2024
- Truly Functional Solutions to the Longest Uptrend Problem (Functional Pearl) ICFP 2025
- Thin slicing PLDI 2007
- Thin Locks: Featherweight Synchronization for Java PLDI 1998