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...
Zapisane w:
| Główni autorzy: | , , |
|---|---|
| Format: | Artigo |
| Język: | Inglês |
| Wydane: |
Logical Methods in Computer Science e.V.
2021-12-01
|
| Seria: | Logical Methods in Computer Science |
| Hasła przedmiotowe: | |
| Dostęp online: | https://lmcs.episciences.org/6919/pdf |
| Etykiety: |
Nie ma etykietki, Dołącz pierwszą etykiete!
|