| |
Browse All Reviews > Theory Of Computation (F) > Logics And Meanings Of Programs (F.3) > Semantics Of Programming Languages (F.3.2) > Operational Semantics (F.3.2...)
|
|
 |
|
|
| |
|
|
| |
1-10 of 11
Reviews about "Operational Semantics (F.3.2...)":
|
Date Reviewed |
| |
A type-theoretic foundation of continuations and prompts
Ariola Z., Herbelin H., Sabry A. ACM SIGPLAN Notices 39(9): 40-53, 2004. Type: Article
This research paper is devoted to the mathematical features of functional languages extended by control operators. More precisely, the goal is to show that a &lgr;- calculus, previously introduced by the authors [1], is a basis for...
|
Dec 20 2004 |
| |
Higher order operational techniques in semantics
Gordon A. (ed), Pitts A., Cambridge University Press, New York, NY, 1998. Type: Book (9780521631686)
According to the preface, this book “is a collection of articles about recent developments in operational semantics for higher order programming languages, by some of the leading researchers in the field. The idea for the boo...
|
Aug 1 2000 |
| |
Information flow in tabular interpretations for generalized push-down automata
de la Clergerie E., Barthélemy F. Theoretical Computer Science 199(1-2): 167-198, 1998. Type: Article
Operational descriptions of recursive computer formalisms often involve a pushdown stack as a central component. However, direct implementations of stacks may be quite inefficient because of many repetitions of identical computations o...
|
Mar 1 1999 |
| |
A multiset semantics for the pi-calculus with replication
Engelfriet J. Theoretical Computer Science 153(1-2): 65-94, 1996. Type: Article
The small pi-calculus (a recognized subset of the pi-calculus that does not have a choice operator and that includes countable replication rather than recursion) is addressed. The semantic model is a place/transition net, the (multiset...
|
Oct 1 1997 |
| |
A natural semantics for Eiffel dynamic binding
Attali I., Caromel D., Ehmety S. ACM Transactions on Programming Languages and Systems 18(6): 711-729, 1996. Type: Article
The main contribution of this work is to provide a formal dynamic semantics for inheritance when combined with renaming and redefinition for the class-based language Eiffel. Eiffel is based on identifying classes with types and identif...
|
Aug 1 1997 |
| |
Termination, deadlock, and divergence
Aceto L., Hennessy M. Journal of the ACM 39(1): 147-187, 1992. Type: Article
A uniform process language that extends algebra of communicating processes (ACP) and calculus of communicating systems (CCS) is investigated. The language provides for an explicit syntactic and semantic representation of successful ter...
|
Jun 1 1994 |
| |
Operational semantics of a kernel of the language ELECTRE
Perraurd J., Roux O., Huou M. Theoretical Computer Science 97(1): 83-103, 1992. Type: Article
An operational semantics of a subset of ELECTRE is presented using derived “event-labelled” state transitions. The idea of describing the semantics via a multilevel (here three-level) system of deterministic attrib...
|
May 1 1993 |
| |
M-LISP: a representation-independent dialect of LISP with reduction semantics
Muller R. ACM Transactions on Programming Languages and Systems 14(4): 589-616, 1992. Type: Article
The metalinguistic power of LISP is actually due to an incorrect definition of the quote operator. A semantics of LISP as such is complex. Thus, the intent of this paper is to correct this error and give a simple structural operation...
|
May 1 1993 |
| |
Representing CCS programs by finite predicate/transition nets
Taubner D. Acta Informatica 27(6): 533-565, 1990. Type: Article
During the last decade a considerable amount of research has been directed toward developing formal systems or abstract programming languages for concurrent processes, such as the CCS programs due to Milner [1], and their Petri net mod...
|
Apr 1 1991 |
| |
Distributed bisimulations
Castellani I., Hennessy M. Journal of the ACM 36(4): 887-911, 1989. Type: Article
The authors provide an operational semantics for simple CCS-like languages that take the distributed nature of processes into account. The finite CCS terms are interpreted as distributed labeled transition systems. Transitions have bot...
|
Feb 1 1991 |
| |
|
|
| |
|
|
