Results 1  10
of
28
Multidimensional Synchronous Dataflow
 IEEE Transactions on Signal Processing
, 2002
"... Signal flow graphs with dataflow semantics have been used in signal processing system simulation, algorithm development, and realtime system design. Dataflow semantics implicitly expose function parallelism by imposing only a partial ordering constraint on the execution of functions. One particular ..."
Abstract

Cited by 50 (4 self)
 Add to MetaCart
Signal flow graphs with dataflow semantics have been used in signal processing system simulation, algorithm development, and realtime system design. Dataflow semantics implicitly expose function parallelism by imposing only a partial ordering constraint on the execution of functions. One particular form of dataflow called synchronous dataflow (SDF) has been quite popular in programming environments for digital signal processing (DSP) since it has strong formal properties and is ideally suited for expressing multirate DSP algorithms. However, SDF and other dataflow models use firstin firstout (FIFO) queues on the communication channels and are thus ideally suited only for onedimensional (1D) signal processing algorithms. While multidimensional systems can also be expressed by collapsing arrays into 1D streams, such modeling is often awkward and can obscure potential data parallelism that might be present. SDF can be generalized...
Probabilistic event structures and domains
 Concurrency Theory: 15th International Conference, CONCUR ’04 Proceedings, LNCS
, 2004
"... This paper investigates probability in the presence of causal dependence. More precisely, it studies the process model of probabilistic event structures. In their simplest form probabilistic choice is localised to cells at which immediate conflict arises; in which case probabilistic independence coi ..."
Abstract

Cited by 27 (9 self)
 Add to MetaCart
This paper investigates probability in the presence of causal dependence. More precisely, it studies the process model of probabilistic event structures. In their simplest form probabilistic choice is localised to cells at which immediate conflict arises; in which case probabilistic independence coincides with causal independence. An event structure is associated with a domain—that of its configurations ordered by inclusion. In domain theory probabilistic processes are denoted by continuous valuations on a domain. A key result of this paper is a representation theorem showing how continuous valuations on the domain of a confusion free event structure correspond to the probabilistic event structures it supports. Via a notion of tests, probabilistic event structures are related to another approach to probabilistic processes, viz. Markov decision processes. Tests and morphisms of event structures point the way to a more general theory in which, for example, event structures need not be confusion free. 1
Correspondence between Operational and Denotational Semantics
 Handbook of Logic in Computer Science
, 1995
"... This course introduces the operational and denotational semantics of PCF and examines the relationship between the two. Topics: Syntax and operational semantics of PCF, Activity Lemma, undefinability of parallel or; Context Lemma (first principles proof) and proof by logical relations Denotational ..."
Abstract

Cited by 23 (0 self)
 Add to MetaCart
This course introduces the operational and denotational semantics of PCF and examines the relationship between the two. Topics: Syntax and operational semantics of PCF, Activity Lemma, undefinability of parallel or; Context Lemma (first principles proof) and proof by logical relations Denotational semantics of PCF induced by an interpretation; (standard) Scott model, adequacy, weak adequacy and its proof (by a computability predicate) Domain Theory up to SFP and Scott domains; non full abstraction of the standard model, definability of compact elements and full abstraction for PCFP (PCF + parallel or), properties of orderextensional (continuous) models of PCF, Milner's model and Mulmuley's construction (excluding proofs) Additional topics (time permitting): results on pure simplytyped lambda calculus, Friedman 's Completeness Theorem, minimal model, logical relations and definability, undecidability of lambda definability (excluding proof), dIdomains and stable functions Homepa...
Games on graphs and sequentially realizable functionals
 In Logic in Computer Science 02
, 2002
"... We present a new category of games on graphs and derive from it a model for Intuitionistic Linear Logic. Our category has the computational flavour of concrete data structures but embeds fully and faithfully in an abstract games model. It differs markedly from the usual Intuitionistic Linear Logic s ..."
Abstract

Cited by 16 (2 self)
 Add to MetaCart
We present a new category of games on graphs and derive from it a model for Intuitionistic Linear Logic. Our category has the computational flavour of concrete data structures but embeds fully and faithfully in an abstract games model. It differs markedly from the usual Intuitionistic Linear Logic setting for sequential algorithms. However, we show that with a natural exponential we obtain a model for PCF essentially equivalent to the sequential algorithms model. We briefly consider a more extensional setting and the prospects for a better understanding of the Longley Conjecture. 1
BöhmLike Trees for Rewriting
"... The work in this thesis has been carried out under the auspices of the research school IPA (Institute for Programming research and Algorithmics).vrije universiteit BöhmLike Trees for Rewriting academisch proefschrift ter verkrijging van de graad Doctor aan de Vrije Universiteit Amsterdam, op gezag ..."
Abstract

Cited by 16 (0 self)
 Add to MetaCart
