Sort search results in order of relevance, where relevance =
a) better if 0 premises for intro or 1 premise for elim/dest rules
b) better if substitution size wrt to current goal is smaller
Only applies to intro, dest, elim, and simp
(contributed by Rafal Kolanski, NICTA)
#!/usr/bin/env bash
#
# $Id$
# Author: Markus Wenzel, TU Muenchen
#
# DESCRIPTION: fix theorem names related to SOME (Eps) in HOL
## diagnostics
PRG="$(basename "$0")"
function usage()
{
echo
echo "Usage: $PRG [FILES|DIRS...]"
echo
echo " Recursively find .thy/.ML files, fixing theorem names related"
echo " to SOME (Eps) in HOL."
echo
echo " Renames old versions of FILES by appending \"~~\"."
echo
exit 1
}
## process command line
[ "$#" -eq 0 -o "$1" = "-?" ] && usage
SPECS="$@"; shift "$#"
## main
#set by configure
AUTO_PERL=perl
find $SPECS \( -name \*.ML -o -name \*.thy \) -print | \
xargs "$AUTO_PERL" -w "$ISABELLE_HOME/lib/scripts/fixsome.pl"