package coq-founify
Correctness and extraction of the unification algorithm
Install
Dune Dependency
Authors
Maintainers
Sources
v8.8.0.tar.gz
md5=41f09092e13a8bc95d4aa178ea3e3ad1
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.
On This Page