Entry Leivant:1993:FFA 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{Leivant:1993:FFA,
author = "Daniel Leivant",
title = "Functions over free algebras definable in the simply
typed lambda calculus",
journal = j-THEOR-COMP-SCI,
volume = "121",
number = "1--2",
pages = "309--321",
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=1525",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Comput. Sci., Indiana Univ., Bloomington, IN,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Bohm-Berarducci embedding; free algebras; functions;
iteration-with-parameters; lambda calculus; predicative
monotonic recurrence; predicativity condition; simply
typed lambda calculus; tiered monotonic recurrence;
Turing machines",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- condition,
70(1)35,
70(1)151,
70(2)179,
72(1)27,
74(1)3,
75(1)111,
83(1)57,
83(2)189,
86(1)81,
86(2)233,
87(2)315,
88(2)269,
93(2)185,
93(2)227,
93(2)279,
94(1)101,
94(1)141,
94(2)335,
95(2)307,
97(1)143,
97(2)233,
100(1)157,
100(2)267,
100(2)325,
103(1)39,
105(1)7,
109(1)181,
110(1)1,
111(1)89,
112(1)145,
112(2)413,
113(1)93,
118(2)301,
120(1)69,
120(2)197,
126(2)183,
129(1)123,
131(2)271,
132(1)259
- definable,
82(2)409,
88(1)139,
115(1)131,
126(1)53
- embedding,
77(3)267,
88(1)151,
97(2)263,
106(2)265,
112(2)419,
119(2)331,
134(1)87,
136(2)507
- free,
70(2)179,
71(2)265,
72(1)65,
73(1)81,
73(3)335,
74(1)3,
74(2)121,
78(2)319,
79(1)227,
79(1)241,
86(2)233,
92(1)77,
92(2)249,
92(2)269,
94(2)199,
94(2)367,
97(1)67,
97(2)301,
98(1)5,
98(1)79,
98(1)115,
99(2)231,
100(1)67,
100(2)267,
101(2)161,
102(1)185,
103(1)25,
103(1)51,
108(1)z,
112(2)311,
115(2)359,
116(2)421,
117(1)91,
117(1)217,
119(2)363,
123(2)427,
125(2)167,
126(2)237,
134(1)3,
134(1)107,
134(1)209,
134(2)537
- lambda,
70(1)35,
79(2)359,
79(2)365,
83(1)3,
83(1)29,
94(1)37,
102(1)135,
107(2)253,
107(2)333,
107(2)349,
110(2)249,
110(2)405,
111(1)3,
111(1)145,
114(2)273,
115(1)107,
121(1)59,
121(1)71,
121(1)145,
121(1)169,
121(1)279,
121(1)323,
121(1)351,
121(1)411,
121(1)441,
122(1)201,
126(2)281,
129(1)39,
129(1)79,
135(1)111,
135(2)423,
136(1)57,
136(1)125,
136(1)163,
136(1)183,
136(1)243,
136(1)277
- monotonic,
87(1)209,
100(2)365,
106(1)119
- predicative,
122(1)119
- recurrence,
82(1)85,
94(2)223,
106(2)183,
116(2)317,
129(2)263
- simply,
114(2)273,
121(1)169
- typed,
71(2)227,
83(1)29,
87(1)81,
91(1)23,
93(1)1,
110(2)249,
110(2)405,
111(1)3,
111(1)145,
111(1)z,
114(2)273,
120(1)45,
121(1)169,
121(1)411,
122(1)201,
135(1)5,
136(1)57,
136(1)125