Name
Abstract | ||
|---|---|---|
The syntax of an imperative language does not mention explicitly the state, while its denotational semantics has to mention it. In this paper we show that the equational proofs about an imperative language may hide the state, in the same way as the syntax does. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.4204/EPTCS.93.3 | ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE |
Field | DocType | Issue |
Programming language,Computer science,Denotational semantics,Imperative programming,Theoretical computer science,Mathematical proof,Syntax | Journal | 93 |
ISSN | Citations | PageRank |
2075-2180 | 6 | 0.56 |
References | Authors | |
7 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jean-Guillaume Dumas | 1 | 428 | 68.48 |
| Dominique Duval | 2 | 103 | 21.52 |
| Laurent Fousse | 3 | 293 | 19.67 |
| Jean-Claude Reynaud | 4 | 47 | 9.73 |