Polymorphic Recursion and Subtype Qualifications: Polymorphic Binding-Time Analysis in Polynomial Time. Dussart, D., Henglein, F., & Mossin, C. In SAS, volume 983, of Lecture Notes in Computer Science, pages 118-135, 1995. Springer. 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
{"_id":{"_str":"52390693b1392ed1430002e4"},"__v":0,"authorIDs":[],"author_short":["Dussart, D.","Henglein, F.","Mossin, C."],"bibbaseid":"dussart-henglein-mossin-polymorphicrecursionandsubtypequalificationspolymorphicbindingtimeanalysisinpolynomialtime-1995","bibdata":{"bibtype":"inproceedings","type":"inproceedings","added-at":"2017-05-20T00:00:00.000+0200","author":[{"propositions":[],"lastnames":["Dussart"],"firstnames":["Dirk"],"suffixes":[]},{"propositions":[],"lastnames":["Henglein"],"firstnames":["Fritz"],"suffixes":[]},{"propositions":[],"lastnames":["Mossin"],"firstnames":["Christian"],"suffixes":[]}],"biburl":"https://www.bibsonomy.org/bibtex/2e02af0b3e74d950923a39615bcb6a33d/dblp","booktitle":"SAS","crossref":"conf/sas/95","editor":[{"propositions":[],"lastnames":["Mycroft"],"firstnames":["Alan"],"suffixes":[]}],"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","bibtex":"@inproceedings{conf/sas/DussartHM95,\n added-at = {2017-05-20T00:00:00.000+0200},\n author = {Dussart, Dirk and Henglein, Fritz and Mossin, Christian},\n biburl = {https://www.bibsonomy.org/bibtex/2e02af0b3e74d950923a39615bcb6a33d/dblp},\n booktitle = {SAS},\n crossref = {conf/sas/95},\n editor = {Mycroft, Alan},\n ee = {https://doi.org/10.1007/3-540-60360-3_36},\n interhash = {17889827015725267605228f170de11c},\n intrahash = {e02af0b3e74d950923a39615bcb6a33d},\n isbn = {3-540-60360-3},\n keywords = {dblp},\n pages = {118-135},\n publisher = {Springer},\n series = {Lecture Notes in Computer Science},\n timestamp = {2019-05-15T13:44:57.000+0200},\n title = {Polymorphic Recursion and Subtype Qualifications: Polymorphic Binding-Time Analysis in Polynomial Time},\n url = {http://dblp.uni-trier.de/db/conf/sas/sas95.html#DussartHM95},\n volume = 983,\n year = 1995\n}\n\n","author_short":["Dussart, D.","Henglein, F.","Mossin, C."],"editor_short":["Mycroft, A."],"key":"conf/sas/DussartHM95","id":"conf/sas/DussartHM95","bibbaseid":"dussart-henglein-mossin-polymorphicrecursionandsubtypequalificationspolymorphicbindingtimeanalysisinpolynomialtime-1995","role":"author","urls":{"Link":"https://doi.org/10.1007/3-540-60360-3_36","Paper":"http://dblp.uni-trier.de/db/conf/sas/sas95.html#DussartHM95"},"keyword":["dblp"],"downloads":0},"bibtype":"inproceedings","biburl":"http://www.bibsonomy.org/bib/author/fritz?items=1000","downloads":0,"search_terms":["polymorphic","recursion","subtype","qualifications","polymorphic","binding","time","analysis","polynomial","time","dussart","henglein","mossin"],"title":"Polymorphic Recursion and Subtype Qualifications: Polymorphic Binding-Time Analysis in Polynomial Time","year":1995,"keywords":["dblp"],"dataSources":["P8qTtTCTHaCFodAoX"]}