dimitriv-inference.bib

@INPROCEEDINGS{spj+:gadt,
  AUTHOR = {Simon {Peyton~Jones} and Dimitrios Vytiniotis and Stephanie Weirich and Geoffrey Washburn},
  TITLE = {Simple unification-based type inference for {GADTs}},
  BOOKTITLE = {ICFP '06: Proceedings of the Eleventh ACM SIGPLAN 
                     International Conference on Functional Programming},
  YEAR = {2006},
  ISBN = {1-59593-309-3},
  PAGES = {50--61},
  LOCATION = {Portland, Oregon, USA},
  DOI = {http://doi.acm.org/10.1145/1159803.1159811},
  PUBLISHER = {ACM Press},
  ADDRESS = {New York, NY, USA},
  CATTYPE = {paper},
  PDF = {http://www.cis.upenn.edu/~dimitriv/wobbly/gadt.pdf}
}

@INPROCEEDINGS{vytiniotis+:boxy,
  AUTHOR = {Dimitrios Vytiniotis and Stephanie Weirich and Simon {Peyton~Jones}},
  TITLE = {Boxy types: inference for higher-rank types and impredicativity},
  BOOKTITLE = {ICFP '06: Proceedings of the Eleventh ACM SIGPLAN 
                     International Conference on Functional Programming},
  YEAR = {2006},
  ISBN = {1-59593-309-3},
  PAGES = {251--262},
  LOCATION = {Portland, Oregon, USA},
  DOI = {http://doi.acm.org/10.1145/1160074.1159838},
  PUBLISHER = {ACM Press},
  ADDRESS = {New York, NY, USA},
  CATTYPE = {paper},
  PDF = {http://www.cis.upenn.edu/~dimitriv/boxy/boxy.pdf}
}

@ARTICLE{pj-shields:arbitrary-rank,
  AUTHOR = {Simon {Peyton~Jones} and Dimitrios Vytiniotis and Stephanie Weirich and Mark Shields},
  TITLE = {Practical type inference for arbitrary-rank types},
  JOURNAL = {J. Funct. Program.},
  VOLUME = {17},
  NUMBER = {1},
  YEAR = {2007},
  ISSN = {0956-7968},
  PAGES = {1--82},
  DOI = {http://dx.doi.org/10.1017/S0956796806006034},
  PUBLISHER = {Cambridge University Press},
  ADDRESS = {New York, NY, USA},
  CATTYPE = {paper},
  URL = {http://research.microsoft.com/~simonpj/papers/higher-rank/}
}

@TECHREPORT{pjdvswms:technical-appendix,
  TOPIC = {language design},
  AUTHOR = {Dimitrios Vytiniotis and Stephanie Weirich and Simon {Peyton~Jones}},
  TITLE = {Practical type inference for arbitrary-rank types, {Technical Appendix} },
  INSTITUTION = {University of Pennsylvania},
  YEAR = 2005,
  NUMBER = {MS-CIS-05-14},
  MONTH = {July},
  PDF = {http://www.cis.upenn.edu/~dimitriv/arbitrary-rank/MS-CIS-05-14.pdf},
  CATEGORY = {fcp},
  CATTYPE = {report}
}

@TECHREPORT{vytiniotis+:boxy-techreport,
  TOPIC = {language design},
  AUTHOR = {Dimitrios Vytiniotis and Stephanie Weirich and Simon {Peyton~Jones}},
  TITLE = {Boxy type inference for higher-rank types and impredicativity, {Technical Appendix}},
  INSTITUTION = {University of Pennsylvania},
  YEAR = 2006,
  NUMBER = {MS-CIS-05-23},
  MONTH = {April},
  PDF = {http://www.cis.upenn.edu/~dimitriv/boxy/boxy-techreport.pdf},
  CATEGORY = {fcp},
  CATTYPE = {report},
  HISTORICAL = {This report accompanies the boxy types paper and provides proofs for the claims in that paper.}
}

@TECHREPORT{vytiniotis+:gadt-techreport,
  TOPIC = {language design},
  AUTHOR = {Dimitrios Vytiniotis and Stephanie Weirich and Simon {Peyton~Jones}},
  TITLE = {Simple unification-based type inference for {GADTs}, {Technical Appendix}},
  INSTITUTION = {University of Pennsylvania},
  YEAR = 2006,
  NUMBER = {MS-CIS-05-22},
  MONTH = {April},
  PDF = {http://www.cis.upenn.edu/~dimitriv/wobbly/wobbly-techreport.pdf},
  CATEGORY = {gadt},
  CATTYPE = {report},
  HISTORICAL = { This is a new version of the GADT paper technical report. Includes treatment
                of fresh most general unifiers and scoped type variables, but handles only non-nested 
                patterns for simplicity; all the problems encountered in the treatment of nested patterns
                already occur in the treatment of non-nested patterns. The old version of the report
                available from \url{http://www.cis.upenn.edu/~dimitriv/wobbly/wobbly-techreport-old.pdf} treats 
                also nested patterns but assumes that the inference algorithm and the specification use 
                exactly the same most general unifier procedure for GADT type refinement. }
}