Decidability of fourth-order matching

DOI10.1017/S0960129500003108zbMath0954.03017MaRDI QIDQ4500172

Vincent Padovani

Publication date: 14 February 2001

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

zbMATH Keywords

decidability\(\lambda\)-calculuslambda-definabilityhigher order unificationhigher order matching

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Decidability of theories and sets of sentences (03B25) Combinatory logic and lambda calculus (03B40)

Related Items (6)

Unification for $$\lambda $$ -calculi Without Propagation Rules ⋮ Nominal syntax with atom substitutions ⋮ Decidability of bounded higher-order unification ⋮ Decidability of all minimal models ⋮ Dependency Tree Automata ⋮ Model-Checking Games for Typed λ-Calculi

This page was built for publication: Decidability of fourth-order matching