Decidability of fourth-order matching
From MaRDI portal
Publication:4500172
DOI10.1017/S0960129500003108zbMath0954.03017MaRDI QIDQ4500172
Publication date: 14 February 2001
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
decidability; \(\lambda\)-calculus; lambda-definability; higher order unification; higher order matching
68N18: Functional programming and lambda calculus
03B25: Decidability of theories and sets of sentences
03B40: Combinatory logic and lambda calculus
Related Items