2 citations · 2 across the 2 of their papers we have counts for
Showing cs.PLShow all
2 papers · 1 filter
cs.PL2019
Proving tree algorithms for succinct data structures
Reynald Affeldt, Jacques Garrigue, Xuanrui Qi +1
Succinct data structures give space-efficient representations of large amounts of data without sacrificing performance. They rely one cleverly designed data representations and alg…
cs.PL2017★ 2 cited
GADTs and Exhaustiveness: Looking for the Impossible
Jacques Garrigue, Jacques Le Normand
Sound exhaustiveness checking of pattern-matching is an essential feature of functional programming languages, and OCaml supports it for GADTs. However this check is incomplete, in…