![]() |
CiteULike | ![]() |
msakai's CiteULike | ![]() |
![]() |
|
![]() |
Register | ![]() |
Log in | ![]() |
Strong normalization of the second-order symmetric [lambda][mu]-calculus |
Reviews
[Write a review of this article]
Find related articles from these CiteULike users
Find related articles with these CiteULike tags
Posting History
AbstractParigot [Computational Logic and Proof Theory, vol. 713, 1993, p. 263] suggested symmetric structural reduction rules to ensure unique representation of data types. We prove strong normalization of the second-order [lambda][mu]-calculus with such rules.
BibTeX record
RIS record