End of Internship Talk: F# Type Providers: DBpedia and the Combinator Framework

Add to your list(s) Download to your calendar using vCal

• Andrew Stevenson, PPT Intern
• Friday 05 September 2014, 10:30-11:00
• Small Lecture Theatre, Microsoft Research Ltd, 21 Station Road, Cambridge, CB1 2FB.

If you have a question about this talk, please contact Microsoft Research Cambridge Talks Admins.

This event may be recorded and made available internally or externally via http://research.microsoft.com. Microsoft will own the copyright of any recordings made. If you do not wish to have your image/voice recorded please consider this before attending

Wikipedia has become a knowledge repository for virtually every topic in existence, but its pages are intended to be read by humans, not computers. The DBpedia organisation has extracted much of this knowledge into an RDF -based entity graph format, and we introduce and demonstrate a type provider that brings this knowledge into the F# language in a strongly typed way. High quality type providers require a significant development effort. To address this we discuss an experimental framework to help build type providers compositionally from reusable components. In particular, we describe and demo a chaining combinator that links two or more existing type providers. A significant portion of this talk will be a live demo of the aforementioned type provider technologies.

This talk is part of the Microsoft Research Cambridge, public talks series.

This talk is included in these lists:

• All Talks (aka the CURE list)
• Cambridge Centre for Data-Driven Discovery (C2D3)
• Cambridge talks
• Chris Davis' list
• Guy Emerson's list
• Interested Talks
• Microsoft Research Cambridge, public talks
• Optics for the Cloud
• PMRFPS's
• School of Technology
• Small Lecture Theatre, Microsoft Research Ltd, 21 Station Road, Cambridge, CB1 2FB
• Trust & Technology Initiative - interesting events
• bld31
• ndk22's list
• ob366-ai4er
• personal list
• rp587

Note that ex-directory lists are not shown.