Implementing RUSSELL

@inproceedings{Boehm1986ImplementingR,
  title={Implementing RUSSELL},
  author={H. Boehm and A. Demers},
  booktitle={SIGPLAN '86},
  year={1986}
}
  • H. Boehm, A. Demers
  • Published in SIGPLAN '86 1986
  • Computer Science
  • We have completed an implementation of the Russell programming language [Don 85]. This effort has been very helpful in the evaluation of the original language design. It has also served to pinpoint the difficulties in implementing languages with type systems as general as that of Russell. Russell treats both functions and types as data objects which can be freely manipulated by the program. Most operators present in conventional programming languages are viewed as function calls. In spite of… CONTINUE READING
    21 Citations

    Topics from this paper.

    Type inference in the presence of type abstraction
    • 17
    • PDF
    Unify and conquer
    • H. Baker
    • Computer Science
    • LISP and Functional Programming
    • 1990
    • 44
    An implementation of standard ML modules
    • 17
    Smartest recompilation
    • 84
    Type inference with subtypes
    • 114
    The essence of compiling with continuations
    • 532
    • PDF
    Partial Polymorphic Type Inference Is Undecidable
    • 34
    Dynamic genericity in imperative languages: example in CML
    • H. Soliman, J. Johnston
    • Computer Science
    • Proceedings ICCI `92: Fourth International Conference on Computing and Information
    • 1992
    Reasoning about programs in continuation-passing style.
    • 152
    • PDF