Thank you to the speakers who delivered such interesting talks, all of the organisers that helped keep the conference running smoothly, and every one of you for coming!

Just like last year, we’ve uploaded talk resources and kept them below.

We hope to see you again next year!

Description

TRIPLE (Theory, Related Interdisciplinary & Programming Languages at Edinburgh) is our annual TypeSig conference: one day full of research talks designed for students! The talks will be given by speakers from renowned institutions in the UK and will be organised in two parallel tracks. You can choose to attend talks from both tracks:

• Track A: Programming Languages, Type Systems, Theorem Proving and more.
• Track B: Compilers, Formal Verification, AI, and more.

Researchers working on the cutting-edge will introduce advancements in their fields to you! The conference is suitable for both undergraduates and early-state researchers. What’s more, you get to meet and talk to the academics after their talks and find peers that are interested in interesting things!

Details

Date: Sunday, 29th of March, 2026
Location: James Clerk Maxwell Building (JCMB), University of Edinburgh
Time: 9:50 AM - 5:30 PM

Tickets

Purchase here!

Schedule

Expected Audience

TRIPLE is the culmination of sustained student interest in PL research over the past few years. We aim to expose more undergraduate and graduate students to PL through a day of academic talks delivered by researchers in the field. The intended audience is primarily undergraduate students with some prior exposure to PL through functional programming, although anyone is welcome to attend.

Based on the successful precedent of TUPLES 2025 (our last year’s conference), as well as TypeSig’s previous events this year, we expect TRIPLE 2026 to attract significant attention from the student body in and outwith the the School of Informatics at the University of Edinburgh.

Photos

Sponsors

Thank you to all the speakers, the attendees and the organisers that made the conference happen!

We have uploaded the slides of the talks in the schedule section. The recordings will appear in the same place shortly. Also, the photos from the event will appear at the bottom of the page.

Description

TUPLES (Theory Union Programming Languages at Edinburgh Successor) is our annual TypeSig conference: one day full of research talks designed for students! The talks will be given by 12 speakers from renowned institutions in the UK and will be organised in two parallel tracks. You can choose to attend talks from both tracks:

• Track A: algorithmic game theory, complexity theory, cryptography and more.
• Track B: principles of programming languages, type theory, formal verification, compilers, and more.

Academics working on the cutting-edge will introduce advancements in their fields to you! Both undergraduates and early stage researchers should find it useful. What’s more, you get to meet and talk to academics after their talks and find peers that are interested in interesting things!

Details

Date: Sunday, 23rd of February 2025
Location: Nucleus Building, University of Edinburgh
Time: 10:00 AM - 5:30 PM

Schedule

Expected Audience

TUPLES is the culmination of sustained student interest in PL research over the past few years. We aim to expose more undergraduate and graduate students to PL through a day of academic talks delivered by researchers in the field. The intended audience is primarily undergraduate students with some prior exposure to PL through functional programming, although anyone is welcome to attend.

Based on the successful precedent of TUPLE 2024 (our last year’s conference) as well as TypeSig’s previous events this year, we expect TUPLES 2025 to attract significant attention from the student body in and outwith the the School of Informatics at the University of Edinburgh.

Photos

Sponsors

We are grateful to the academics who supplied problems for us this year, and will credit them individually at the beginning of each problem when they are published. We also thank Dr Liam O’Connor for supplying the web infrastructure from last year’s version of the event.

Each day from the 12th of December to the 25th, we release a new theorem that you must formalise and prove using either Agda or Lean. Depending on how fast you solve it (from first opening the question), how many hints you used, and a secret third metric, you will score a glorious place on the leaderboard! The challenges are aimed at beginners/intermediates, with some basic experience with using Agda/Lean already.

You must have a Discord account to authenticate with the site. This is used for scoring and leaderboard purposes. We also have a discussion channel for the competition in our Discord server, so feel free to join in the discussion over there!

Good luck and have fun!

We’re returning in full swing this academic year with some new faces, as well as some familiar ones! The Lean 4 workshops, co-hosted by us and MathsSoc, are continuing this year on Mondays from 5pm-7pm. Alex Brodbelt is kindly giving a talk at the beginning of each workshop, so definitely come along to develop your Lean skills!

