@book{LNCS2283,author={Tobias Nipkow and Lawrence Paulson and Markus Wenzel},
title="Isabelle/HOL --- A Proof Assistant for Higher-Order Logic",
publisher=Springer,series=LNCS,volume=2283,year=2002,
note={\url{http://www.in.tum.de/~nipkow/LNCS2283/}}}

@incollection{DBLP:conf/lics/GabbayP99,
	author    = {Murdoch Gabbay and
	Andrew M. Pitts},
	title     = {A New Approach to Abstract Syntax Involving Binders},
	booktitle = {{Logic in Computer Science (LICS)} 1999},
	pages     = {214--224},
	publisher = {{IEEE} Computer Society},
	year      = {1999},
	url       = {https://doi.org/10.1109/LICS.1999.782617},
}

@book{pitts_2013, place={Cambridge}, series={Cambridge Tracts in Theoretical Computer Science}, title={Nominal Sets: Names and Symmetry in Computer Science}, DOI={10.1017/CBO9781139084673}, publisher={Cambridge University Press}, author={Pitts, Andrew M.}, year={2013}, collection={Cambridge Tracts in Theoretical Computer Science}}

@inproceedings{DBLP:conf/cade/Popescu22,
	author    = {Andrei Popescu},
	editor    = {Jasmin Blanchette and
	Laura Kov{\'{a}}cs and
	Dirk Pattinson},
	title     = {Rensets and Renaming-Based Recursion for Syntax with Bindings},
	booktitle = {Automated Reasoning - 11th International Joint Conference, {IJCAR}
	2022, Haifa, Israel, August 8-10, 2022, Proceedings},
	series    = {Lecture Notes in Computer Science},
	volume    = {13385},
	pages     = {618--639},
	publisher = {Springer},
	year      = {2022},
	url       = {https://doi.org/10.1007/978-3-031-10769-6\_36},
	doi       = {10.1007/978-3-031-10769-6\_36},
	timestamp = {Mon, 24 Oct 2022 16:36:35 +0200},
	biburl    = {https://dblp.org/rec/conf/cade/Popescu22.bib},
	bibsource = {dblp computer science bibliography, https://dblp.org}
}
