| |
Browse All Reviews > Theory Of Computation (F) > Logics And Meanings Of Programs (F.3) > Semantics Of Programming Languages (F.3.2) > Denotational Semantics (F.3.2...)
|
|
 |
|
|
| |
|
|
| |
1-10 of 28
Reviews about "Denotational Semantics (F.3.2...)":
|
Date Reviewed |
| |
A model of dynamical concurrent program execution
Vasenin V., Krivchikov M. Programming and Computing Software 39(1): 1-9, 2013. Type: Article
Suppose we have a class of objects that represent the state of a computer, and a function that takes one of these objects as an argument and returns another one of these objects. If we have a way to translate a program into such a func...
|
Jan 15 2014 |
| |
Inverse and implicit functions in domain theory
Edalat A., Pattinson D. Logic in computer science (Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science (LICS’ 05),Jun 26-29, 2005) 417-426, 2005. Type: Proceedings
The aim of this paper is to develop a systematic and recursive method to approximate an implicitly given surface via two sequences of piecewise linear or piecewise polynomial surfaces, which converge locally in the C...
|
Nov 1 2006 |
| |
Games and full abstraction for FPC
McCusker G. Information and Computation 160(1-2): 1-61, 2000. Type: Article, Reviews: (1 of 2)
The substantial piece of work described here culminates in a denotational semantic definition of the fixed point calculus (FPC), seen as a sequential functional programming language. As such, this paper extends the seminal work of Plot...
|
Aug 1 2000 |
| |
Games and full abstraction for FPC
McCusker G. Information and Computation 160(1-2): 1-61, 2000. Type: Article, Reviews: (2 of 2)
The substantial piece of work described here culminates in adenotational semantic definition of the fixed point calculus (FPC), seenas a sequential functional programming language. As such, this paperextends the seminal work of Plotkin...
|
Aug 1 2000 |
| |
Objects, interference, and the Yoneda embedding
O’Hearn P. (ed), Reddy U. Theoretical Computer Science 228(1-2): 253-282, 1999. Type: Article
Algol-like languages, languages of great theoretical and practical importance, are studied in this paper. Following the stance that procedures act on the state that exists at their point of declaration, and that a variable (associated ...
|
Apr 1 2000 |
| |
Domains and lambda-calculi
Amadio R., Curien P. (ed), Cambridge University Press, New York, NY, 1998. Type: Book (9780521622776)
Theoretical computer scientists seek to understand programming by providing semantics for programming languages; they seek to identify the mathematical objects that programs denote. Because programs denote very complex mathematical obj...
|
Oct 1 1999 |
| |
A denotational semantics for a process-based simulation language
Tofts C., Birtwistle G. ACM Transactions on Modeling and Computer Simulation 8(3): 281-305, 1998. Type: Article
The authors describe a formal translation from &mgr;Demos, the kernel of the process-based simulation language Demos, to Milner’s CCS process algebra. They call this translation a denotational semantics and claim that it ...
|
May 1 1999 |
| |
Axiomatic domain theory in categories of partial maps
Fiore M., Cambridge University Press, New York, NY, 1996. Type: Book (9780521571883)
I began this reviewing assignment with more than usual interest, because its subject continues work I studied in the 1970s. It was good to see some of the major researchers from those days--Dana Scott, Saunders MacLane, and Ha...
|
Sep 1 1997 |
| |
Metric completion versus ideal completion
Majster-Cederbaum M., Baier C. Theoretical Computer Science 170(1-2): 145-171, 1996. Type: Article
The intended audience for this paper is mathematicians and those theoretical computer scientists working on the denotational semantics of parallel or concurrent programs. To model recursive or infinite behavior of programs, complete pa...
|
Sep 1 1997 |
| |
Fixed points without completeness
Mislove M. (ed), Roscoe A., Schneider S. Theoretical Computer Science 138(2): 273-314, 1995. Type: Article
It is well known that recursion in a language requires a model in which sufficiently many functions have fixed points. In this approach, recursion is modeled by using least fixed points, which exist because of the order structure of th...
|
Sep 1 1996 |
| |
|
|
| |
|
|
