The minimal function graph semantics of Jones and Mycroft is
a standard denotational semantics modified to include only
`reachable' parts of a program. We show that it may be
expressed directly in terms of the
standard semantics without the need for instrumentation at
the expression level and, in doing so,
bring out a connection with strictness.
This also makes it possible to prove a stronger theorem of
correctness for the minimal function graph semantics.
| Originalsprog | Engelsk |
|---|
| Titel | WSA'92 Workshop on Static Analysis |
|---|
| Redaktører | M Billaud, P Casteran, MM Corsini, K Musumbu, A Rauzy |
|---|
| Antal sider | 8 |
|---|
| Udgivelsessted | Bordeaux, France |
|---|
| Forlag | IRISA |
|---|
| Publikationsdato | 1992 |
|---|
| Sider | 60-67 |
|---|
| Status | Udgivet - 1992 |
|---|
| Navn | Bigre |
|---|
| Vol/bind | 81-82 |
|---|
| ISSN | 0221-5225 |
|---|