Entry Lester:1993:ESH from ijhsc.bib

Last update: Sun Oct 15 02:21:07 MDT 2017                Valid HTML 3.2!

Index sections

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