Eliminating Redundancy in Higher-Order Unification: A Lightweight Approach

DOI10.1007/11814771_32MaRDI QIDQ3613420zbMATH OpenOpenAlexFDO

Authors Brigitte Pientka

Publication date 12 March 2009

Published in Automated Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11814771_32

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35)

Recommendations

• Optimizing higher-order pattern unification.
• Redundancy elimination for LF
• Higher-order unification with dependent function types
• Theory and practice of minimal modular higher-order \(E\)-unification
• Logic Programming

Cited in

(1)

• Optimizing higher-order pattern unification.

Describes a project that uses

Uses Software

• PoplMark

This page was built for publication: Eliminating Redundancy in Higher-Order Unification: A Lightweight Approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3613420)