![]() |
CiteULike | ![]() |
msakai's CiteULike | ![]() |
![]() |
|
![]() |
Register | ![]() |
Log in | ![]() |
Reference counting as a computational interpretation of linear logic |
Reviews
[Write a review of this article]
Notes for this article昔のブックマークより。
Find related articles from these CiteULike users
Find related articles with these CiteULike tags
Posting History
AbstractWe develop an operational model for a language based on linear logic. Our semantics is enough to express sharing and copying while still being enough to abstract away from details of memory layout, and thus can be used to test potential applications of linear logic for analysis of programs. In particular, we demonstrate a precise relationship between type correctness for the linear-logic-based language and the correctness of a reference-counting interpretation of the primitives, and formulate and prove a result describing the possible run-time reference counts of values of linear type.
BibTeX record
RIS record