Formalizing the Halting Problem in a Constructive Type Theory

Kristofer Johannisson. Formalizing the Halting Problem in a Constructive Type Theory. In Paul Callaghan, Zhaohui Luo, James McKinna, Robert Pollack, editors, Types for Proofs and Programs, International Workshop, TYPES 2000, Durham, UK, December 8-12, 2000, Selected Papers. Volume 2277 of Lecture Notes in Computer Science, pages 145-159, Springer, 2000. [doi]

@inproceedings{Johannisson00,
  title = {Formalizing the Halting Problem in a Constructive Type Theory},
  author = {Kristofer Johannisson},
  year = {2000},
  url = {http://link.springer.de/link/service/series/0558/bibs/2277/22770145.htm},
  tags = {type theory},
  researchr = {https://researchr.org/publication/Johannisson00},
  cites = {0},
  citedby = {0},
  pages = {145-159},
  booktitle = {Types for Proofs and Programs, International Workshop, TYPES 2000, Durham, UK, December 8-12, 2000, Selected Papers},
  editor = {Paul Callaghan and Zhaohui Luo and James McKinna and Robert Pollack},
  volume = {2277},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-43287-6},
}