@article{65abc40fcd0f46c5a851b7731efaa2e1,
title = "A general approach to define binders using matching logic",
keywords = "binders, completeness, conservative extension, matching logic",
author = "Xiaohong Chen and Grigore Rosu",
note = "Funding Information: We warmly thank the K Team for invaluable and continuous feedback on matching logic and its role as a foundation of K, as well as for their creative yet hard work on turning theoretical results into practical tools. We also warmly thank James Cheney, Maribel Fern{\'a}ndez, Andrei Popescu, and Thomas Tuegel for many insightful comments and concrete suggestions. We are indebted to the four anonymous reviewers, whose wit and dedication helped us improve the presentation. This work was supported in part by NSF CNS 16-19275. This material is based upon work supported by the United States Air Force and DARPA under Contract No. FA8750-18-C-0092. Publisher Copyright: {\textcopyright} 2020 Owner/Author.",
year = "2020",
month = aug,
day = "2",
doi = "10.1145/3408970",
language = "English",
volume = "4",
journal = "Proceedings of the ACM on Programming Languages",
issn = "2475-1421",
publisher = "Association for Computing Machinery (ACM)",
number = "ICFP",
}