Show simple item record

dc.contributor.authorOliart, Alberto
dc.date.accessioned2011-09-14T13:24:33Z
dc.date.available2011-09-14T13:24:33Z
dc.date.issued1994-12-14
dc.identifier.citationOliart, Alberto. "An Algorithm for Inferring Quasi-Static Types”, Technical Report BUCS-1994-013, Computer Science Department, Boston University, November 1994. [Available from: http://hdl.handle.net/2144/1483]en_US
dc.identifier.urihttp://hdl.handle.net/2144/1483
dc.description.abstractThis report presents an algorithm, and its implementation, for doing type inference in the context of Quasi-Static Typing (QST) ["Quasy-static Typing." Satish Thatte Proc. ACM Symp. on Principles of Programming Languages, 1988]. The package infers types a la "QST" for the simply typed λ-calculus.en_US
dc.description.sponsorshipCONACyT (54716)en_US
dc.language.isoen_USen_US
dc.publisherBoston University Computer Science Departmenten_US
dc.relation.ispartofseriesBUCS Technical Reports;BUCS-TR-1994-013
dc.titleAn Algorithm for Inferring Quasi-Static Typesen_US
dc.typeTechnical Reporten_US


Files in this item

This item appears in the following Collection(s)

Show simple item record