package coq-founify
Correctness and extraction of the unification algorithm
Install
Dune Dependency
Authors
Maintainers
Sources
v8.9.0.tar.gz
md5=bef41f648bd5eed60a0aa2c8136be541
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