On Computing Constraint Abduction Answers
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Complete and decidable type inference for GADTs
Proceedings of the 14th ACM SIGPLAN international conference on Functional programming
A lean specification for GADTs: system F with first-class equality proofs
Higher-Order and Symbolic Computation
Abduction of linear arithmetic constraints
ICLP'05 Proceedings of the 21st international conference on Logic Programming
Outsidein(x) modular type inference with local assumptions
Journal of Functional Programming - Dedicated to ICFP 2009
Type processing by constraint reasoning
APLAS'06 Proceedings of the 4th Asian conference on Programming Languages and Systems
Heyting domains for constraint abduction
AI'06 Proceedings of the 19th Australian joint conference on Artificial Intelligence: advances in Artificial Intelligence
| Hi-index | 0.00 |
In this paper we explore abduction over the Herbrand domain . equations on the algebra of finite terms (or finite trees)1 . which is a central element of logic programming and first-order automated reasoning. This has some relevance to each of the above application areas: in evaluating queries when relations contain complex data such as records, lists and trees, as a concrete form of the key step in backward analysis, and as a view of type inference (type terms are exactly finite terms). However, this paper is a case study of constraint abduction in the Herbrand domain, and these applications will not be pursued further here. All the same, the direct relationship between Herbrand constraint abduction and type inference outlined above should make it easy to interpret the results of this paper in the context of type inference.