Last update: Thu Sep 27 02:46:57 MDT 2018
@Article{Leivant:1986:TCP,
author = "D. Leivant",
title = "Typing and computational properties of lambda
expressions",
journal = j-THEOR-COMP-SCI,
volume = "44",
number = "1",
pages = "51--68",
month = "????",
year = "1986",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4210 (Formal
logic)",
corpsource = "Dept. of Comput. Sci., Carnegie-Mellon Univ.,
Pittsburgh, PA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "calculus; combinatorial mathematics; computational
properties; expressions; formal logic; lambda
-Calculus; lambda expressions; normalizability;
second-order typing; semantic properties; solvability;
strong normalizability",
pubcountry = "Netherlands A03",
treatment = "T Theoretical or Mathematical",
}