Computer Science and Artificial Intelligence Lab (CSAIL): Recent submissions

Now showing items 319-321 of 3794

    • 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 ...

    • Using Cycles and Scaling in Parallel Algorithms 

      Stein, Clifford (1989-08)
      We introduce the technique of decomposing an undirected graph by finding a maximal set of edge-disjoint cycles. We give a parallel algorithm to find this decomposition in O(log n) time on (m+ n)/log n processors. We ...