![]() |
CiteULike | ![]() |
dherman's CiteULike | ![]() |
![]() |
|
![]() |
Register | ![]() |
Log in | ![]() |
Computational Comonads and Intensional Semanticsby: Stephen Brookes, Shai Geva
edited by: M. P. Fourman, P. T. Johnstone, A. M. PittsIn Applications of Categories in Computer Science: Proceedings LMS Symp., Durham, {UK}, 20--30 July 1991, Vol. 177 (1992), pp. 1-44.
|
Reviews
[Write a review of this article]
Find related articles from these CiteULike users
Find related articles with these CiteULike tags
Posting History
AbstractWe explore some foundational issues in the development of a theory of intensional semantics. A programming language may be given a variety of semantics, differing in the level of abstraction; one generally chooses the semantics at an abstraction level appropriate for reasoning about a particular kind of program property. Extensional semantics are typically appropriate for proving properties such as partial correctness, but an intensional semantics at a lower abstraction level is required in...
BibTeX record
RIS record