Now showing items 1-5 of 5

    • A Category-Theoretic Semantics for Unbounded Indeterminacy 

      Panangaden, Prakash; Russell, James R. (Cornell University, 1988-12)
      In this paper we give a category-theoretic semantics for a simple imperative language featuring unbounded indeterminacy. This semantics satisfies the categorical analogues of continuity and has the meaning of while loops ...
    • A Constructive Proof of Higman's Lemma 

      Murthy, Chetan R.; Russell, James R. (Cornell University, 1989-10)
      Higman's Lemma is a special case of the more general Kruskal's tree embedding theorem and the graph minor theorem. Prior to this work, only classical (and impredicative) proofs of the Lemma were known. Recently, there ...
    • Full Abstraction and Fixed-Point Principles for Indeterminate Computation 

      Russell, James R. (Cornell University, 1990-04)
      Recently, there has been much interest in the problem of finding semantic models for various kinds of concurrent systems. A common property of concurrent systems is indeterminate behavior, either because of unpredictable ...
    • Full Abstraction for Nondeterministic Dataflow Networks 

      Russell, James R. (Cornell University, 1989-06)
      We discuss the problem of finding fully abstract semantic models for nondeterministic dataflow networks. We present the result that there exist nondeterministic networks using only bounded choice for which the input-output ...
    • On Oraclizable Networks and Kahn's Principle 

      Russell, James R. (Cornell University, 1989-10)
      In this paper we investigate generalizations of Kahn's principle to nondeterministic dataflow networks. Specifically, we show that for the class of "oraclizable" networks a semantic model in which networks are represented ...