A Game-Theoretic Approach to Deciding Higher-Order Matching
From MaRDI portal
Publication:3591409
DOI10.1007/11787006_30zbMath1133.03315OpenAlexW2150133406MaRDI QIDQ3591409
Publication date: 11 September 2007
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://www.pure.ed.ac.uk/ws/files/18062882/Stirling_2006_A_Game_of_Theoretic_Approach_to_Deciding_Higher_Order_Matching.pdf
Applications of game theory (91A80) Decidability of theories and sets of sentences (03B25) Combinatory logic and lambda calculus (03B40)
Related Items (4)
Unification for $$\lambda $$ -calculi Without Propagation Rules ⋮ Dependency Tree Automata ⋮ Recognizability in the Simply Typed Lambda-Calculus ⋮ Model-Checking Games for Typed λ-Calculi
This page was built for publication: A Game-Theoretic Approach to Deciding Higher-Order Matching