We’re also proud to announce a brand new, all-TypeSig workshop on making your own programming language interpreter! This is fully self paced, and the materials can be found on our new resources page. We’re running workshop sessions every Friday from 4pm-6pm, where you can get further advice and assistance if you need it.

Of course, our pub socials on Sundays at the Dagda bar continue as per usual. See you there each week from 7pm!

We have some more exciting events in the works, so keep tuned to the announcements channel on our Discord server, as per usual.

TypeSig <3 you!

The conference is scheduled to take place on the 21st February, 2024 at the Informatics Forum, 10 Crichton Street, Edinburgh, EH8 9AB.

The conference is over! Many thanks to everyone who attended!

Schedule

Talks

• Dr Conor McBride, Strathclyde: Dependent types
• Dr Bob Atkey, Strathclyde: Denotational semantics
• Dr Julian Bradfield, Edinburgh: Model checking
• Dr Paul Jackson, Edinburgh: Proof presentation in theorem provers (with a focus on Lean!)
• Tang Wenhao, Edinburgh: Soundly handling linearity (POPL 2024 Distinguished Paper!)
• Jad Ghalayini, Cambridge: Compiler optimisation and category theory

Expected Audience

TUPLE is the culmination of sustained student interest in PL research over the past few years. We aim to expose more undergraduate and graduate students to PL through a day of academic talks delivered by researchers in the field. The intended audience is primarily undergraduate students with some prior exposure to PL through functional programming, although anyone is welcome to attend.

Based on the successful precedent of PwnEd 2023 (a cybersecurity conference run by SIGINT, another CompSoc SIG) as well as TypeSig’s previous events this year, we expect TUPLE to attract significant attention from the student body in and outwith the the School of Informatics at the University of Edinburgh.

Pictures!

TypeSig is proud to announce a new Advent of Code style competition, called Advent of Proof! Click here to join in!

Each day from the 1st of December to the 25th, we release a new theorem that you must formalise and prove using either Agda or Lean. Depending on how fast you solve it (from first opening the question), how many hints you used, and a secret third metric, you will score a glorious place on the leaderboard! The challenges are aimed at beginners/intermediates, with some basic experience with using Agda/Lean already.

You must have a Discord account to authenticate with the site. This is used for scoring and leaderboard purposes. We also have a discussion channel for the competition in our Discord server, so feel free to join in the discussion over there!

Good luck and have fun!

Our speaker was Prof. Philip Wadler, who needs no introduction. One of the principal designers of Haskell, Phil is a beloved lecturer here in Edinburgh, and was kind enough to give an introductory talk on formalising the lambda calculus in Lean 4. He covered basic proof techniques in Lean for those who had not seen them, then went on to give a brief representation of terms, and ended with a proof that 2+2=4.

Thanks to everyone who came, and special thanks to Phil in particular.

Our first speaker was Anton Lorenzen, who gave a talk on in-place functional programming, allowing a compiler to generate code for balancing trees (and otherdata structure manipulations) as efficient as a C implementation, wihle still having all the nice properties of an implementation in a strongly-typed functional language (Koka).

After pizza and mingling, John Baez gave a talk on applied category theory. This talk covered: the general concept of applied category theory; its history (arising from Lawvere’s functorial semantics and quantum physics’ Feynmann diagrams); work done by people in his group and elsewhere over the past two decades; the stock-flow tooling that his colleagues have been working on recently; and a new project he’s leading in the Fields Institute on applying category theory to help model human responses to climate change.

We’re proud to have had such a successful first talk run entirely by ourselves, and hope that you all join us for next week’s talk by Phil Wadler!

A massive thanks to everyone who came, and special thanks to the School of Maths for organising the talk, and to Kevin Buzzard, who gave a second talk on his Natural Number Game, which we’ve been following in our Lean workshops for the past month.

Lean is a dependently-typed proof assistant, with a lot of community support to make it as easy as possible to write mathematical proofs in a machine-verifiable manner. Our two hour sessions are a place to learn about proof assistants, and to get some practical experience with Lean and mathlib4.

Sessions take place every Thursday in AT5.04, from 5pm to 7pm. We’re planning to have academic talks every other week, starting from the 5th of October (next week!). Be sure to keep an eye on our Discord for announcements of these!