Combinatory Forms for Equational Programming: Instances, Unification and Narrowing.
Marco BelliaMichele BugliesiM. Eugenia OcchiutoPublished in: CAAP (1990)
Keyphrases
- equational theories
- theorem proving
- theorem prover
- programming language
- higher order
- programming environments
- computer programming
- automated theorem proving
- randomly generated
- training instances
- lower and upper bounds
- development environment
- object oriented programming
- test instances
- constraint satisfaction problems
- high level language
- knuth bendix
- multi class