University of Cambridge > Talks.cam > sb2743's list

sb2743's list

Add to your list(s) Send you e-mail reminders Further detail
Subscribe using ical/vcal (Help)

A personal list of talks.

Tell a friend about this list:

If you have a question about this list, please contact: Siddharth Bhat. If you have a question about a specific talk, click on that talk to find its organiser.

11 upcoming talks and 316 talks in the archive.

SANDWICH Seminar (Computer Laboratory)

Mixed Linear-Cartesian Theories as Substitution Monoids

UserSanjiv Ranchod (University of Cambridge).

HouseFS07, Computer Laboratory.

ClockMonday 25 November 2024, 13:00-14:00

Formalisation of mathematics with interactive theorem provers

Title to be confirmed

UserTobias Grosser (University of Cambridge).

HouseMR14 Centre for Mathematical Sciences.

ClockThursday 28 November 2024, 17:00-18:00

SANDWICH Seminar (Computer Laboratory)

Title to be confirmed

UserYulong Huang (University of Cambridge).

HouseFS07, Computer Laboratory.

ClockMonday 02 December 2024, 13:00-14:00

Formalisation of mathematics with interactive theorem provers

Title to be confirmed

UserYaël Dillies (Stockholm Universitet).

HouseMR14 Centre for Mathematical Sciences.

ClockThursday 05 December 2024, 17:00-18:00

Formalisation of mathematics with interactive theorem provers

Title to be confirmed

UserSiddharth Bhat (University of Cambridge).

HouseMR14 Centre for Mathematical Sciences.

ClockThursday 23 January 2025, 17:00-18:00

Formalisation of mathematics with interactive theorem provers

Title to be confirmed

UserEmily Riehl (Johns Hopkins University).

HouseMR14 Centre for Mathematical Sciences.

ClockThursday 30 January 2025, 17:00-18:00

Formalisation of mathematics with interactive theorem provers

Title to be confirmed

UserAndrei Popescu (University of Sheffield).

HouseMR14 Centre for Mathematical Sciences.

ClockThursday 06 March 2025, 17:00-18:00

Please see above for contact details for this list.

 

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