package coq-founify

  1. Overview
  2. Homepage
Correctness and extraction of the unification algorithm

Install

Dune Dependency

Authors

Maintainers

Sources

v8.6.0.tar.gz
md5=69f9cc3b57d2c28b59790fc8ebffc478

Description

A notion of terms based on symbols without fixed arities is defined and an extended unification problem is proved solvable on these terms. An algorithm, close from Robinson algorithm, can be extracted from the proof.

Dependencies (2)

  1. coq >= "8.6" & < "8.7~"
  2. ocaml

Dev Dependencies

None

Used by

None

Conflicts

None

Rocq

Interactive Theorem Prover