Entry Lester:1993:ESH from ijhsc.bib
Last update: Sun Oct 15 02:21:07 MDT 2017
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{Lester:1993:ESH,
author = "D. R. Lester and G. L. Burn",
title = "An Executable Specification of the {HDG}-Machine",
journal = j-INT-J-HIGH-SPEED-COMPUTING,
volume = "5",
number = "3",
pages = "327--378",
month = sep,
year = "1993",
CODEN = "IHSCEZ",
ISSN = "0129-0533",
ISSN-L = "0129-0533",
bibdate = "Mon Feb 25 11:19:26 MST 2002",
bibsource = "ftp://ftp.ira.uka.de/bibliography/Compiler/Functional.bib;
ftp://ftp.ira.uka.de/bibliography/Parallel/parallel.functional.programming.bib;
http://www.math.utah.edu/pub/tex/bib/ijhsc.bib; OCLC
Article1st database",
abstract = "The name HDG-machine stands for highly distributed
G-machine, and is an abstract machine for the execution
of lazy functional languages. It is highly distributed
because the graph, which represents the state of the
computation of the program, is distributed over the
processors which make up the machine. In theory, such a
machine is extensible to any size. The G-machine part
of the name comes from the fact that it is based on the
G-machine (`graph machine'), an abstract machine for
the sequential implementation of lazy functional
languages. This paper serves a dual purpose. Firstly it
is a specification of a distributed memory parallel
reduction machine to evaluate lazy functional
languages. Being a Miranda script, it is also an
executable specification. Secondly, it is an example of
a large functional program (of the order of 2000 lines)
which performs a nontrivial task, simulating a parallel
machine. The program has been written using the
`inverse comment convention', where all lines of
program text start with a right-parenthesis symbol.",
acknowledgement = ack-nhfb,
fjournal = "International Journal of High Speed Computing
(IJHSC)",
journal-URL = "http://www.worldscientific.com/worldscinet/ijhsc",
keywords = "functional parallel",
}
Related entries
- abstract,
4(4)313,
5(2)171
- all,
5(2)171
- based,
2(2)117,
4(4)313,
9(1)13,
11(4)203
- computation,
5(2)171,
5(3)307,
6(2)183,
6(2)325,
6(4)501,
9(3)181,
11(1)15,
11(3)129,
12(1)1
- distributed,
2(1)49,
4(2)87,
4(2)143,
4(3)179,
5(4)595,
6(4)475,
6(4)519,
7(1)125,
7(2)161,
8(1)47,
8(4)363,
9(2)127,
10(1)83,
10(2)185,
11(2)75
- execution,
4(3)233,
4(4)313,
5(2)171,
11(3)167
- functional,
2(1)49,
4(4)313,
5(2)171
- graph,
5(2)171,
8(3)271,
8(4)371,
10(3)327
- has,
5(2)171
- implementation,
1(1)97,
2(2)143,
2(3)239,
2(4)351,
4(1)23,
6(1)157,
8(1)1,
8(1)13,
8(1)65,
8(1)65,
9(1)41,
10(2)209,
10(4)361
- language,
4(4)313,
5(2)171
- large,
2(3)257,
5(3)475,
10(3)285,
12(1)55
- lazy,
4(4)313,
5(2)171
- line,
2(4)375
- machine,
2(1)23,
4(2)71,
4(4)313,
5(2)171,
5(4)523,
5(4)537,
6(2)277,
7(2)251,
8(1)65,
8(1)65,
9(1)13,
10(2)185,
12(1)69
- memory,
2(2)193,
2(4)375,
4(1)1,
4(2)143,
4(3)179,
5(3)307,
5(3)475,
6(4)519,
7(1)21,
7(2)161,
7(3)421,
10(1)53,
10(1)83,
10(2)141,
10(2)185,
11(2)75
- order,
2(4)311,
4(4)313
- paper,
4(4)313
- parallel,
1(4)563,
1(z)73,
2(1)1,
2(1)17,
2(2)143,
2(2)181,
2(3)239,
2(3)257,
2(3)265,
2(4)289,
2(4)351,
3(1)1,
3(1)31,
3(1)63,
4(1)23,
4(2)71,
4(2)109,
4(4)313,
5(1)51,
5(1)63,
5(2)171,
5(3)307,
5(3)413,
5(3)491,
5(4)503,
6(1)81,
6(1)101,
6(1)157,
6(2)287,
6(2)325,
6(3)375,
6(3)399,
6(4)501,
7(1)73,
7(1)145,
7(2)191,
7(2)285,
7(2)303,
7(3)365,
7(3)391,
7(4)489,
7(4)531,
7(4)547,
7(4)577,
7(4)595,
8(1)1,
8(1)65,
8(1)65,
8(3)205,
8(4)307,
8(4)319,
9(1)13,
9(1)25,
9(1)57,
9(1)73,
9(2)85,
9(2)127,
9(2)161,
9(3)223,
9(4)259,
9(4)291,
10(2)209,
10(3)257,
10(3)285,
10(4)361,
11(1)1,
11(1)15,
11(1)55,
12(1)55
- part,
9(4)259,
9(4)291
- processors,
4(4)301,
7(1)45,
7(4)515,
8(4)371,
10(1)115,
10(4)427
- program,
2(1)49,
2(2)133,
4(3)233,
4(4)313,
5(2)171,
7(2)303,
8(3)205,
10(2)153
- reduction,
4(4)313,
5(2)171,
11(2)93
- sequential,
4(4)313,
10(3)275
- task,
4(2)121,
4(4)313,
5(4)617,
7(1)1,
7(1)45,
8(1)47,
8(3)271,
8(4)363,
10(1)83,
11(4)203
- using,
5(2)171,
7(3)327,
7(3)351,
7(4)515,
8(4)347,
8(4)371,
9(1)25,
9(2)161,
9(3)191,
9(4)311,
11(1)1
- which,
4(4)313