Last update: Sun Apr 22 02:03:34 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{Embley:1978:TDF,
author = "David W. Embley",
title = "Teaching disciplined {Fortran} programming via
unfort",
journal = j-SIGCSE,
volume = "10",
number = "2",
pages = "34--38",
month = jun,
year = "1978",
CODEN = "SIGSD3",
DOI = "https://doi.org/10.1145/382186.382580",
ISSN = "0097-8418 (print), 2331-3927 (electronic)",
ISSN-L = "0097-8418",
bibdate = "Sun Nov 18 07:38:06 MST 2012",
bibsource = "http://portal.acm.org/;
http://www.math.utah.edu/pub/tex/bib/sigcse1970.bib",
abstract = "This short note describes UNFORT (University of
Nebraska FORTRAN), briefly mentions howit is used in
teaching disciplined FORTRAN programming, and announces
that a portable UNFORT preprocessor is available.",
acknowledgement = ack-nhfb,
fjournal = "SIGCSE Bulletin (ACM Special Interest Group on
Computer Science Education)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J688",
}
Related entries
- available,
2(4)41,
4(2)10,
5(1)21,
5(1)26,
5(1)48,
5(1)119,
5(1)166,
6(1)33,
7(1)51,
7(1)157,
8(1)100,
8(1)137,
8(1)167,
8(1)182,
8(1)266,
8(1)268,
8(1)289,
8(1)372,
8(3)15,
8(3)33,
8(3)93,
8(3)108,
8(3)111,
9(1)59,
9(1)85,
9(1)180,
9(3)10,
9(3)30,
10(1)32,
10(1)65,
10(1)179,
10(2)17,
10(3)35,
10(3)67,
11(1)158,
11(1)240
- briefly,
6(1)64,
8(1)371,
8(3)129,
10(1)65,
11(1)168
- describe,
2(3)118,
3(1)21,
4(1)110,
4(1)160,
5(1)24,
5(1)48,
5(1)77,
5(1)134,
5(1)166,
5(1)177,
6(1)15,
6(1)64,
6(1)79,
6(1)81,
6(1)101,
6(1)106,
6(1)148,
6(1)155,
6(1)165,
6(3)91,
7(1)31,
7(1)83,
7(1)86,
7(1)102,
7(1)133,
7(1)158,
7(1)191,
7(2)21,
7(2)67,
7(3)50,
7(4)53,
8(1)39,
8(1)104,
8(1)167,
8(1)182,
8(1)200,
8(1)236,
8(1)260,
8(1)289,
8(1)325,
8(1)335,
8(1)350,
8(1)359,
8(1)393,
8(2)11,
8(2)28,
8(3)33,
8(3)67,
8(3)78,
8(3)108,
9(1)1,
9(1)6,
9(1)26,
9(1)37,
9(1)63,
9(1)108,
9(1)113,
9(1)157,
9(1)178,
9(3)10,
9(3)28,
9(3)79,
9(4)88,
10(1)16,
10(1)35,
10(1)65,
10(1)178,
10(1)179,
10(1)224,
10(1)266,
10(3)73,
10(3)77,
10(3)100,
10(3)108,
10(3)140,
11(1)2,
11(1)22,
11(1)76,
11(1)82,
11(1)89,
11(1)155,
11(1)168,
11(1)207,
11(4)15,
11(4)31,
11(4)49
- disciplined,
7(3)38,
8(3)26,
9(1)123,
10(3)50
- Embley, David W.,
11(1)247
- FORTRAN,
2(3)118,
4(3)8,
5(1)21,
5(1)145,
5(1)166,
6(1)11,
6(1)37,
7(1)95,
7(1)129,
7(1)196,
7(1)206,
7(2)87,
7(3)38,
8(1)1,
8(1)11,
8(1)69,
8(1)275,
8(1)335,
8(3)39,
8(3)57,
8(3)67,
9(1)63,
9(1)88,
9(1)93,
9(1)123,
9(1)142,
9(1)157,
9(1)180,
9(3)1,
9(3)16,
9(3)56,
10(1)119,
10(1)260,
10(3)113,
11(1)45,
11(1)158,
11(1)247
- Fortran,
3(1)10,
3(4)24,
6(1)125,
6(4)21,
7(1)200,
7(4)47,
8(2)32,
8(2)45,
8(3)54,
8(3)78,
8(3)106,
8(4)6,
9(4)53,
9(4)63,
10(1)260,
10(3)93,
11(1)228
- Nebraska,
7(1)124,
9(1)180,
10(2)17,
10(2)59
- note,
2(3)118,
3(1)12,
3(3)15,
5(1)32,
6(1)81,
6(2)1,
6(4)1,
7(2)1,
7(4)44,
9(4)45,
9(4)57,
10(1)79,
10(3)27,
10(3)59,
10(3)80
- portable,
6(1)46,
10(4)30
- preprocessor,
7(1)196,
7(1)200,
7(1)206,
8(3)67,
10(3)120
- short,
5(1)38,
5(4)11,
6(1)74,
6(4)26,
7(1)158,
7(1)187,
8(1)96,
8(1)158,
9(1)31,
11(1)70