Decidability of higher-order matching
From MaRDI portal
Publication:3395096
DOI10.2168/LMCS-5(3:2)2009zbMath1168.03314arXiv0907.3804MaRDI QIDQ3395096
Publication date: 20 August 2009
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0907.3804
Applications of game theory (91A80) Decidability of theories and sets of sentences (03B25) Combinatory logic and lambda calculus (03B40)
Related Items (5)
The Inverse Lambda Calculus Algorithm for Typed First Order Logic Lambda Calculus and Its Application to Translating English to FOL ⋮ Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility ⋮ An Improved Proof-Theoretic Compilation of Logic Programs ⋮ Functional programs as compressed data ⋮ Interactive Proving, Higher-Order Rewriting, and Theory Analysis in Theorema 2.0
This page was built for publication: Decidability of higher-order matching
