OpenBU

An Algorithm for Inferring Quasi-Static Types

OpenBU

Show simple item record

dc.contributor.author Oliart, Alberto
dc.date.accessioned 2011-09-14T13:24:33Z
dc.date.available 2011-09-14T13:24:33Z
dc.date.issued 1994-12-14
dc.identifier.uri http://hdl.handle.net/2144/1483
dc.description.abstract This 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.sponsorship CONACyT (54716) en_US
dc.language.iso en_US en_US
dc.publisher Boston University Computer Science Department en_US
dc.relation.ispartofseries BUCS Technical Reports;BUCS-TR-1994-013
dc.title An Algorithm for Inferring Quasi-Static Types en_US
dc.type Technical Report en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search OpenBU


Browse

Deposit Materials

Statistics