Efficient Full Higher-Order Unification
We developed a procedure to enumerate complete sets of higher-order unifiers based on work by Jensen and Pietrzykowski. Our procedure removes many redundant unifiers by carefully restricting the search space and tightly integrating decision procedures for fragments that admit a finite complete set o...
| 發表在: | Logical Methods in Computer Science |
|---|---|
| Main Authors: | , , |
| 格式: | Article |
| 語言: | 英语 |
| 出版: |
Logical Methods in Computer Science e.V.
2021-12-01
|
| 主題: | |
| 在線閱讀: | https://lmcs.episciences.org/6919/pdf |