Show simple item record

dc.contributor.authorPlotkin, Gordonen
dc.coverage.spatial41en
dc.date.accessioned2003-11-05T16:17:01Z
dc.date.available2003-11-05T16:17:01Z
dc.date.issued1991
dc.identifier.citationLECTURE NOTES IN COMPUTER SCIENCE 526: 1-17 1991
dc.identifier.urihttp://hdl.handle.net/1842/208
dc.description.abstractCurry’s system for F-deducibility is the basis for static type inference algorithms for programming languages such as ML. If a natural “preservation of types by conversion” rule is added to Curry’s system, it becomes undecidable, but complete relative to a variety of model classes. We show completeness for Curry’s system itself, relative to an extended notion of model that validates reduction but not conversion. Two proofs are given: one uses a term model and the other a model built from type expressions. Extensions to systems with polymorphic or intersection types are also considered.en
dc.format.extent268821 bytesen
dc.format.mimetypeapplication/pdfen
dc.language.isoen
dc.publisherSPRINGER VERLAGen
dc.subjectLaboratory for Foundations of Computer Scienceen
dc.titleA Semantics for Static Type Inferenceen
dc.title.alternativeA-SEMANTICS FOR TYPE CHECKINGen
dc.typePreprinten


Files in this item

This item appears in the following Collection(s)

Show simple item record