![]() |
CiteULike | ![]() |
zednenem's CiteULike | ![]() |
![]() |
|
![]() |
Register | ![]() |
Log in | ![]() |
A logic for parametric polymorphismedited by: M. Bezem, J. F. GrooteIn International Conference on Typed Lambda Calculi and Applications, No. 664. (1993), pp. 361-375.
|
Reviews
[Write a review of this article]
Find related articles from these CiteULike users
Find related articles with these CiteULike tags
Posting History
AbstractIn this paper we introduce a logic for parametric polymorphism. Just as LCF is a logic for the simply-typed -calculus with recursion and arithmetic, our logic is a logic for System F. The logic permits the formal presentation and use of relational parametricity. Parametricity yields---for example---encodings of initial algebras, final co-algebras and abstract datatypes, with corresponding proof principles of induction, co-induction and simulation. 1 Introduction In this paper we introduce a...
BibTeX record
RIS record