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...
Αποθηκεύτηκε σε:
| Κύριοι συγγραφείς: | , , |
|---|---|
| Μορφή: | Artigo |
| Γλώσσα: | Inglês |
| Έκδοση: |
Logical Methods in Computer Science e.V.
2021-12-01
|
| Σειρά: | Logical Methods in Computer Science |
| Θέματα: | |
| Διαθέσιμο Online: | https://lmcs.episciences.org/6919/pdf |
| Ετικέτες: |
Δεν υπάρχουν, Καταχωρήστε ετικέτα πρώτοι!
|