CIRCA Seminar 19th February 1pm
There will be a CIRCA lunchtime seminar on Thursday 19th February at 1pm in Maths Lecture Theatre C.
Edwin Brady and Yoav Len will speak.
Edwin’s Title: Efficient Type-checking of a Dependently Typed Programming Language
Edwin’s Abstract: Idris is a dependently typed programming language, which supports precise specification of programs and reasoning about their properties. It is developed in St Andrews (with many contributions from elsewhere) and used for research in programming language design and verified software development. While the compiler is, in most everyday cases, efficient enough (for example it is implemented in itself and compiles itself and its libraries within a few minutes) we have found that for a certain type of program, type-checking can be a significant bottleneck. In this talk I will briefly describe how a type-checker for a dependently typed language works, give a small example which illustrates the problem, and give an overview of a new design for the type-checker currently being implemented in a new version of Idris.
Yoav’s Title: The gonality sequence of graphs
Yoav’s Abstract: The talk will revolve around an invariant of graphs known as their gonality sequence. The invariant originates from algebraic geometry but is purely combinatorial, and controls much of the geometry of the graph. For instance, it can detect when a graph is a tree or has certain symemtries. In the talk I will introduce the invariant, survey recent developments, and discuss joint work with Šimun Dropuljić on a conjecture by Fessler-Jensen-Kelsey-Owen regarding the gonality sequence of a certain kind of graphs.
Details on the University Events as follows:- Centre for Interdisciplinary Research in Computational Algebra (CIRCA) seminar | Events