Now showing items 313-315 of 1152

    • Probabilistic Reasoning in the Domain of Genetic Counseling 

      Harris, Nomi L. (1989-10)
      This paper describes a program, GENINFER, which uses belief networks to calculate risks of inheriting genetic disorders. GENINFER is based on Judea Pearl's [17] algorithm for fusion and propagation in probabilistic belief ...
    • Should a Function Continue? 

      Riecke, Jon Gary (1989-09)
      We show that two l-calculus terms can be observationally congruent (i.e., agree in all contexts) but their continuation-passing transforms may not be. We also show that two terms may be congruent in all untyped contexts ...
    • Typechecking is Undecidable when 'Type' is a Type 

      Reinhold, Mark B. (1989-12)
      A function has a dependent type when the type of its result depends upon the value of its argument. The type of all types is the type of every type, including itself. In a typed l-calculus, these two features synergize ...