An OCaml use case for strong call-by-need reduction
Un usage de la réduction paresseuse forte pour OCaml
Abstract
We present a use-case for strong call-by-need reduction motivated not by a proof assistant, but by the normalization of module "shapes" in the OCaml compiler for tooling purposes.
Domains
Computer Science [cs]
Origin : Files produced by the author(s)