University of Cambridge > Talks.cam > Microsoft Research Cambridge, public talks > Executable Relational Specifications of Polymorphic Type Systems using Prolog

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

Executable Relational Specifications of Polymorphic Type Systems using Prolog

Download to your calendar using vCal

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

A declarative and machine executable specification of the Hindley–Milner type system (HM) can be formulated using a logic programming language. Modern functional language implementations such as the GHC supports more advanced polymorphism beyond HM. We progressively extended the HM specification to include more features. We will contemplate on the lessons from this case study and discuss plans on the TIPER project.

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

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

SIAM-IMA Cambridge Student Chapter Bateman Room, Gonville & Caius College Faculty of Education, 184 Hills Road, Cambridge, CB2 8PQ, (Rm GS5), Donald McIntyre Building)

Other talks

Title TBC Title to be confirmed A Novel Diffusion Model based Approach for Sleep Music Generation Cambridge Reading Group on Reproduction: Professor Sara Brill Title to be confirmed Grand Rounds - Equine
 

© 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity