Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9657782 | Theoretical Computer Science | 2005 | 30 Pages |
Abstract
The approach makes it possible to study the contribution of various constructs of the language to the complexity of program equivalence and demonstrates a similarity between call-by-name game semantics and call-by-name interpreters.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Andrzej S. Murawski,