Now showing items 1-2 of 2

    • Automatic generation of proof terms in dependently typed programming languages 

      Slama, Franck (University of St Andrews, 2018-09-17) - Thesis
      Dependent type theories are a kind of mathematical foundations investigated both for the formalisation of mathematics and for reasoning about programs. They are implemented as the kernel of many proof assistants and ...
    • Verified programming with explicit coercions 

      Schwaab, Christopher (University of St Andrews, 2019-06-26) - Thesis
      Type systems have proved to be a powerful means of specifying and proving important program invariants. In dependently typed programming languages types can depend on values and hence express arbitrarily complicated p ...