Proving Strong Normalization of CC by Modifying Realizability Semantics

Thorsten Altenkirch. Proving Strong Normalization of CC by Modifying Realizability Semantics. In Henk Barendregt, Tobias Nipkow, editors, Types for Proofs and Programs, International Workshop TYPES 93, Nijmegen, The Netherlands, May 24-28, 1993, Selected Papers. Volume 806 of Lecture Notes in Computer Science, pages 3-18, Springer, 1993.

@inproceedings{Altenkirch93,
  title = {Proving Strong Normalization of CC by Modifying Realizability Semantics},
  author = {Thorsten Altenkirch},
  year = {1993},
  tags = {semantics},
  researchr = {https://researchr.org/publication/Altenkirch93},
  cites = {0},
  citedby = {0},
  pages = {3-18},
  booktitle = {Types for Proofs and Programs, International Workshop TYPES 93, Nijmegen, The Netherlands, May 24-28, 1993, Selected Papers},
  editor = {Henk Barendregt and Tobias Nipkow},
  volume = {806},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-58085-9},
}