University of Cambridge > Talks.cam > Computer Laboratory Programming Research Group Seminar > Higher-kinded programming in ML

  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

Higher-kinded programming in ML

Download to your calendar using vCal

If you have a question about this talk, please contact Raphael Proust .

Higher-kinded polymorphism —i.e. abstraction over type constructors— is an essential component of many functional programming techniques such as monads, folds, and embedded DSLs. ML-family languages typically support a form of abstraction over type constructors using functors, but the separation between the core language and the module language leads to awkwardness as functors proliferate.

We show how to express higher-kinded polymorphism in OCaml without functors, using an abstract type app to represent type application, and opaque brands to denote abstractable type constructors. We demonstrate the flexibility of our approach by using it to translate a variety of standard higher-kinded programs into functor-free OCaml code.

This talk is part of the Computer Laboratory Programming Research Group Seminar series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

SBR, St. John's College Average on weekdays: 9051.09379845 kWh farmasiz

Other talks

Tea and Coffee Break Morning Break The spread of environmental cost-benefit analysis in UK government, c.1966-1995: representing the public in the Anthropocene Scattering Plenty: the people who made the modern countryside The Neurophenomenology of Surrender: Agency, Renewal, and Social Engagement in Speaking in Tongues Group Work
 

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