ML Anthology

Sub-Unification: A Tool for Efficient Induction of Recursive Programs

Stephane Lapointe, Stan Matwin
ICML 1992 pp. 273-281
doi:10.1016/B978-1-55860-247-2.50040-1 /icml/1992/lapointe1992icml-sub/
ICML Semantic Scholar

Cite

Text

Lapointe and Matwin. "Sub-Unification: A Tool for Efficient Induction of Recursive Programs." International Conference on Machine Learning, 1992. doi:10.1016/B978-1-55860-247-2.50040-1

Markdown

[Lapointe and Matwin. "Sub-Unification: A Tool for Efficient Induction of Recursive Programs." International Conference on Machine Learning, 1992.](https://mlanthology.org/icml/1992/lapointe1992icml-sub/) doi:10.1016/B978-1-55860-247-2.50040-1

BibTeX

@inproceedings{lapointe1992icml-sub,
  title     = {{Sub-Unification: A Tool for Efficient Induction of Recursive Programs}},
  author    = {Lapointe, Stephane and Matwin, Stan},
  booktitle = {International Conference on Machine Learning},
  year      = {1992},
  pages     = {273-281},
  doi       = {10.1016/B978-1-55860-247-2.50040-1},
  url       = {https://mlanthology.org/icml/1992/lapointe1992icml-sub/}
}