Proof-Producing Synthesis of ML from Higher-Order Logic

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

• Magnus Myreen (University of Cambridge)
• Tuesday 13 March 2012, 13:00-14:00
• Computer Laboratory, William Gates Building, Room SS03.

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.

This talk is included in these lists:

• All Talks (aka the CURE list)
• Cambridge talks
• Computer Laboratory Automated Reasoning Group Lunches
• Computer Laboratory, William Gates Building, Room SS03
• Department of Computer Science and Technology talks and seminars
• Interested Talks
• School of Technology
• Trust & Technology Initiative - interesting events
• bld31
• yk373's list

Note that ex-directory lists are not shown.