A Game-Theoretic Approach to Deciding Higher-Order Matching

DOI10.1007/11787006_30MaRDI QIDQ3591409zbMATH OpenOpenAlexFDO

Authors Colin Stirling

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

zbMATH Keywords

Gameshigher-order matchingtyped lambda calculus

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Combinatory logic and lambda calculus (03B40) Applications of game theory (91A80)

Cited in

(5)

• Model-checking games for typed -calculi
• Unification for -calculi without propagation rules
• Dependency Tree Automata
• Recognizability in the Simply Typed Lambda-Calculus
• Matching with slot-specific priorities: Theory

This page was built for publication: A Game-Theoretic Approach to Deciding Higher-Order Matching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3591409)