First-order unification by structural recursion

DOI10.1017/S0956796803004957zbMath1093.68561OpenAlexW1986121459WikidataQ56092432 ScholiaQ56092432MaRDI QIDQ3160301

Conor McBride

Publication date: 8 February 2005

Published in: Journal of Functional Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0956796803004957

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Related Items (6)

A unified treatment of syntax with binders ⋮ Auto in Agda ⋮ Unnamed Item ⋮ A library for polymorphic dynamic typing ⋮ Partiality and recursion in interactive theorem provers – an overview ⋮ Executable Relational Specifications of Polymorphic Type Systems Using Prolog

This page was built for publication: First-order unification by structural recursion