![]() NET with extensions for interlanguage working), Polyphonic C#/Cù (C# with join-calculus concurrency and XML/relational data constructs), monads and effect systems, models for dynamic allocation, and, most recently, mechanically formalized logics for reasoning about machine code programs. His thesis was on strictness analysis and he has since worked on topics that include term calculi and categorical models for linear logic, MLj and SML.NET (optimizing compilers from SML to the JVM and. His research ranges from proof theory and categorical logic, through semantics of programming languages and static analyses, to programming language design and compiler implementation. ![]() Nick Benton is a Researcher at Microsoft Research in Cambridge, working in the Programming Principles and Tools Group.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |