Operational Semantics and Polymorphic Type Inference
dc.contributor.author
Tofte, Mads
en
dc.date.accessioned
2013-04-02T15:15:37Z
dc.date.available
2013-04-02T15:15:37Z
dc.date.issued
1988
dc.description.abstract
Three languages with polymorphic type disciplines are discussed, namely the
λ-calculus with Milner's polymorphic type discipline; a language with imperative
features (polymorphic references); and a skeletal module language with structures,
signatures and functors. In each of the two first cases we show that the
type inference system is consistent with an operational dynamic semantics.
On the module level, polymorphic types correspond to signatures. There is
a notion of principal signature. So-called signature checking is the module level
equivalent of type checking. In particular, there exists an algorithm which either
fails or produces a principal signature.
en
dc.identifier.uri
http://hdl.handle.net/1842/6606
dc.language.iso
en
dc.publisher
The University of Edinburgh
en
dc.relation.hasversion
R. Harper, R. Milner and M. Tofte, A type discipline for program modules, Proc. TAPSOFT '87, Springer, Lecture Notes in Computer Science 250, Berlin - Heidelberg - New York, 1987, 308-319.
en
dc.relation.hasversion
R. Harper, R. Milner and M. Tofte, The semantics of Standard ML, Version 1, Laboratory for Foundations of Computer Science, Department of Computer Science, University of Edinburgh, ECS-LFCS-87-36, 1987
en
dc.subject
λ-calculus
en
dc.subject
skeletal module language
en
dc.subject
polymorphic types
en
dc.title
Operational Semantics and Polymorphic Type Inference
en
dc.type
Thesis or Dissertation
en
dc.type.qualificationlevel
Doctoral
en
dc.type.qualificationname
PhD Doctor of Philosophy
en
Files
Original bundle
1 - 1 of 1
- Name:
- Tofte1988.pdf
- Size:
- 1.98 MB
- Format:
- Adobe Portable Document Format
- Description:
This item appears in the following Collection(s)

