Entry Hindley:1983:CTT from tcs1980.bib
Last update: Thu Sep 27 02:46:46 MDT 2018
Top |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@Article{Hindley:1983:CTT,
author = "R. Hindley",
title = "The completeness theorem for typing $\lambda$-terms",
journal = j-THEOR-COMP-SCI,
volume = "22",
number = "1--2",
pages = "1--17",
month = jan,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Math., Univ. Coll. of Swansea, Swansea, UK",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "combinatory logic; completeness theorem; Curry's
type-rules; formal logic; lambda-terms; semantics;
type-language; type-schemes",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- $\lambda$,
11(3)227
- combinatory,
22(1)127,
31(1)31,
31(1)151
- completeness,
10(1)93,
10(2)111,
11(1)1,
11(1)93,
11(3)277,
13(1)3,
14(1)113,
16(2)199,
21(1)105,
22(1)127,
24(3)291,
24(3)337,
28(1)215,
28(3)239,
29(3)309,
31(1)31
- Curry,
22(1)127,
28(1)151,
29(3)309
- Hindley, R.,
22(1)127
- lambda-terms,
22(1)127
- language, type-,
22(1)127
- rules, type-,
22(1)127
- schemes, type-,
22(1)127
- semantic,
11(2)181,
11(3)227,
12(1)19,
12(3)229,
13(1)3,
13(1)45,
13(2)193,
13(3)239,
14(3)305,
15(1)1,
15(2)159,
15(2)213,
15(3)223,
17(3)259,
18(1)1,
18(1)41,
18(2)149,
18(2)173,
19(1)69,
19(2)117,
20(2)95,
20(3)265,
22(1)19,
22(1)127,
23(1)11,
23(2)187,
24(1)73,
24(2)131,
25(2)95,
26(1)53,
26(1)121,
26(1)149,
27(1)225,
27(3)255,
27(3)297,
28(1)45,
29(1)167,
29(3)231,
31(1)49,
31(1)175,
31(3)263,
32(1)25,
32(1)121,
33(2)139,
33(2)195,
33(2)279,
34(1)33,
34(1)135,
34(3)289
- term,
13(3)331,
15(3)329,
24(1)73,
32(1)1,
33(2)139,
33(2)175,
34(1)33,
34(1)227
- terms, lambda-,
22(1)127
- theorem,
10(1)53,
10(3)317,
11(3)247,
11(3)277,
12(2)193,
12(3)291,
15(2)159,
16(2)223,
17(3)279,
18(3)259,
18(3)333,
20(2)95,
20(3)265,
21(1)75,
22(1)127,
23(1)1,
23(1)49,
23(1)91,
29(1)167,
31(1)41,
31(1)125,
32(1)47,
32(1)221,
32(3)297,
33(2)175,
34(1)3,
34(1)17
- type-language,
22(1)127
- type-rules,
22(1)127
- type-schemes,
22(1)127