| |
Browse All Reviews > Theory Of Computation (F) > Logics And Meanings Of Programs (F.3) > Semantics Of Programming Languages (F.3.2) > Algebraic Approaches To Semantics (F.3.2...)
|
|
 |
|
|
| |
|
|
| |
1-10 of 33
Reviews about "Algebraic Approaches To Semantics (F.3.2...)":
|
Date Reviewed |
| |
Concurrent dynamic algebra
Furusawa H., Struth G. ACM Transactions on Computational Logic 16(4): 1-38, 2015. Type: Article
Furusawa and Struth construct an algebra of multirelations (where an element is related to a set of elements) motivated by Peleg’s concurrent dynamic logic [1]. Sequential composition is no longer associative and interacts wi...
|
Nov 5 2015 |
| |
 Strategy based semantics for mobility with time and access permissions
Ciobanu G., Koutny M., Steggles J. Formal Aspects of Computing 27(3): 525-549, 2015. Type: Article
Process algebras represent mathematical formalisms for modeling distributed systems whose behavior may be subsequently analyzed by automatic tools that investigate all possible system executions....
|
Aug 12 2015 |
| |
On enumeration problems in Lie-Butcher theory
Munthe-Kaas H., Krogstad S. Future Generation Computer Systems 19(7): 1197-1205, 2003. Type: Article
In this paper, a one-to-one correspondence between the set of balanced binary Lyndon words and the Hall basis for the free Lie algebra over ordered trees is constructed. Since those Lyndon words are easy to construct, this result may b...
|
Jan 21 2004 |
| |
A fully abstract semantics for a higher-order functional language with nondeterministic computation
Jeffrey A. Theoretical Computer Science 228(1-2): 105-150, 1999. Type: Article
This paper contributes to the simplification of the denotational semantics of a language by separating the semantics of a calculation from the semantics of the value it delivers....
|
Dec 1 1999 |
| |
A representable approach to finite nondeterminism
Anderson S., Power A. Theoretical Computer Science 177(1): 3-25, 1997. Type: Article
The authors reformulate denotational semantics in order to capture nondeterminism. They use as primitive constructions sequential composition of programs and a nondeterministic operation ∨ on programs. The who...
|
Apr 1 1998 |
| |
Constructing process categories
Cockett J., Spooner D. (ed) Theoretical Computer Science 177(1): 73-109, 1997. Type: Article
Most researchers in concurrency theory feel that all models of interleaving style concurrency are essentially the same and, in some sense, different from noninterleaving models. In recent years, the similarities and differences among t...
|
Dec 1 1997 |
| |
Process versus unfolding semantics for place/transition Petri nets
Meseguer J., Montanari U., Sassone V. (ed) Theoretical Computer Science 153(1-2): 171-210, 1996. Type: Article
A categorical approach is used to study the relationship among various semantics for place/transition Petri nets. In particular, the authors consider nonsequential processes semantics, unfolding semantics, and algebraic model semantics...
|
Aug 1 1997 |
| |
Locality and interleaving semantics in calculi for mobile processes
Sangiorgi D. Theoretical Computer Science 155(1): 39-83, 1996. Type: Article
Unlike many papers that appear as “Fundamental Studies” in Theoretical Computer Science, this paper is not primarily a tutorial, nor is it a rationalization of an established body of knowledge. It does includ...
|
Feb 1 1997 |
| |
Parametricity as isomorphism
Robinson E. Theoretical Computer Science 136(1): 163-181, 1994. Type: Article
Robinson presents a theory for types that are parameterized by elements from some other object. He considers the idea of treating such a type as an arbitrary functor from some parameterizing category to a given category of types. Thus,...
|
Sep 1 1996 |
| |
Decidability of bisimulation equivalence for process generating context-free languages
Baeten J., Bergstra J., Klop J. Journal of the ACM 40(3): 653-682, 1993. Type: Article
A system of recursion equations specifies a process. This process consists of some atomic actions and two operators, + meaning “or” and . meaning “followed by.” Both operations are assumed to be ...
|
Jan 1 1995 |
| |
|
|
| |
|
|
