de Vrijer's Strong Normalization in Haskell

12 pages•Published: October 23, 2026

Abstract

Roel de Vrijer's assignment maps a simply typed λ-term to a measure whose numerical component drops after every β-contraction. We present that assignment as a compact Haskell program, which uses host-language functions for the functional component of the measure. We prove that the returned integer is in fact a decreasing bound on all subsequent reduction sequences.

Keyphrases: de vrijer s measure, simply typed lambda calculus, strong normalization

In: Erika Ábrahám, Nikolaj Bjørner and Michael Rawson (editors). Proceedings of the 26th Conference on Logic for Programming, Artificial Intelligence, and Reasoning, vol 112, pages 418-429.

Links:	https://easychair.org/publications/paper/lPRn
	https://doi.org/10.29007/1flx

BibTeX entry

@inproceedings{LPAR-26:de_Vrijers_Strong_Normalization,
  author    = {Nachum Dershowitz},
  title     = {de Vrijer's Strong Normalization in Haskell},
  booktitle = {Proceedings of the 26th Conference on Logic for Programming, Artificial Intelligence, and Reasoning},
  editor    = {Erika Ábrahám and Nikolaj Bjørner and Michael Rawson},
  series    = {EPiC Series in Computing},
  volume    = {112},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/lPRn},
  doi       = {10.29007/1flx},
  pages     = {418-429},
  year      = {2026}}

Download PDF Open PDF in browser