The work in this thesis has been carried out under the auspices of the research school IPA (Institute for Programming research and Algorithmics).vrije universiteit BöhmLike Trees for Rewriting academisch proefschrift ter verkrijging van de graad Doctor aan de Vrije Universiteit Amsterdam, op gezag van de rector magnificus prof.dr. T. Sminia, in het openbaar te verdedigen ten overstaan van de promotiecommissie van de faculteit der Exacte Wetenschappen op maandag 20 maart 2006 om 15.45 uur in de aula van de universiteit, De Boelelaan 1105 door
Sequentiality vs. Concurrency in Games and Logic
 Math. Structures Comput. Sci
, 2001
"... Connections between the sequentiality/concurrency distinction and the semantics of proofs are investigated, with particular reference to games and Linear Logic. ..."
Abstract

Cited by 13 (0 self)
 Add to MetaCart
Connections between the sequentiality/concurrency distinction and the semantics of proofs are investigated, with particular reference to games and Linear Logic.
Notions of computability at higher types I
 In Logic Colloquium 2000
, 2005
"... We discuss the conceptual problem of identifying the natural notions of computability at higher types (over the natural numbers). We argue for an eclectic approach, in which one considers a wide range of possible approaches to defining higher type computability and then looks for regularities. As a ..."
Abstract

Cited by 11 (5 self)
 Add to MetaCart
We discuss the conceptual problem of identifying the natural notions of computability at higher types (over the natural numbers). We argue for an eclectic approach, in which one considers a wide range of possible approaches to defining higher type computability and then looks for regularities. As a first step in this programme, we give an extended survey of the di#erent strands of research on higher type computability to date, bringing together material from recursion theory, constructive logic and computer science. The paper thus serves as a reasonably complete overview of the literature on higher type computability. Two sequel papers will be devoted to developing a more systematic account of the material reviewed here.
Socially Responsive, Environmentally Friendly Logic
 in Truth and Games: Essays in Honour of Gabriel Sandu, Aho, Tuomo and AhtiVeikko Pietarinen, eds., Acta Philosophica Fennica
, 2006
"... We consider the following questions: What kind of logic has a natural semantics in multiplayer (rather than 2player) games? How can we express branching quantifiers, and other partialinformation constructs, with a properly compositional syntax and semantics? We develop a logic in answer to these ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
We consider the following questions: What kind of logic has a natural semantics in multiplayer (rather than 2player) games? How can we express branching quantifiers, and other partialinformation constructs, with a properly compositional syntax and semantics? We develop a logic in answer to these questions, with a formal semantics based on multiple concurrent strategies, formalized as closure operators on KahnPlotkin concrete domains. Partial information constraints are represented as coclosure operators. We address the syntactic issues by treating syntactic constituents, including quantifiers, as arrows in a category, with arities and coarities. This enables a fully compositional account of a wide
ABSTRACT MODELS OF TRANSFINITE REDUCTIONS
, 2010
"... We investigate transfinite reductions in abstract reduction systems. To this end, we study two abstract models for transfinite reductions: a metric model generalising the usual metric approach to infinitary term rewriting and a novel partial order model. For both models we distinguish between a we ..."
Abstract

Cited by 7 (7 self)
 Add to MetaCart
We investigate transfinite reductions in abstract reduction systems. To this end, we study two abstract models for transfinite reductions: a metric model generalising the usual metric approach to infinitary term rewriting and a novel partial order model. For both models we distinguish between a weak and a strong variant of convergence as known from infinitary term rewriting. Furthermore, we introduce an axiomatic model of reductions that is general enough to cover all of these models of transfinite reductions as well as the ordinary model of finite reductions. It is shown that, in this unifying axiomatic model, many basic relations between termination and confluence properties known from finite reductions still hold. The introduced models are applied to term rewriting but also to term graph rewriting. We can show that for both term rewriting as well as for term graph rewriting the partial order model forms a conservative extension to the metric model.
Partial Order Infinitary Term Rewriting and Böhm Trees
, 2010
"... We study an alternative model of in nitary term rewriting. Instead of a metric on terms, a partial order on partial terms is employed to formalise convergence of reductions. We consider both a weak and a strong notion of convergence and show that the metric model of convergence coincides with the p ..."
Abstract

Cited by 7 (6 self)
 Add to MetaCart
We study an alternative model of in nitary term rewriting. Instead of a metric on terms, a partial order on partial terms is employed to formalise convergence of reductions. We consider both a weak and a strong notion of convergence and show that the metric model of convergence coincides with the partial model restricted to total terms. Hence, partial order convergence constitutes a conservative extension of metric convergence that additionally offers a finegrained distinction between di erent levels of divergence. In the second part, we focus our investigation on strong convergence of orthogonal systems. The main result is that the gap between the metric model and the partial order model can be bridged by simply extending the term rewriting system by additional rules. These extensions are the wellknown Böhm extensions. Based on this result, we are able to establish that contrary to the metric setting orthogonal systems are both infinitarily confluent and infinitarily normalising in the partial order setting. The unique infinitary normal forms that the partial order model admits are Böhm trees.