Entry Nielson:1990:FCM from tcs1990.bib
Last update: Wed Sep 26 02:11:46 MDT 2018
Top |
Symbols |
Numbers |
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{Nielson:1990:FCM,
author = "H. R. Nielson and F. Nielson",
title = "Functional completeness of the mixed
$\lambda$-calculus and combinatory logic",
journal = j-THEOR-COMP-SCI,
volume = "70",
number = "1",
pages = "99--126",
day = "15",
month = jan,
year = "1990",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:24:22 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Comput. Sci., Aarhus Univ., Denmark",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "binding times; combinator-based abstract machines;
combinatory logic; compile-time; formal logic;
functional languages; mixed lambda-calculus; run-time
computations",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- $\lambda$,
89(1)137,
110(2)249,
110(2)405,
121(1)169,
121(1)323,
121(1)351,
129(1)79,
136(1)277
- abstract,
70(2)193,
71(2)209,
75(3)223,
77(1)5,
77(1)195,
80(1)117,
81(1)117,
81(2)269,
82(2)389,
83(2)261,
87(1)43,
87(1)143,
87(1)163,
88(2)231,
90(1)61,
94(1)1,
94(1)63,
95(2)323,
96(1)217,
96(1)249,
96(1)z,
99(1)1,
100(2)267,
104(1)53,
104(1)89,
104(1)129,
104(2)235,
105(2)217,
109(1)225,
111(1)3,
111(1)191,
112(1)99,
115(1)77,
116(1)59,
118(2)231,
119(1)23,
121(1)113,
122(1)165,
124(1)93,
126(2)259,
129(2)337,
134(2)455,
135(2)267,
136(1)79,
136(1)109,
136(1)125,
136(1)163
- binding,
90(1)95,
112(1)99
- calculus, lambda-,
70(2)193,
71(2)227,
87(1)203,
89(1)137,
93(1)75,
96(1)217,
100(2)303,
102(1)1,
110(2)405,
121(1)169,
121(1)279,
121(1)411,
126(2)281,
129(1)79,
136(1)183
- combinatory,
70(2)193,
72(2)119,
72(2)z,
87(1)221,
97(1)157,
100(2)303,
110(2)419,
114(2)273,
121(1)279,
121(1)441,
135(2)405
- compile-time,
104(1)109
- completeness,
70(2)193,
71(1)155,
72(1)55,
72(2)133,
73(2)155,
73(2)177,
74(1)37,
74(2)227,
75(1)85,
75(1)111,
77(1)73,
79(2)295,
79(2)341,
80(2)303,
81(2)223,
83(1)71,
86(1)35,
86(1)81,
86(1)z,
87(1)203,
89(2)207,
91(2)181,
93(2)321,
94(1)101,
95(1)75,
95(1)97,
97(1)143,
97(2)199,
104(1)3,
105(2)167,
105(2)217,
109(1)7,
111(1)125,
114(2)231,
118(2)193,
119(1)127,
120(1)83,
122(1)97,
128(1)127,
129(1)143,
129(1)167,
130(2)239,
135(1)11,
135(2)405
- functional,
70(1)159,
70(2)193,
71(2)265,
71(2)z,
71(3)381,
72(2)133,
72(2)225,
72(2)z,
77(3)291,
79(1)179,
80(1)105,
81(1)117,
81(2)201,
83(1)57,
87(1)209,
91(1)23,
93(1)1,
93(1)75,
93(2)201,
96(1)73,
101(1)143,
102(1)135,
103(2)235,
104(1)129,
104(2)313,
105(2)167,
111(1)3,
116(1)59,
117(1)45,
118(2)231,
119(1)145,
121(1)113,
121(1)145,
121(1)411,
122(1)201,
122(1)263,
123(2)397,
124(1)127,
131(1)219,
132(1)1,
133(2)387,
135(1)5,
136(1)243
- lambda-calculus,
70(2)193,
71(2)227,
87(1)203,
89(1)137,
93(1)75,
96(1)217,
100(2)303,
102(1)1,
110(2)405,
121(1)169,
121(1)279,
121(1)411,
126(2)281,
129(1)79,
136(1)183
- mixed,
71(2)209,
71(2)z,
83(1)3,
90(1)47,
90(1)81,
103(2)311,
111(1)59,
114(1)63
- time, compile-,
104(1)109