Polymorphic Recursion and Subtype Qualifications: Polymorphic Binding-Time Analysis in Polynomial Time. Dussart, D.; Henglein, F.; and Mossin, C. In SAS, volume 983, of Lecture Notes in Computer Science, pages 118-135, 1995. Springer.
Polymorphic Recursion and Subtype Qualifications: Polymorphic Binding-Time Analysis in Polynomial Time [link]Link  Polymorphic Recursion and Subtype Qualifications: Polymorphic Binding-Time Analysis in Polynomial Time [link]Paper  bibtex   
@inproceedings{conf/sas/DussartHM95,
  added-at = {2017-05-20T00:00:00.000+0200},
  author = {Dussart, Dirk and Henglein, Fritz and Mossin, Christian},
  biburl = {https://www.bibsonomy.org/bibtex/2e02af0b3e74d950923a39615bcb6a33d/dblp},
  booktitle = {SAS},
  crossref = {conf/sas/95},
  editor = {Mycroft, Alan},
  ee = {https://doi.org/10.1007/3-540-60360-3_36},
  interhash = {17889827015725267605228f170de11c},
  intrahash = {e02af0b3e74d950923a39615bcb6a33d},
  isbn = {3-540-60360-3},
  keywords = {dblp},
  pages = {118-135},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  timestamp = {2019-05-15T13:44:57.000+0200},
  title = {Polymorphic Recursion and Subtype Qualifications: Polymorphic Binding-Time Analysis in Polynomial Time},
  url = {http://dblp.uni-trier.de/db/conf/sas/sas95.html#DussartHM95},
  volume = 983,
  year = 1995
}
Downloads: 0