NET Pogramming Language Research @ MSR Cambridge Nick.ppt

  1. 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
  2. 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  3. 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
.NET Programming Language Research @ MSR Cambridge Nick Benton Microsoft Research Cambridge MSR Cambridge Programming Principles and Tools Group Luca Cardelli Nick Benton Cedric Fournet Andy Gordon Tony Hoare Andrew Kennedy Simon Peyton Jones Don Syme Simon Marlow Claudio Russo Mark Shields + visitors, PhD students, interns,… .NET in MSR Programming Principles and Tools Group Verifier spec (POPL) CLR design feedback Project 7 (Babel) SML.NET (ICFP,ICFP,HOOTS) Generics for C# and .NET (PLDI) Extended IL (Babel) Polyphonic C# (FOOL, ECOOP) Stack-Walking Security analysis (POPL) Assertions Part 1 SML.NET Nick Benton, Andrew Kennedy and Claudio Russo Advanced Programming Languages on the CLR .NET and the CLR provide a great opportunity for programming language designers and implementers: The runtime provides services (execution engine, garbage collection,…) which make producing a good implementation of your language easier The frameworks libraries mean you can actually do useful things with your new language (graphics, networking, database access, web services,…) Multi-language component-based programming makes it much more practical for other people to use your language in their own projects Our favourite language: Standard ML A safe, modular, strict, higher-order, functional, polymorphic programming language with compile-time type checking and type inference, garbage collection, exception handling, immutable data types, pattern-matching and updatable references, abstract data types, and parametric modules. with several efficient implementations and a formal definition with a proof of soundness. (Scheme+types+real syntax, Haskell with call by value evaluation) Some SML datatype order = LESS | GREATER | EQUAL datatype a Tree = Empty | Node of a * (a Tree) * (a Tree) fun contains compare (x, Empty) = false | contains compare (x, Node(v, left, right)) = (case compare (x,v) of LESS = contains compare (x,left) | GREATER = conta

文档评论(0)

书是爱的奉献 + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档