University of Cambridge > > Computer Laboratory Automated Reasoning Group Lunches > Proof-Producing Synthesis of ML from Higher-Order Logic

Proof-Producing Synthesis of ML from Higher-Order Logic

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact William Denman.

Theorem provers such as Coq, Isabelle/HOL, HOL4 , etc. provide mechanisms that print (sometimes called extract) functions from the logic into functions in real programming languages, e.g. ML or Haskell.

In this talk I’ll describe how this printing can be made into a trustworthy step. I’ll show how the translation from logic into a programming language can be automatically performed via proof—- a proof which states that the translation is semantics preserving with respect to the logic and an operational semantics of the target language, in our case a pure ML-like language.

The technique described in this talk applies to recursive functions, type variables, functions as first-class objects, user-defined datatypes, nested pattern matching and partiality, e.g. arising from missing cases in pattern matching.

This talk is part of the Computer Laboratory Automated Reasoning Group Lunches series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


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