Skip navigation
Skip navigation

(Nominal) Unification by Recursive Descent with Triangular Substitutions

Kumar, Ramana; Norrish, Michael

Description

Using HOL4, we mechanise termination and correctness for two unification algorithms, written in a recursive descent style. One computes unifiers for first order terms, the other for nominal terms (terms including α-equivalent binding structure). Both alg

CollectionsANU Research Publications
Date published: 2010
Type: Conference paper
URI: http://hdl.handle.net/1885/33461
Source: International Conference on Interactive Theorem Proving (ITP 2010) Proceedings
DOI: 10.1007/978-3-642-14052-5_6

Download

File Description SizeFormat Image
01_Kumar_(Nominal)_Unification_by_2010.pdf156.24 kBAdobe PDF    Request a copy


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  20 July 2017/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator