Results 1  10
of
28
Term Rewriting Systems
, 1992
"... Term Rewriting Systems play an important role in various areas, such as abstract data type specifications, implementations of functional programming languages and automated deduction. In this chapter we introduce several of the basic comcepts and facts for TRS's. Specifically, we discuss Abstract Re ..."
Abstract

Cited by 566 (16 self)
 Add to MetaCart
Term Rewriting Systems play an important role in various areas, such as abstract data type specifications, implementations of functional programming languages and automated deduction. In this chapter we introduce several of the basic comcepts and facts for TRS's. Specifically, we discuss Abstract Reduction Systems
Testing Equivalences for Processes
 Theoretical Computer Science
, 1984
"... Abstract. Given a set of processes and a set of tests on these processes we show how to define in a natural way three different eyuitalences on processes. ThesP equivalences are applied to a particular language CCS. We give associated complete proof systems and fully abstract models. These models ha ..."
Abstract

Cited by 408 (26 self)
 Add to MetaCart
Abstract. Given a set of processes and a set of tests on these processes we show how to define in a natural way three different eyuitalences on processes. ThesP equivalences are applied to a particular language CCS. We give associated complete proof systems and fully abstract models. These models have a simple representation in terms of trees.
Logic and the Challenge of Computer Science
, 1988
"... Nowadays computer science is surpassing mathematics as the primary field of logic applications, but logic is not tuned properly to the new role. In particular, classical logic is preoccupied mostly with infinite static structures whereas many objects of interest in computer science are dynamic objec ..."
Abstract

Cited by 153 (16 self)
 Add to MetaCart
Nowadays computer science is surpassing mathematics as the primary field of logic applications, but logic is not tuned properly to the new role. In particular, classical logic is preoccupied mostly with infinite static structures whereas many objects of interest in computer science are dynamic objects with bounded resources. This chapter consists of two independent parts. The first part is devoted to finite model theory; it is mostly a survey of logics tailored for computational complexity. The second part is devoted to dynamic structures with bounded resources. In particular, we use dynamic structures with bounded resources to model Pascal.
Termination, deadlock, and divergence
 Journal of the ACM
"... Abstract. In this paper, a process algebra that incorporates expliclt representations of successful termination, deadlock, and divergence is introduced and its semantic theory is analyzed. Both an operational and a denotational semantics for the language is given and it is shown that they agree. The ..."
Abstract

Cited by 40 (14 self)
 Add to MetaCart
Abstract. In this paper, a process algebra that incorporates expliclt representations of successful termination, deadlock, and divergence is introduced and its semantic theory is analyzed. Both an operational and a denotational semantics for the language is given and it is shown that they agree. The operational theory N based upon a suitable adaptation of the notion of bisimulation preorder. The denotational semantics forthelanguage isgiven interms of theinitial continuous algebra that satisfiesa set of equations E, CI~. It is shown that C’IE is fully abstract with respect to our choice of behavioral preorder. Several results ofindependent interest are obtained; namely, the finite approximability of the behavioral preorder and a partial completeness result for the set of equations E with respect to the preorder.
Adequacy for algebraic effects
 In 4th FoSSaCS
, 2001
"... We present a logic for algebraic effects, based on the algebraic representation of computational effects by operations and equations. We begin with the acalculus, a minimal calculus which separates values, effects, and computations and thereby canonises the order of evaluation. This is extended to ..."
Abstract

Cited by 30 (16 self)
 Add to MetaCart
We present a logic for algebraic effects, based on the algebraic representation of computational effects by operations and equations. We begin with the acalculus, a minimal calculus which separates values, effects, and computations and thereby canonises the order of evaluation. This is extended to obtain the logic, which is a classical firstorder multisorted logic with higherorder value and computation types, as in Levy’s callbypushvalue, a principle of induction over computations, a free algebra principle, and predicate fixed points. This logic embraces Moggi’s computational λcalculus, and also, via definable modalities, HennessyMilner logic, and evaluation logic, though Hoare logic presents difficulties. 1
Algebraic Approaches to Nondeterminism  an Overview
 ACM Computing Surveys
