[ home
| schedule
| assignments
| projects
| resources
| handouts
| overview
| links
]
15-815 Automated Theorem Proving
Lecture 15: Unification with Parameters
Reading
After sketching the completeness proof for unification,
we consider the more general case of unification formulas including
universal quantifiers. This leads us to a version of unification
where existential variables are indexed by the parameters they
may depend on. We show an implementation of unification in this
style which takes advantage of mutable references in Standard ML.
Key Concepts
- Completeness of unification
- Termination of unification
- Parameter dependencies
- Destructive update and backtracking
Links
[ home
| schedule
| assignments
| projects
| resources
| handouts
| overview
| links
]
Frank Pfenning
fp@cs