University of Dundee
Scottish Informatics and Computer Science Alliance
Engineering and Physical Sciences Research Council

Scottish Theorem Proving

7th October 2015, University of Dundee

The Scottish Theorem Proving Seminar (STP) will take place on the 7th October, 2015 at the Queen Mother Building, University of Dundee (travel information)

For details of previous meetings, see the STP homepage.

Invited speakers

Helle Hvid Hansen

Delft University of Technology, The Netherlands

Coinductive specification of k-regular sequences


Streams over a set A together with the head and tail operations are the standard representation of the final A × Id coalgebra. Perhaps less known is the fact that streams also form a final A × Id^k coalgebra, that is, a final deterministic automaton on a k-letter alphabet with output in A. In this talk, I will show how this final deterministic automaton of streams yields a coalgebraic characterisation of k-regular sequences, together with coinductive specification formats in the form of behavioural differential equations using the zip-operations.

(Joint work with Clemens Kupke, Jan Rutten and Joost Winter)

Henning Basold

Radboud University, The Netherlands

Using Coalgebras to Find the Productive Among the Lazy


In this talk, I will discuss how coalgebras can be used to establish equivalences and predicates for lazy programming languages, and how to use up-to techniques make the resulting proof methods tractable.

More specifically, we will use a variation of the copattern language introduced by Abel et al., and show how to characterise a notion of observational equivalence and productivity for this language. Moreover, we will introduce some interesting up-to techniques to simplify proofs of productivity. Finally, if time permits, we use these techniques to obtain decision procedures for a fragment of the language.

Chris Warburton

University of Dundee, Scotland

Scaling Theory Exploration in Haskell


We investigate the theory exploration (TE) paradigm for computer-assisted Mathematics and identify limitations and improvements for current approaches. Unlike the theorem-proving paradigm, which requires user-provided conjectures, TE performs an open-ended search for theorems satisfying given criteria. We see promise in TE for identifying new abstractions and connections in libraries of software and proofs, but realising this potential requires more scalable algorithms than presently used.

Charles Grellois

PPS & LIAFA labs, France

Coinductive semantics of linear logic and higher-order model-checking


A common approach in verification, model-checking consists in computing whether a given formula holds on an abstract model of interest. Decidability is usually obtained by standard reasoning on finite graphs overapproximating the behavior of programs.

The model-checking of functional programs requires however a careful treatment of higher-order computation, which is a major hurdle to the traditional abstraction of programs as finite graphs, and leads to the need for semantic methods.

In this talk, we explain how linear logic provides models of computation which can be very naturally extended to account for the model-checking problem of properties of monadic second-order logic, mixing inductive and coinductive specification, over infinite trees generated by the coinductive parallel head rewriting of a term with recursion.

This is joint work with my PhD advisor Paul-André Melliès.

Fredrik Nordvall Forsberg

University of Strathclyde, Scotland

The encode-decode method in HoTT, relationally


In Homotopy Type Theory (HoTT), the `encode-decode' method makes heavy use of explicit recursion over higher inductive types to construct, and prove properties of, homotopy equivalences. The idea is to construct an easier-to-understand family of codes describing some property of the homotopy equivalence in question, together with explicit encode and decode functions. The heart of the argument is then to show that encode and decode form an equivalence between the easy-to-understand codes and the desired property.

We argue for the classical separation between specification and implementation, and hence for using relations to track the graphs of encode/decode functions. Our aim is to isolate the technicalities of their definitions, arising from higher path constructors, from their properties.

We describe our technique in the calculation of the fundamental group of the circle, and comment on its applicability in the current Agda implementation of HoTT. (Joint work with James McKinna.)

Franck Slama

University of St Andrews, Scotland

Automatically proving equivalence by type-safe reflection


Dependently typed programming languages encourage us to index our inductive data types (like A:Type) over some indices (for instance, a Nat), in order to capture some properties (and A becomes of type Nat -> Type), as it is for example the case with vectors indexed over their length. But as soon as we start having indices, when defining functions, we run into the classical problem of producing a term of type (A n) when it is expected by the type checker to have type (A n'). Obviously, if the function is well defined, then the two indices n and n' should be equal (or somehow equivalent under certain axioms). But being equal doesn't mean that they are syntactically equal, and the type checker can't find the proof of equality on its own : it needs to be produced by hand by the user, usually leading to tons of proof obligations. If we want to encourage the writing of dependently typed data types and programs, we need to have some facilities for producing these proofs of equivalence automatically.

In this talk, I'll present this problem in the dependently typed programming language Idris on a little example, and then show how a specialised reflexive tactic can be easily constructed in Idris for this specific example. The implementation relies on a type safe reflection mechanism, where we represent Idris expressions in a reflected form (indexed over the original expression), from which we can pull out the proof easily. I will then show how this idea can be generalised for the various kind of properties (or axioms) that might be available (for example : associativity, commutativity, distributivity...), leading to a hierarchy of reflexive tactics for Monoids, Commutative Monoids, Groups, Rings and so on, written in Idris, for proving different kind of equivalences. I'll also show briefly show each tactic reuses the other ones from the simplest structures, thus avoiding as much as possible the duplication of code.

This is a joint work with Dr Edwin Brady.


12:00 - 13:00 Lunch
13:00 - 14:00 Helle Hvid Hansen
14:00 - 14:30 Henning Basold
14:30 - 15:00 Coffee
15:00 - 15:30 Chris Warburton
15:30 - 16:00 Charles Grellois
16:00 - 16:30 Coffee
16:30 - 17:00 Fredrik Nordvall Forsberg
17:00 - 17:30 Franck Slama
18:30 - Dinner at DCA


There are no registration fees, but we require all attendees to register by following this link. You can also contact the organisers .

All talk slots are now filled, many thanks to those who volunteered!