Transposing F to C♯: expressivity of parametric polymorphism in an object-oriented language: Research Articles

Authors:
Andrew Kennedy;Don Syme
Affiliations:
Microsoft Research, 7 J. J. Thomson Avenue, Cambridge CB3 OFB, U.K.;Microsoft Research, 7 J. J. Thomson Avenue, Cambridge CB3 OFB, U.K.
Venue:
Concurrency and Computation: Practice & Experience - Formal Techniques for Java-like Programs
Year:
2004

Citing 0
Cited 8

Formalization of generics for the .NET common language runtime

Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Associated types and constraint propagation for mainstream object-oriented generics

OOPSLA '05 Proceedings of the 20th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Generalized algebraic data types and object-oriented programming

OOPSLA '05 Proceedings of the 20th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Typed parametric polymorphism for aspects

Science of Computer Programming - Special issue: Foundations of aspect-oriented programming
Type-preserving compilation of end-to-end verification of security enforcement

PLDI '10 Proceedings of the 2010 ACM SIGPLAN conference on Programming language design and implementation
Taming the wildcards: combining definition- and use-site variance

Proceedings of the 32nd ACM SIGPLAN conference on Programming language design and implementation
On the revival of dynamic languages

SC'05 Proceedings of the 4th international conference on Software Composition
Variance and generalized constraints for C# generics

ECOOP'06 Proceedings of the 20th European conference on Object-Oriented Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a type-preserving translation of System F (the polymorphic lambda calculus) into a forthcoming revision of the C♯ programming language supporting parameterized classes and polymorphic methods. The forthcoming revision of Java in JDK 1.5 also makes a suitable target. We formalize the translation using a subset of C♯ similar to Featherweight Java. We prove that the translation is fully type-preserving and that it preserves behaviour via the novel use of environment-style semantics for System F.We observe that whilst parameterized classes alone are sufficient to encode the parameterized datatypes and let-polymorphism of languages such as ML and Haskell, it is the presence of dynamic dispatch for polymorphic methods that supports the encoding of the ‘first-class polymorphism’ found in System F and recent extensions to ML and Haskell. Copyright © 2004 John Wiley & Sons, Ltd.