Browsing Computer Science by Author "Kfoury, A. J."

OpenBU

Browsing Computer Science by Author "Kfoury, A. J."

Sort by: Order: Results:

  • Kfoury, A. J.; Wells, J. B. (Boston University Department of Computer Science, 1993-12-01)
    We study the problem of type inference for a family of polymorphic type disciplines containing the power of Core-ML. This family comprises all levels of the stratification of the second-order lambda-calculus by "rank" of ...
  • Hallet, J. J.; Kfoury, A. J. (Boston University Computer Science Department, 2005-08-08)
    A weak reference is a reference to an object that is not followed by the pointer tracer when garbage collection is called. That is, a weak reference cannot prevent the object it references from being garbage collected. ...
  • Jahama, Said; Kfoury, A. J. (Boston University Computer Science Department, 1993-12-20)
    Various restrictions on the terms allowed for substitution give rise to different cases of semi-unification. Semi-unification on finite and regular terms has already been considered in the literature. We introduce a general ...
  • Bakewell, Adam; Carlier, Sébastien; Kfoury, A. J.; Wells, J. B. (Boston University Computer Science Department, 2005-12-30)
    We present a procedure to infer a typing for an arbitrary λ-term M in an intersection-type system that translates into exactly the call-by-name (resp., call-by-value) evaluation of M. Our framework is the recently developed ...
  • Jahama, Said; Kfoury, A. J. (Boston University Computer Science Department, 1993-12-20)
    We establish the equivalence of type reconstruction with polymorphic recursion and recursive types is equivalent to regular semi-unification which proves the undecidability of the corresponding type reconstruction problem. ...

Search OpenBU


Advanced Search

Browse

Deposit Materials