Typability and Type Checking in System F are Equivalent and Undecidable - researchr publication bibtex

researchr

You are not signed in
Sign in
Sign up

J. B. Wells. Typability and Type Checking in System F are Equivalent and Undecidable. Annals of Pure and Applied Logic, 98(1-3):111-156, 1999.

@article{Wells99:0,
  title = {Typability and Type Checking in System F are Equivalent and Undecidable},
  author = {J. B. Wells},
  year = {1999},
  tags = {type system, type checking},
  researchr = {https://researchr.org/publication/Wells99%3A0},
  cites = {0},
  citedby = {0},
  journal = {Annals of Pure and Applied Logic},
  volume = {98},
  number = {1-3},
  pages = {111-156},
}

runs on WebDSL