Henglein F., \Type inference and semi-unication", Proc. ACM Symp. on Lisp and Functional Programming, 1988. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Incremental Polymorphic Type Checking With Update - Mycroft (1992) (1 citation) (Correct)
....Damas and Milner [2] express the type inference problem in terms of logical inference rules. Mycroft and O Keefe [9] show how Prolog admits a similar type system. Mycroft [8] exhibits a more general type inference rule for recursion than Milner and shows it to be sound. Independently, Henglein [3] and Kfoury, Tiuryn and Urzyczyn [4] show that type inference with Mycroft s rule for recursion is equivalent to the semi uni cation problem which was later shown undecidable by Kfoury, Tiuryn and Urzyczyn [6] However, note that the type checking problem for Mycroft s rule is decidable and was ....
Henglein F., \Type inference and semi-unication", Proc. ACM Symp. on Lisp and Functional Programming, 1988.
Explicit Graphs in a Functional Model for Spatial Databases - Erwig, Güting (1994) (12 citations) (Correct)
.... order: Since in two level signatures types are given by expressions containing bounded variables type checking can in principle be done by order sorted unification [51] a simplified setting is described in [50] Viewing variable quantification and subtype definitions as constraints predicates, [40] presents a very general framework for type checking in two level signatures. In our application we only have to check expressions of a query language, which means that signatures on both levels are fixed. Therefore we get al..ong with a small subset of inference rules (in fact, we only need ....
S. Kaes: Type Inference in the Presence of Overloading, Subtyping and Recursive Types, ACM Conf. on Lisp and Functional Programming, 1992, pp. 193-204.
Explicit Graphs in a Functional Model for Spatial Databases - Erwig, Güting (1994) (12 citations) (Correct)
....general tool to define languages with heavily overloaded operation symbols. So a few remarks on type checking are in order: Since in two level signatures types are given by expressions containing bounded variables type checking can in principle be done by order sorted unification [38] see also [37, 29]) In our application we only have to check expressions of a query language, which means that signatures on both levels are fixed. Therefore we get al..ong with a small subset of inference rules (in fact, we only need abstraction and application rules) Morevover, since we will require function ....
S. Kaes: Type Inference in the Presence of Overloading, Subtyping and Recursive Types, ACM Conf. on Lisp and Functional Programming, 1992, pp. 193-204.
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