vampire-sys 0.5.2

Low-level FFI bindings to the Vampire theorem prover (use the 'vampire' crate instead)
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32

/*
 * This file is part of the source code of the software program
 * Vampire. It is protected by applicable
 * copyright laws.
 *
 * This source code is distributed under the licence found here
 * https://vprover.github.io/license.html
 * and in the source directory
 */
/**
 * @file EtaNormaliser.hpp
 */

#ifndef __EtaNormaliser__
#define __EtaNormaliser__

#include "Kernel/Term.hpp"

using namespace Kernel;

// reduce to eta short form
// normalises top down carrying out parallel eta reductions
// for terms such as ^^^.f 2 1 0
// WARNING Recursing lurks here (even during proof search!)
// This is BAD! However, an  (efficient) iterative implementation is tricky, so
// I am leaving for now.
namespace EtaNormaliser {
  TermList normalise(TermList t);
  TermList transformSubterm(TermList t);
}

#endif // __EtaNormaliser__