C. Liang. Let-polymorphism and eager type schemes. In TAPSOFT '97: Theory and Practice of Software Development, pages 490-501. Springer Verlag LNCS Vol. 1214, 1997. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
The Metalanguage Prolog and Its Implementation - Nadathur (Correct)
....in the same walk that analyzes the function body. The ideas that we have discussed in this section are quite general in their applicability and they have, amongst other things, been used in encoding computations that arise in theorem proving and manipulation of proofs [2, 6] type checking [13] and the speci cation of programming language semantics [7] Moreover, the features that support these ideas have also been widely exploited relative to the metalanguage Elf [30] and its successor Twelf [32] Thus, the programming bene ts of these features seem to be signi cant, making ....
C. Liang. Let-polymorphism and eager type schemes. In TAPSOFT '97: Theory and Practice of Software Development, pages 490-501. Springer Verlag LNCS Vol. 1214, 1997.
Compiler Construction in Higher Order Logic Programming - Liang (2002) (4 citations) Self-citation (Liang) (Correct)
....where the type variable a is bound by an abstraction, i.e. a:a a where is now a second order constructor. A principal type scheme can now be thought of as an equivalence class of terms. Type inference using such representations of type schemes has also been formulated in HOAS [13, 22], though they require an indirect way of using metalevel uni cation than the mono typing described above. In [22] a type inference algorithm is described that targets ML style let polymorphism. The expression let val f = fn x = x) in (f f) end; is typed by associating f with the type scheme ....
....A principal type scheme can now be thought of as an equivalence class of terms. Type inference using such representations of type schemes has also been formulated in HOAS [13, 22] though they require an indirect way of using metalevel uni cation than the mono typing described above. In [22] a type inference algorithm is described that targets ML style let polymorphism. The expression let val f = fn x = x) in (f f) end; is typed by associating f with the type scheme a:a a. equivalent instances of this type scheme are then associated for each occurrence of f in the body of ....
C. Liang. Let-polymorphism and eager type schemes. In TAPSOFT '97: Theory and Practice of Software Development, pages 490-501. Springer Verlag LNCS Vol. 1214, 1997.
Free Variables and Subexpressions in Higher-Order Meta Logic - Liang Self-citation (Liang) (Correct)
....meta logic to properly represent the object theory, it can be enriched with new features that will allow it to address certain issues directly. Alternatively, we can try to preserve the meta logic and address the same issue by changing the representation of the object theory in the meta logic. In [9] for example, it was shown how meta level bound variables can be used to represent free type variables in an object level typing system. The problem of determining subterms is similar in that meta level substitution (i.e, fi reduction) must not be used to represent subterm replacement at the ....
Chuck Liang. Let-polymorphism and eager type schemes. In TAPSOFT '97: Theory and Practice of Software Development, pages 490--501. Springer Verlag LNCS Vol. 1214, 1997.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC