{"id":234,"date":"2013-01-22T09:00:00","date_gmt":"2013-01-22T09:00:00","guid":{"rendered":"https:\/\/blogs.technet.microsoft.com\/inside_microsoft_research\/2013\/01\/22\/programming-languages-in-the-eternal-city\/"},"modified":"2016-07-20T07:32:06","modified_gmt":"2016-07-20T14:32:06","slug":"programming-languages-in-the-eternal-city","status":"publish","type":"post","link":"https:\/\/www.microsoft.com\/en-us\/research\/blog\/programming-languages-in-the-eternal-city\/","title":{"rendered":"Programming Languages in the Eternal City"},"content":{"rendered":"<p class=\"posted-by\">Posted by <span class=\"author\">Rob Knies<\/span><\/p>\n<p><a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" target=\"_blank\" href=\"https:\/\/msdnshared.blob.core.windows.net\/media\/TNBlogsFS\/prod.evol.blogs.technet.com\/CommunityServer.Blogs.Components.WeblogFiles\/00\/00\/00\/90\/35\/7823.POPL%202014%20logo.jpg\" original-url=\"http:\/\/blogs.technet.com\/cfs-file.ashx\/__key\/communityserver-blogs-components-weblogfiles\/00-00-00-90-35\/7823.POPL-2014-logo.jpg\"><img decoding=\"async\" style=\"margin: 10px; border: 0px currentColor; float: left;\" title=\"POPL 2014 logo\" src=\"https:\/\/msdnshared.blob.core.windows.net\/media\/TNBlogsFS\/prod.evol.blogs.technet.com\/CommunityServer.Blogs.Components.WeblogFiles\/00\/00\/00\/90\/35\/7823.POPL%202014%20logo.jpg\" original-url=\"http:\/\/blogs.technet.com\/resized-image.ashx\/__size\/550x0\/__key\/communityserver-blogs-components-weblogfiles\/00-00-00-90-35\/7823.POPL-2014-logo.jpg\" alt=\"POPL 2014 logo\" width=\"350\" \/><span class=\"sr-only\"> (opens in new tab)<\/span><\/a><\/p>\n<p>The <a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" title=\"Symposium on Principles of Programming Languages\" href=\"http:\/\/popl.mpi-sws.org\/2013\/\" target=\"_blank\">Symposium on Principles of Programming Languages<span class=\"sr-only\"> (opens in new tab)<\/span><\/a> (POPL) is an annual gathering of thought leaders from around the world to discuss all aspects of programming languages and systems, so it is a given that as the 40th instance of the event gets under way in Rome on Jan. 23, Microsoft Research will be providing <a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" title=\"robust support\" href=\"http:\/\/research.microsoft.com\/en-us\/events\/popl2013\/default.aspx\" target=\"_blank\">robust support<span class=\"sr-only\"> (opens in new tab)<\/span><\/a>.<\/p>\n<p>Twenty-two papers, co-written by a total of 36 Microsoft Research scientists, were selected for presentation during the symposium, which concludes Jan. 25, and its co-located events&mdash;which began Jan. 20 and run through Jan. 26. Twenty attendees, spanning the <a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" title=\"Research in Software Engineering\" href=\"http:\/\/research.microsoft.com\/en-us\/groups\/rise\/default.aspx\" target=\"_blank\">Research in Software Engineering<span class=\"sr-only\"> (opens in new tab)<\/span><\/a> team from <a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" title=\"Microsoft Research Redmond\" href=\"http:\/\/research.microsoft.com\/en-us\/labs\/redmond\/default.aspx\" target=\"_blank\">Microsoft Research Redmond<span class=\"sr-only\"> (opens in new tab)<\/span><\/a>, the <a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" title=\"Programming Principles and Tools\" href=\"http:\/\/research.microsoft.com\/en-us\/groups\/ppt\/default.aspx\" target=\"_blank\">Programming Principles and Tools<span class=\"sr-only\"> (opens in new tab)<\/span><\/a> group from <a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" title=\"Microsoft Research Cambridge\" href=\"http:\/\/research.microsoft.com\/en-us\/labs\/cambridge\/default.aspx\" target=\"_blank\">Microsoft Research Cambridge<span class=\"sr-only\"> (opens in new tab)<\/span><\/a>, and the <a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" title=\"Programming Languages and Tools\" href=\"http:\/\/research.microsoft.com\/en-us\/groups\/rse\/\" target=\"_blank\">Programming Languages and Tools<span class=\"sr-only\"> (opens in new tab)<\/span><\/a> unit from <a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" title=\"Microsoft Research India\" href=\"http:\/\/research.microsoft.com\/en-us\/labs\/india\/default.aspx\" target=\"_blank\">Microsoft Research India<span class=\"sr-only\"> (opens in new tab)<\/span><\/a>.<\/p>\n<p>It&rsquo;s only natural, says <a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" title=\"Judith Bishop\" href=\"http:\/\/research.microsoft.com\/en-us\/people\/jbishop\/\" target=\"_blank\">Judith Bishop<span class=\"sr-only\"> (opens in new tab)<\/span><\/a>, director of <a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" title=\"Computer Science\" href=\"http:\/\/research.microsoft.com\/en-us\/collaboration\/focus\/cs\/default.aspx\" target=\"_blank\">Computer Science<span class=\"sr-only\"> (opens in new tab)<\/span><\/a> for <a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" title=\"Microsoft Research Connections\" href=\"http:\/\/research.microsoft.com\/en-us\/collaboration\/default.aspx\" target=\"_blank\">Microsoft Research Connections<span class=\"sr-only\"> (opens in new tab)<\/span><\/a>.<\/p>\n<p>&ldquo;Microsoft has a long tradition of innovation in programming languages,&rdquo; she says, &ldquo;with C# and <a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" title=\"F#\" href=\"http:\/\/research.microsoft.com\/en-us\/projects\/fsharp\/default.aspx\" target=\"_blank\">F#<span class=\"sr-only\"> (opens in new tab)<\/span><\/a> being two that have become part of the <a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" title=\"Windows\" href=\"http:\/\/windows.microsoft.com\/en-US\/windows\/home\" target=\"_blank\">Windows<span class=\"sr-only\"> (opens in new tab)<\/span><\/a> ecosystem in the past decade. Microsoft Research also looks ahead at the wider issues discussed during POPL on how principles underpin practice.<\/p>\n<p>&ldquo;Security of code, speedup through concurrency, and abstraction for easier creation of code are all aspects covered by our researchers. With researchers in programming-languages groups in three Microsoft Research labs across the globe, POPL serves as a forum where we can meet other experts and inspire the upcoming talents of new graduates.&rdquo;<\/p>\n<p>In addition to serving as a sponsor of the event, Microsoft Research will be involved in a broad array of POPL activities, including:<\/p>\n<ul>\n<li>The <a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" title=\"gold release\" href=\"http:\/\/blogs.msdn.com\/b\/msr_er\/archive\/2013\/01\/22\/try-f-data-console-to-big-and-broad-data.aspx\" target=\"_blank\">gold release<span class=\"sr-only\"> (opens in new tab)<\/span><\/a> of <a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" title=\"Try F#\" href=\"http:\/\/www.tryfsharp.org\/\" target=\"_blank\">Try F#<span class=\"sr-only\"> (opens in new tab)<\/span><\/a>, a collection of tools that make it easy to learn the F# language, create programs, explore rich data sets, and write and share code with the community from a familiar, browser-based experience.<\/li>\n<li>The <a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" title=\"Data Driven Functional Programming Workshop\" href=\"http:\/\/research.microsoft.com\/en-us\/events\/ddfp2013\/\" target=\"_blank\">Data Driven Functional Programming Workshop<span class=\"sr-only\"> (opens in new tab)<\/span><\/a>, one of the events co-located with POPL, will be held Jan. 22, with <a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" title=\"Evelyne Viegas\" href=\"http:\/\/research.microsoft.com\/en-us\/people\/evelynev\/\" target=\"_blank\">Evelyne Viegas<span class=\"sr-only\"> (opens in new tab)<\/span><\/a> of Microsoft Research Connections serving as general chair and Bishop acting as program co-chair. The workshop will examine data-centric programming in today&rsquo;s era of big data, focusing on the application of functional programming and meta-programming techniques.<\/li>\n<li><a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" title=\"Georges Gonthier\" href=\"http:\/\/research.microsoft.com\/en-us\/people\/gonthier\/\" target=\"_blank\">Georges Gonthier<span class=\"sr-only\"> (opens in new tab)<\/span><\/a>, principal researcher at Microsoft Research Cambridge, will deliver a Jan. 23 keynote entitled Engineering Mathematics: The Odd Order Theorem Proof, which will address his recent proof of the Feit-Thompson Theorem.<\/li>\n<li>Technologies and academic programs from Microsoft Research Connections for the greater research community.<\/li>\n<li>Five scientists from Microsoft Research are serving on the POPL program committee, including <a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" title=\"Josh Berdine\" href=\"http:\/\/research.microsoft.com\/en-us\/people\/jjb\/\" target=\"_blank\">Josh Berdine<span class=\"sr-only\"> (opens in new tab)<\/span><\/a> of Microsoft Research Cambridge; <a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" title=\"Sebastian Burckhardt\" href=\"http:\/\/research.microsoft.com\/en-us\/people\/sburckha\/\" target=\"_blank\">Sebastian Burckhardt<span class=\"sr-only\"> (opens in new tab)<\/span><\/a>, <a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" title=\"Manuel F&auml;hndrich\" href=\"http:\/\/research.microsoft.com\/en-us\/people\/maf\/\" target=\"_blank\">Manuel Fahndrich<span class=\"sr-only\"> (opens in new tab)<\/span><\/a>, and <a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" title=\"Francesco Logozzo\" href=\"http:\/\/research.microsoft.com\/en-us\/people\/logozzo\/\" target=\"_blank\">Francesco Logozzo<span class=\"sr-only\"> (opens in new tab)<\/span><\/a> of Microsoft Research Redmond; and <a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" title=\"Sriram Rajamani\" href=\"http:\/\/research.microsoft.com\/en-us\/people\/sriram\/\" target=\"_blank\">Sriram Rajamani<span class=\"sr-only\"> (opens in new tab)<\/span><\/a> of Microsoft Research India.<\/li>\n<li>The <a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" title=\"2012 Microsoft Research Verified Software Milestone Award\" href=\"https:\/\/sites.google.com\/site\/verifiedsoftwareinitiative\/\" target=\"_blank\">2012 Microsoft Research Verified Software Milestone Award<span class=\"sr-only\"> (opens in new tab)<\/span><\/a> will be presented to <a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" title=\"Xavier Leroy\" href=\"http:\/\/pauillac.inria.fr\/~xleroy\/\" target=\"_blank\">Xavier Leroy<span class=\"sr-only\"> (opens in new tab)<\/span><\/a> of the <a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" title=\"Paris-Rocquencourt\" href=\"http:\/\/www.inria.fr\/en\/centre\/paris-rocquencourt\" target=\"_blank\">Paris-Rocquencourt<span class=\"sr-only\"> (opens in new tab)<\/span><\/a> research center of <a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" title=\"Inria\" href=\"http:\/\/www.inria.fr\/en\/\" target=\"_blank\">Inria<span class=\"sr-only\"> (opens in new tab)<\/span><\/a>.<\/li>\n<\/ul>\n<p>The submitted papers from Microsoft Research cover a wide range of topics related to programming languages, and Bishop provides a preview.<\/p>\n<p>&ldquo;Two of the exciting results involve security and biology,&rdquo; she relates. &ldquo;Our researchers in Cambridge and Redmond worked with Inria to develop a compiler that guarantees the correctness for whole programs executing within arbitrary JavaScript browser contexts. They evaluated the compiler on sample programs, including a series of secure libraries.&rdquo;<\/p>\n<p>That paper&mdash;written by <a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" title=\"C&eacute;dric Fournet\" href=\"http:\/\/research.microsoft.com\/en-us\/um\/people\/fournet\/\" target=\"_blank\">C&eacute;dric Fournet<span class=\"sr-only\"> (opens in new tab)<\/span><\/a> of Microsoft Research Cambridge; <a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" title=\"Nikhil Swamy\" href=\"http:\/\/research.microsoft.com\/en-us\/people\/nswamy\/\" target=\"_blank\">Nikhil Swamy<span class=\"sr-only\"> (opens in new tab)<\/span><\/a>, <a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" title=\"Juan Chen\" href=\"http:\/\/research.microsoft.com\/en-us\/people\/juanchen\/\" target=\"_blank\">Juan Chen<span class=\"sr-only\"> (opens in new tab)<\/span><\/a>, and <a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" title=\"Benjamin Livshits\" href=\"http:\/\/research.microsoft.com\/en-us\/um\/people\/livshits\/\" target=\"_blank\">Benjamin Livshits<span class=\"sr-only\"> (opens in new tab)<\/span><\/a> of Microsoft Research Redmond; Pierre-Evariste Dagand of Scotland&rsquo;s University of Strathclyde; and Pierre-Yves Strub of the Madrid Institute for Advanced Studies in Software Development Technologies&mdash;is entitled <em><a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" title=\"<em>Fully Abstract Compilation to JavaScript<\/em>&#8221; href=&#8221;http:\/\/research.microsoft.com\/pubs\/176601\/js-star.pdf&#8221; target=&#8221;_blank&#8221;>Fully Abstract Compilation to JavaScript<span class=\"sr-only\"> (opens in new tab)<\/span><\/a><\/em>.<\/p>\n<p>Another of the Microsoft Research co-authored papers is <em>Synthesis of Biological Models from Mutation Experiments<\/em>, by Ali Sinan K&ouml;ksal, Yewen Pu, Saurabh Srivastava, and Rastislav Bodik of the University of California, Berkeley; Nir Piterman of the University of Leicester; and <a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" title=\"Jasmin Fisher\" href=\"http:\/\/research.microsoft.com\/en-us\/people\/jfisher\/\" target=\"_blank\">Jasmin Fisher<span class=\"sr-only\"> (opens in new tab)<\/span><\/a> of Microsoft Research Cambridge.<\/p>\n<p>&ldquo;Diseases can be caused by perturbed gene and protein regulatory networks,&rdquo; Bishop explains. &ldquo;Experimental biologists are concerned about the correctness of their models. Unfortunately, turning informal maps of regulatory networks common in biological literature into executable models is laborious, because it involves explicitly defining timing delay and strength of how multiple proteins regulate each other.<\/p>\n<p>&ldquo;This paper develops techniques for synthesizing executable models from experimental observations and prior biological knowledge.&rdquo;<\/p>\n<p>The Try F# release, Viegas says, is a way to encourage those who work with programming-languages to sample the capabilities offered by F#.<\/p>\n<p>&ldquo;We want to entice the programming-language community to look in particular at the information-rich programming paradigm of F# 3.0,&rdquo; she says, &ldquo;and how we&rsquo;ve made it easy to bring data and metadata from big, broad data to the fingertips of the programmer. Try F# includes great tutorials to help programmers and data scientists learn about this new paradigm, try it out with code creation in record time, and be able to share the experience and code with the community.&rdquo;<\/p>\n<p>Gonthier, meanwhile, will share insights on his proof of the Feit-Thompson Theorem, achieved in part with the Coq proof assistant, developed at the <a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" target=\"_blank\" href=\"http:\/\/www.msr-inria.inria.fr\/\">Microsoft Research-Inria Joint Centre<span class=\"sr-only\"> (opens in new tab)<\/span><\/a>, based in Palaiseau, outside of Paris.<\/p>\n<p>The theorem, also known as the Odd-Order Theorem, states that in mathematical group theory, every finite group of odd order is solvable. The proof has significant applicability to computer science, because group theory is the base for most cryptography schemes.<\/p>\n<p>During a plenary session, the Microsoft Research Verified Software Milestone Award was presented to Leroy to recognize his role as architect of the <a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" title=\"CompCert C Verified Compiler\" href=\"http:\/\/compcert.inria.fr\/compcert-C.html\" target=\"_blank\">CompCert C Verified Compiler<span class=\"sr-only\"> (opens in new tab)<\/span><\/a>, as well as for his leadership of that development team. The <a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" rel=\"noopener noreferrer\" title=\"CompCert\" href=\"http:\/\/compcert.inria.fr\/\" target=\"_blank\">CompCert<span class=\"sr-only\"> (opens in new tab)<\/span><\/a> project investigates the formal verification of realistic compilers usable for critical embedded software, and Leroy&rsquo;s contribution is a high-assurance compiler for almost all of the ISO C90\/ANSI C language, generating efficient code for PowerPC, ARM, and x86 processors.<\/p>\n<p>&ldquo;Microsoft Research is delighted to celebrate the advances made by Dr. Leroy in the vital field of software verification,&rdquo; Bishop says. &ldquo;Compilers are the basis for all the software we generate, and by ruling out compiler-introduced bugs, the CompCert project has taken a huge leap in strengthening guarantees for reliable, critical embedded software across platforms.<\/p>\n<p>&ldquo;We congratulate Dr. Leroy on his significant achievement in winning this award.&rdquo;<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Posted by Rob Knies The Symposium on Principles of Programming Languages (POPL) is an annual gathering of thought leaders from around the world to discuss all aspects of programming languages and systems, so it is a given that as the 40th instance of the event gets under way in Rome on Jan. 23, Microsoft Research [&hellip;]<\/p>\n","protected":false},"author":0,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"msr-url-field":"","msr-podcast-episode":"","msrModifiedDate":"","msrModifiedDateEnabled":false,"ep_exclude_from_search":false,"_classifai_error":"","msr-author-ordering":[],"msr_hide_image_in_river":0,"footnotes":""},"categories":[1],"tags":[200355,200631,194884,187184,201001,201003,195178,201211,195525,193543,201565,201625,201651,195683,193671,196016,202273,202283,196077,196274,202541,196435,196439,193526,196463,196468,196479,203057,203067,203209,203285,203287,203309,203401,203405,203481,196993,203671,203723,203997,204125,204127,204285,193634,204399,204427,187221,197836,204731],"research-area":[],"msr-region":[],"msr-event-type":[],"msr-locale":[268875],"msr-post-option":[],"msr-impact-theme":[],"msr-promo-type":[],"msr-podcast-series":[],"class_list":["post-234","post","type-post","status-publish","format-standard","hentry","category-research-blog","tag-ali-sinan-kksal","tag-benjamin-livshits","tag-cdric-fournet","tag-c","tag-compcert","tag-compcert-c-verified-compiler","tag-coq","tag-data-driven-functional-programming-workshop","tag-evelyne-viegas","tag-f","tag-feit-thompson-theorem","tag-francesco-logozzo","tag-fully-abstract-compilation-to-javascript","tag-georges-gonthier","tag-inria","tag-jasmin-fisher","tag-josh-berdine","tag-juan-chen","tag-judith-bishop","tag-madrid-institute-for-advanced-studies-in-software-development-technologies","tag-manuel-fahndrich","tag-microsoft-research-cambridge","tag-microsoft-research-connections","tag-microsoft-research-india","tag-microsoft-research-redmond","tag-microsoft-research-verified-software-milestone-award","tag-microsoft-research-inria-joint-centre","tag-nikhil-swamy","tag-nir-piterman","tag-paris-rocquencourt","tag-pierre-evariste-dagand","tag-pierre-yves-strub","tag-popl","tag-programming-languages-and-tools","tag-programming-principles-and-tools","tag-rastislav-bodik","tag-research-in-software-engineering","tag-saurabh-srivastava","tag-sebastian-burckhardt","tag-sriram-rajamani","tag-symposium-on-principles-of-programming-languages","tag-synthesis-of-biological-models-from-mutation-experiments","tag-titled-engineering-mathematics-the-odd-order-theorem-proof","tag-try-f","tag-university-california-berkeley","tag-university-of-strathclyde","tag-windows","tag-xavier-leroy","tag-yewen-pu","msr-locale-en_us"],"msr_event_details":{"start":"","end":"","location":""},"podcast_url":"","podcast_episode":"","msr_research_lab":[],"msr_impact_theme":[],"related-publications":[],"related-downloads":[],"related-videos":[],"related-academic-programs":[],"related-groups":[],"related-projects":[],"related-events":[],"related-researchers":[],"msr_type":"Post","byline":"","formattedDate":"January 22, 2013","formattedExcerpt":"Posted by Rob Knies The Symposium on Principles of Programming Languages (POPL) is an annual gathering of thought leaders from around the world to discuss all aspects of programming languages and systems, so it is a given that as the 40th instance of the event&hellip;","locale":{"slug":"en_us","name":"English","native":"","english":"English"},"_links":{"self":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/posts\/234","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/types\/post"}],"replies":[{"embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/comments?post=234"}],"version-history":[{"count":1,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/posts\/234\/revisions"}],"predecessor-version":[{"id":261711,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/posts\/234\/revisions\/261711"}],"wp:attachment":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/media?parent=234"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/categories?post=234"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/tags?post=234"},{"taxonomy":"msr-research-area","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/research-area?post=234"},{"taxonomy":"msr-region","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-region?post=234"},{"taxonomy":"msr-event-type","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-event-type?post=234"},{"taxonomy":"msr-locale","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-locale?post=234"},{"taxonomy":"msr-post-option","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-post-option?post=234"},{"taxonomy":"msr-impact-theme","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-impact-theme?post=234"},{"taxonomy":"msr-promo-type","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-promo-type?post=234"},{"taxonomy":"msr-podcast-series","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-podcast-series?post=234"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}