Jump to content

Sort Merge Generator

Add links
From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Jessicapierce (talk | contribs) at 17:58, 13 April 2018 (minor copy edits). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

The Sort Merge Generator was an application developed by Betty Holberton in 1951 for the Univac I and is one of the first examples of using a computer to create a computer program. The input to the application was a specification of files and the kind of sort and merge operations to use, and the output would be machine code for performing the specification.[1]

See also

References

  1. Holberton, F.E. "Application of Automatic Coding to Logical Processes". Symposium Automatic Programming for DigitalComputers, Office of Naval Research, Dept. of the Navy, Oct. 1954, pp.34-39. {{cite conference}}: Unknown parameter |booktitle= ignored (|book-title= suggested) (help)
  2. Hopper, Grace. "Automatic Coding for Digital Computers". High Speed Computer Conference (Louisiana State University) February 1995. Remington Rand. {{cite conference}}: Unknown parameter |booktitle= ignored (|book-title= suggested) (help)

Notes

  1. ^ Hopper, Grace. "Keynote Address". Proceedings of the ACM SIGPLAN History of Programming Languages (HOPL) conference. {{cite conference}}: Unknown parameter |booktitle= ignored (|book-title= suggested) (help)


Stub icon

This programming-language-related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Sort_Merge_Generator&oldid=836264835"