Implementing a Normalizer Using Sized Heterogeneous Types

@article{Abel2006ImplementingAN,
  title={Implementing a Normalizer Using Sized Heterogeneous Types},
  author={Andreas Abel},
  journal={J. Funct. Program.},
  year={2006},
  volume={19},
  pages={287-310}
}
In the simply-typed lambda-calculus, a hereditary substitution replaces a free variable in a normal form r by another normal form s of type a, removing freshly created redexes on the fly. It can be defined by lexicographic induction on a and r, thus, giving rise to a structurally recursive normalizer for the simply-typed lambda-calculus. We generalize this scheme to simultaneous substitutions, preserving its simple termination argument. We further implement hereditary simultaneous substitutions… CONTINUE READING

Similar Papers

Loading similar papers…