Search

Your search keyword '"Maurer, Ward Douglas"' showing total 25 results
Start Over Author "Maurer, Ward Douglas"
25 results on '"Maurer, Ward Douglas"'

1. Using Mathematics to Improve Ada Compiled Code

Author

Maurer, Ward Douglas, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Pinho, Luís Miguel, editor, and González Harbour, Michael, editor

Published
2006
Full Text
View/download PDF

2. LETTERS TO THE EDITOR

Author

Holme, Thomas T., Nilles, George P., Maurer, Ward Douglas, and van de Kamp, Peter

Published
1966

8. Computer Experiments in Finite Algebra.

Author

Maurer, Ward Douglas

Subjects
*COMPUTER programming, *ALGEBRA, *MATHEMATICAL analysis, *IBM computers, *MODULAR arithmetic, *MODULES (Algebra)
Abstract

A medium-scale programming system is written in MAD and FAP on the IBM 7094 to manipulate some of the objects of modern algebra: finite groups, maps and sets of maps, subsets and sets of subsets, constant integers and truth-values. Designed to operate in a time-sharing environment, the system can serve as teacher's aid to the undergraduate student of modern algebra, as well as for the working scientist or engineer wishing to familiarize himself with the subject. [ABSTRACT FROM AUTHOR]

Published
1966
Full Text
View/download PDF

14. Using Mathematics to Improve Ada Compiled Code.

Author

Pinho, Luís Miguel, González Harbour, Michael, and Maurer, Ward Douglas

Abstract

We have developed two mathematical techniques which, used together, can increase the speed of Ada compiled code, in two ways. We can eliminate most subprogram call overhead, involving stack pointer adjustment when a subprogram is called and when it returns. We can also eliminate most static scoping overhead, requiring the use of multiple base registers when procedures are nested. In particular, all this overhead can be eliminated in the absence of recursion. One of our techniques is based on an analogy with a variant of the well-known critical path method. The other is based on a new result in directed graph theory, which has many potential applications in addition to the one presented here. [ABSTRACT FROM AUTHOR]

Published
2006
Full Text
View/download PDF

18. A semantic extension of BNF

Author

Maurer, Ward Douglas

Abstract

This paper describes a language-description language and applies it to describe a dialect of FORTRAN II. The language allows a syntactic and semantic definition of the language being described, and is an extension of standard BNF. The semantics is described by associating with each nonterminal in the syntactic description one or more state vector functions as semantic attributes in the sense of Knuth. Both synthesized and inherited attributes are allowed. Other attributes, such as length, value, environment, and the like, may also be used in a language description. The language-description language is given a partial definition in its own terms.

Published
1971
Full Text
View/download PDF

19. Letters to ihe Editor.

Author

Maurer, Ward Douglas, Salton, Gerard, and Weizenbaum, Joseph

Subjects
*LETTERS to the editor, *CONFERENCES & conventions
Abstract

Presents letters to the editor referencing articles and topics discussed in earlier issues of the journal "Communications of the ACM." Comment on the article "On the Role of the ACM Journal"; Information about the Counter Conference organized by the Association for Computing Machinery in Chicago, Illinois.

Published
1970

Catalog

Books, media, physical & digital resources
See catalog results