, 1997
"... this paper was published as Walicki, M.A. and Meldal, S., 1995, Nondeterministic Operators in Algebraic Frameworks, Tehnical Report No. CSLTR95664, Stanford University ..."
Abstract

Cited by 23 (3 self)
 Add to MetaCart
this paper was published as Walicki, M.A. and Meldal, S., 1995, Nondeterministic Operators in Algebraic Frameworks, Tehnical Report No. CSLTR95664, Stanford University
A Model for the piCalculus
, 1991
"... We develop a semantic theory based on testing for a minor variant of the ßcalculus. The resulting semantic equivalence can be characterised using of acceptance sets and can also be characterised as an equational theory. We define a class of interpretations for the ßcalculus and construct one whic ..."
Abstract

Cited by 22 (4 self)
 Add to MetaCart
We develop a semantic theory based on testing for a minor variant of the ßcalculus. The resulting semantic equivalence can be characterised using of acceptance sets and can also be characterised as an equational theory. We define a class of interpretations for the ßcalculus and construct one which is fullyabstract. Moreover the interpretation we construct is initial in the class of all fullyabstract interpretations. This work has been supported by the ESPRIT/BRA CONCUR project 1 Introduction In [MPW92a], [MPW92b], a calculus of mobile processes, the ßcalculus, is presented. The first reference is an introduction to the calculus and the second develops a semantic theory based on bisimulations, [Mil89]. The ßcalculus is an extension of the process algebra CCS, a more primitive calculus for describing and manipulating processes which perform uninterpreted actions. In the ßcalculus these actions are now interpreted as either the input or output of values along channels. The p...
Softening up Hard Science: reply to Newell and Card
 Human Computer Interaction
, 1986
"... A source of intellectual overhead periodically encountered by scientists is the call to be "hard," to insure good science by imposing severe methodological strictures. Newell and Card (1985) have undertaken to impose such strictures on the psychology of humancomputer interaction. Although their disc ..."
Abstract

Cited by 14 (3 self)
 Add to MetaCart
A source of intellectual overhead periodically encountered by scientists is the call to be "hard," to insure good science by imposing severe methodological strictures. Newell and Card (1985) have undertaken to impose such strictures on the psychology of humancomputer interaction. Although their discussion contributes to theoretical debate in humancomputer interaction by setting a reference point, their specific argument fails. Their program is unmotivated, is severely limited, and suffers from these limitations in principle. A top priority for the psychology of humancomputer interaction should be the articulation of an alternative explanatory program, one that takes as its starting point the need to understand the real problems involved in providing better computer tools for people to use. 1. Newell and Card on Being Hard Newell and Card (1985) have presented a program for psychological research in humancomputer interaction couched as an analysis of how psychology can avoid being ...
The category theoretic solution of recursive program schemes
 Proc. First Internat. Conf. on Algebra and Coalgebra in Computer Science (CALCO 2005), Lecture Notes in Computer Science
, 2006
"... Abstract. This paper provides a general account of the notion of recursive program schemes, studying both uninterpreted and interpreted solutions. It can be regarded as the categorytheoretic version of the classical area of algebraic semantics. The overall assumptions needed are small indeed: worki ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
Abstract. This paper provides a general account of the notion of recursive program schemes, studying both uninterpreted and interpreted solutions. It can be regarded as the categorytheoretic version of the classical area of algebraic semantics. The overall assumptions needed are small indeed: working only in categories with “enough final coalgebras ” we show how to formulate, solve, and study recursive program schemes. Our general theory is algebraic and so avoids using ordered, or metric structures. Our work generalizes the previous approaches which do use this extra structure by isolating the key concepts needed to study substitution in infinite trees, including secondorder substitution. As special cases of our interpreted solutions we obtain the usual denotational semantics using complete partial orders, and the one using complete metric spaces. Our theory also encompasses implicitly defined objects which are not usually taken to be related to recursive program schemes. For example, the classical Cantor twothirds set falls out as an interpreted