Last update: Sun Oct 15 02:16:54 MDT 2017
@Article{Norrish:2006:MCU,
author = "Michael Norrish",
title = "Mechanising $\lambda$-calculus using a classical first
order theory of terms with permutations",
journal = j-HIGHER-ORDER-SYMB-COMPUT,
volume = "19",
number = "2--3",
pages = "169--195",
month = sep,
year = "2006",
CODEN = "LSCOEX",
DOI = "https://doi.org/10.1007/s10990-006-8745-7",
ISSN = "1388-3690 (print), 2212-0793 (electronic)",
ISSN-L = "1388-3690",
bibdate = "Wed Jul 9 12:34:44 MDT 2008",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=1388-3690&volume=19&issue=2;
http://www.math.utah.edu/pub/tex/bib/higherordersymbcomput.bib",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=1388-3690&volume=19&issue=2&spage=169",
acknowledgement = ack-nhfb,
journal-URL = "http://link.springer.com/journal/10990",
}