History log of /seL4-l4v-master/HOL4/examples/generic_finite_graphs/gfgScript.sml
Revision Date Author Comments
# 12e8779a 26-Jul-2019 Michael Norrish <Michael.Norrish@nicta.com.au>

Fix generic_finite_graphs to properly record incoming edges

This has some knock-on effects in the examples/logic/ltl directory.


# 39d83b1d 17-Nov-2017 Simon Jantsch <simon.jantsch@gmail.com>

changes and additions to generic finite graph example


# 95153d40 14-Sep-2017 Simon Jantsch <simon.jantsch@gmail.com>

added pred_setTheory to gfg file


# 52f29020 14-Sep-2017 Simon Jantsch <simon.jantsch@gmail.com>

rename generated variables


# 3565631b 14-Sep-2017 Simon Jantsch <simon.jantsch@gmail.com>

shorter proof for addEdge_preserves_wfg


# 750f0a94 14-Sep-2017 Simon Jantsch <simon.jantsch@gmail.com>

Added addEdge and findNode functions to generic finite graphs


# a4f75265 22-Aug-2017 Michael Norrish <Michael.Norrish@nicta.com.au>

Make cosmetic change to gfg example


# f8c0a767 16-Aug-2017 Michael Norrish <Michael.Norrish@nicta.com.au>

Start an example theory about "generic finite graphs"

Inspired by Martin Erwig's functional graph library, the aim is to
make the functions as executable as possible.