Lambda Logic

Lambda Logic. Beeson, M. In Basin, D. & Rusinowitch, M., editors, Automated Reasoning, of Lecture Notes in Computer Science, pages 460–474, Berlin, Heidelberg, 2004. Springer.
doi abstract bibtex

Lambda logic is the union of first order logic and lambda calculus. We prove basic metatheorems for both total and partial versions of lambda logic. We use lambda logic to state and prove a soundness theorem allowing the use of second order unification in resolution, demodulation, and paramodulation in a first-order context.

@inproceedings{Beeson:2004,
	address = {Berlin, Heidelberg},
	series = {Lecture {Notes} in {Computer} {Science}},
	title = {Lambda {Logic}},
	isbn = {978-3-540-25984-8},
	doi = {10.1007/978-3-540-25984-8_34},
	abstract = {Lambda logic is the union of first order logic and lambda calculus. We prove basic metatheorems for both total and partial versions of lambda logic. We use lambda logic to state and prove a soundness theorem allowing the use of second order unification in resolution, demodulation, and paramodulation in a first-order context.},
	language = {en},
	booktitle = {Automated {Reasoning}},
	publisher = {Springer},
	author = {Beeson, Michael},
	editor = {Basin, David and Rusinowitch, Michaël},
	year = {2004},
	pages = {460--474},
}

Downloads: 0