Last update: Wed Sep 26 02:11:46 MDT 2018
@Article{Statman:1993:SEN, author = "Rick Statman", title = "Some examples of non-existent combinators", journal = j-THEOR-COMP-SCI, volume = "121", number = "1--2", pages = "441--448", day = "06", month = dec, year = "1993", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Mon Jul 19 22:17:45 MDT 1999", bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1993&volume=121&issue=1-2; http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1993&volume=121&issue=1-2&aid=1519", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4210 (Formal logic)", corpsource = "Carnegie Mellon Univ., Pittsburgh, PA, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "combinatorial mathematics; combinatory logic; hyperrecurrent combinators; lambda calculus; nonexistent combinators; recurrent combinators; universal generators", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", }