JavaScript is disabled for your browser. Some features of this site may not work without it.
Browsing by Author "Panangaden, Prakash"
Now showing items 120 of 22

Categorical Type Theory
Panangaden, Prakash; Schwartzbach, Michael I. (Cornell University, 198512)This paper examines the connections between intuitionistic type theory and category theory. A version of type theory is developed in a category theoretic framework by interpreting types as objects and type connectives ... 
A CategoryTheoretic Semantics for Unbounded Indeterminacy
Panangaden, Prakash; Russell, James R. (Cornell University, 198812)In this paper we give a categorytheoretic semantics for a simple imperative language featuring unbounded indeterminacy. This semantics satisfies the categorical analogues of continuity and has the meaning of while loops ... 
Computation of Aliases and Support Sets
Neirynck, Anne; Panangaden, Prakash; Demers, Alan J. (Cornell University, 198607)When programs are intended for parallel execution it becomes critical to determine whether the evaluations of two expressions can be carried out independently. We provide a scheme for making such determinations in a ... 
Computations, Residuals, and the Power of Indeterminacy
Panangaden, Prakash; Stark, Eugene W. (Cornell University, 198711)We investigate the power of Kahnstyle dataflow networks, with processes that may exhibit indeterminate behavior. Our main result is a theorem about networks of "monotone" processes, which shows: (1) that the input/output ... 
Concurrent Common Knowledge: A New Definition of Agreement for Asynchronous Systems
Panangaden, Prakash; Taylor, Kimberly E. (Cornell University, 198905)In this paper we discuss a new, knowledgetheoretic definition of agreement appropriate to asynchronous systems. This definition has two important features: first, it uses causality, rather than time, in its definition ... 
A DomainTheoretic Model for a HigherOrder Process Calculus
Jagadeesan, Radhakrishnan; Panangaden, Prakash (Cornell University, 198911)In this paper we study a higherorder process calculus, a restriction of one due to Boudol, and develop an abstract, model for it. By abstract we mean that the model is constructed domaintheoretically and reflects a ... 
The Expressive Power of Delay Operators in SCCS
Critchlow, Carol M.; Panangaden, Prakash (Cornell University, 198905)We investigate the relative expressive power of finite delay operators in SCCS. These were introduced by Milner and by Hennessy to study fairness properties of processes in the context of SCCS. We show that the context ... 
Expressiveness Bounds for Completeness in TraceBased Network Proof Systems
Widom, Jennifer; Panangaden, Prakash (Cornell University, 198709)Network proof systems based on firstorder specifications over channel traces are incomplete unless reasoning over the interleaving of communication events is permitted. Relatively complete tracebased proof systems using ... 
Finitary Choice Cannot Express Fairness: A Metric Space Technique
Moitra, Abha; Panangaden, Prakash (Cornell University, 198610) 
FRESH: A HigherOrder Language with Unification and Multiple Results
Smolka, Gert; Panangaden, Prakash (Cornell University, 198505)This paper presents Fresh, a language that integrates logic programming features into higherorder functional programming. The language incorporates unification, multiple results and a collection construct. Many examples ... 
A Fully Abstract Semantics for a Functional Language with Logic Variables
Pingali, Keshav; Panangaden, Prakash; Jagadeesan, Radhakrishnan (Cornell University, 198902)We present a novel denotational semantics for a functional language with logic variables intended for parallel execution. The intuition behind this semantics is that equations represent equational constraints on data. ... 
Infinite Objects in Type Theory
Mendler, N. P.; Panangaden, Prakash; Constable, Robert L. (Cornell University, 198603)In this paper we show how infinite objects can be defined in a constructive type theory. The type theory that we use is a variant of MartinLof's Intuitionistic Type Theory. We show how one can express the intuition that ... 
McCarthy's Amb Cannot Implement Fair Merge
Panangaden, Prakash; Shanbhogue, Vasant (Cornell University, 198805)In this paper, we establish that fair merge is a powerful nondeterministic primitive that cannot be implemented in terms of other wellknown primitives. It is well known that fair merge embodies countable nondeterminism. ... 
A Metrized Duality Theorem for Markov Processes
Kozen, Dexter; Mardare, Radu; Panangaden, Prakash (20140521)We extend our previous duality theorem for Markov processes by equipping the processes with a pseudometric and the algebras with a notion of metric diameter. We are able to show that the isomorphisms of our previous duality ... 
Nonexpressibility of Fairness and Signaling
McAllester, David; Panangaden, Prakash (Cornell University, 198902)In this paper, we establish new expressiveness results for indeterminate dataflow primitives. We consider choice primitives with three differing fairness assumptions and show that they are strictly inequivalent in ... 
On the Expressive Power of Indeterminate Network Primitives
Panangaden, Prakash; Shanbhogue, Vasant (Cornell University, 198712)It is well known that a fair merge primitive leads to unbounded indeterminacy. In this paper we show that unbounded indeterminacy cannot express a fair merge in the setting of Kahnstyle dataflow networks. Intuitively, ... 
A Proof System for Dataflow Networks with Indeterminate Modules
Moitra, Abha; Panangaden, Prakash (Cornell University, 198609)In this paper we discuss a model for dataflow networks containing indeterminate operators and the associated proof system. The model is denotational and associates with each network the set of possible behaviors. The ... 
Semantics of Digital Networks Containing Indeterminate Modules
Keller, Robert M.; Panangaden, Prakash (Cornell University, 198512)We discuss a formal model based upon dataflow, usable for highlevel digital hardware design, among other things. One of our goals is to give a denotational semantics for this model, which includes indeterminate modules. ... 
Stabilitly and Sequentiality in Dataflow Networks
Panangaden, Prakash; Shanbhogue, Vasant; Stark, Eugene W. (Cornell University, 198911)The class of monotone input/output automata has been shown in the authors' previous work to be a useful operational model for a dataflowstyle networks of communicating processes. An interesting class of problems arising ... 
Stone Duality for Markov Processes
Kozen, Dexter; Larsen, Kim G.; Mardare, Radu; Panangaden, Prakash (20130314)We define Aumann algebras, an algebraic analog of probabilistic modal logic. An Aumann algebra consists of a Boolean algebra with operators modeling probabilistic transitions. We prove that countable Aumann algebras and ...