{"id":145180,"date":"2004-06-01T00:00:00","date_gmt":"2004-06-01T00:00:00","guid":{"rendered":"https:\/\/www.microsoft.com\/en-us\/research\/msr-research-item\/transposing-f-to-c-expressivity-of-parametric-polymorphism-in-an-object-oriented-language\/"},"modified":"2018-10-16T19:56:47","modified_gmt":"2018-10-17T02:56:47","slug":"transposing-f-to-c-expressivity-of-parametric-polymorphism-in-an-object-oriented-language","status":"publish","type":"msr-research-item","link":"https:\/\/www.microsoft.com\/en-us\/research\/publication\/transposing-f-to-c-expressivity-of-parametric-polymorphism-in-an-object-oriented-language\/","title":{"rendered":"Transposing F to C#: Expressivity of parametric polymorphism in an object-oriented language"},"content":{"rendered":"<p>We present a type-preserving translation of System F (the polymorphic lambda calculus)<br \/>\ninto a forthcoming revision of the C] programming language supporting parameterized<br \/>\nclasses and polymorphic methods. The forthcoming revision of Java in JDK 1.5 also<br \/>\nmakes a suitable target. We formalize the translation using a subset of C] similar to<br \/>\nFeatherweight Java. We prove that the translation is fully type-preserving and that it<br \/>\npreserves behaviour via the novel use of an environment-style semantics for System F.<br \/>\nWe observe that whilst parameterized classes alone are sufficient to encode the<br \/>\nparameterized datatypes and let-polymorphism of languages such as ML and Haskell, it<br \/>\nis the presence of dynamic dispatch for polymorphic methods that supports the encoding<br \/>\nof the \u201cfirst-class polymorphism\u201d found in System F and recent extensions to ML and<br \/>\nHaskell.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>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 [&hellip;]<\/p>\n","protected":false},"featured_media":0,"template":"","meta":{"msr-url-field":"","msr-podcast-episode":"","msrModifiedDate":"","msrModifiedDateEnabled":false,"ep_exclude_from_search":false,"_classifai_error":"","msr-author-ordering":[{"type":"user_nicename","value":"akenn"},{"type":"user_nicename","value":"dsyme"}],"msr_publishername":"Wiley","msr_publisher_other":"","msr_booktitle":"","msr_chapter":"","msr_edition":"Concurrency and Computation: Practice and Experience","msr_editors":"","msr_how_published":"","msr_isbn":"","msr_issue":"7","msr_journal":"Concurrency and Computation: Practice and Experience","msr_number":"7","msr_organization":"","msr_pages_string":"","msr_page_range_start":"","msr_page_range_end":"","msr_series":"","msr_volume":"16","msr_copyright":"","msr_conference_name":"","msr_doi":"","msr_arxiv_id":"","msr_s2_paper_id":"","msr_mag_id":"","msr_pubmed_id":"","msr_other_authors":"","msr_other_contributors":"","msr_speaker":"","msr_award":"","msr_affiliation":"","msr_institution":"","msr_host":"","msr_version":"","msr_duration":"","msr_original_fields_of_study":"","msr_release_tracker_id":"","msr_s2_match_type":"","msr_citation_count_updated":"","msr_published_date":"2004-06-01","msr_highlight_text":"","msr_notes":"to appear","msr_longbiography":"","msr_publicationurl":"","msr_external_url":"","msr_secondary_video_url":"","msr_conference_url":"","msr_journal_url":"","msr_s2_pdf_url":"","msr_year":2004,"msr_citation_count":0,"msr_influential_citations":0,"msr_reference_count":0,"msr_s2_match_confidence":0,"msr_microsoftintellectualproperty":true,"msr_s2_open_access":false,"msr_s2_author_ids":[],"msr_pub_ids":[],"msr_hide_image_in_river":0,"footnotes":""},"msr-research-highlight":[],"research-area":[],"msr-publication-type":[193715],"msr-publisher":[],"msr-focus-area":[],"msr-locale":[268875],"msr-post-option":[],"msr-field-of-study":[],"msr-conference":[],"msr-journal":[],"msr-impact-theme":[],"msr-pillar":[],"class_list":["post-145180","msr-research-item","type-msr-research-item","status-publish","hentry","msr-locale-en_us"],"msr_publishername":"Wiley","msr_edition":"Concurrency and Computation: Practice and Experience","msr_affiliation":"","msr_published_date":"2004-06-01","msr_host":"","msr_duration":"","msr_version":"","msr_speaker":"","msr_other_contributors":"","msr_booktitle":"","msr_pages_string":"","msr_chapter":"","msr_isbn":"","msr_journal":"Concurrency and Computation: Practice and Experience","msr_volume":"16","msr_number":"7","msr_editors":"","msr_series":"","msr_issue":"7","msr_organization":"","msr_how_published":"","msr_notes":"to appear","msr_highlight_text":"","msr_release_tracker_id":"","msr_original_fields_of_study":"","msr_download_urls":"","msr_external_url":"","msr_secondary_video_url":"","msr_longbiography":"","msr_microsoftintellectualproperty":1,"msr_main_download":"223177","msr_publicationurl":"","msr_doi":"","msr_publication_uploader":[{"type":"file","title":"transposingftocsharp.pdf","viewUrl":"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2004\/06\/transposingftocsharp.pdf","id":223177,"label_id":0}],"msr_related_uploader":"","msr_citation_count":0,"msr_citation_count_updated":"","msr_s2_paper_id":"","msr_influential_citations":0,"msr_reference_count":0,"msr_arxiv_id":"","msr_s2_author_ids":[],"msr_s2_open_access":false,"msr_s2_pdf_url":null,"msr_attachments":[{"id":223177,"url":"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2004\/06\/transposingftocsharp.pdf"}],"msr-author-ordering":[{"type":"user_nicename","value":"akenn","user_id":30907,"rest_url":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/microsoft-research\/v1\/researchers?person=akenn"},{"type":"user_nicename","value":"dsyme","user_id":31693,"rest_url":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/microsoft-research\/v1\/researchers?person=dsyme"}],"msr_impact_theme":[],"msr_research_lab":[],"msr_event":[],"msr_group":[],"msr_project":[171037],"publication":[],"video":[],"msr-tool":[],"msr_publication_type":"article","related_content":{"projects":[{"ID":171037,"post_title":"F# at Microsoft Research","post_name":"f-at-microsoft-research","post_type":"msr-project","post_date":"2012-10-22 09:40:16","post_modified":"2017-06-09 08:52:06","post_status":"publish","permalink":"https:\/\/www.microsoft.com\/en-us\/research\/project\/f-at-microsoft-research\/","post_excerpt":"F# is a succinct, expressive, and efficient functional and object-oriented language for Microsoft .NET that helps you write simple code to solve complex problems. These pages are the historical home of F# at Microsoft Research. For the latest information on F# today, see the links to the right. F# brings you type safe, succinct, efficient, and expressive functional programming language. This simple and pragmatic language has particular strengths in data-oriented programming, parallel I\/O programming, parallel&hellip;","_links":{"self":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-project\/171037"}]}}]},"_links":{"self":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-research-item\/145180","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-research-item"}],"about":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/types\/msr-research-item"}],"version-history":[{"count":1,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-research-item\/145180\/revisions"}],"predecessor-version":[{"id":513797,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-research-item\/145180\/revisions\/513797"}],"wp:attachment":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/media?parent=145180"}],"wp:term":[{"taxonomy":"msr-research-highlight","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-research-highlight?post=145180"},{"taxonomy":"msr-research-area","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/research-area?post=145180"},{"taxonomy":"msr-publication-type","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-publication-type?post=145180"},{"taxonomy":"msr-publisher","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-publisher?post=145180"},{"taxonomy":"msr-focus-area","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-focus-area?post=145180"},{"taxonomy":"msr-locale","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-locale?post=145180"},{"taxonomy":"msr-post-option","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-post-option?post=145180"},{"taxonomy":"msr-field-of-study","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-field-of-study?post=145180"},{"taxonomy":"msr-conference","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-conference?post=145180"},{"taxonomy":"msr-journal","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-journal?post=145180"},{"taxonomy":"msr-impact-theme","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-impact-theme?post=145180"},{"taxonomy":"msr-pillar","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-pillar?post=145180"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}