Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 7-Day Trial for You or Your Team.

Learn More →

Arithmetizing declarations

Arithmetizing declarations is atr', j:' :: f :' Tecnn .q e,s ', <) i:,;%/¸ . . !:2(" " / ,. ,%. ;):;, : R. W. BEMER, Editor 3;he item is numeric by implication and therefore the clause ! is a tr named renders the clause "CLASS IS XUiXIEi{IC" ii ~ ~:-~,.. ~ An Application to COBOL* superfluous. At the same time it would render the clause among "CLASS IS AI~PHABETIC" contradictory The goa! ! sought here is to devise an arithmetic procedure which 1) 17 sistem :\[ELVIN E. CONWAY makes cleat' all of the properties declared, both explicitly i Ciearl; L. G. Hanscom Field, Bedjbrd, 3Iass. and implicitly, and 2) discovers any inconsistencies among i met.tie JOSEPH SPERON[ these properties. Those who take seriously the application "¢ ~, Sisten< Case Institute of Technology, C levela ~d, Ohio of these goals to COBOL know that the problem is not simple. There is hope that the methods presented here i have more general •utility in semantic analysis, e.g., resolu- ~ |ntroduction tion of meaning in mechanical translation and the forinali- The compiling technique of discovering the syntactical zation of the fringe area between syntax and semantics of If a is .. structure of http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Communications of the ACM Association for Computing Machinery

Arithmetizing declarations

Conway, Melvin E.; Speroni, Joseph
Communications of the ACM , Volume 6 (1): 4 – Jan 1, 1963
Download PDF
4 pages

Loading next page...
 
/lp/association-for-computing-machinery/arithmetizing-declarations-qbwtaKsnRz

References (3)

Publisher
Association for Computing Machinery
Copyright
Copyright © 1963 ACM
ISSN
0001-0782
eISSN
1557-7317
DOI
10.1145/366193.366212
Publisher site
See Article on Publisher Site

Abstract

is atr', j:' :: f :' Tecnn .q e,s ', <) i:,;%/¸ . . !:2(" " / ,. ,%. ;):;, : R. W. BEMER, Editor 3;he item is numeric by implication and therefore the clause ! is a tr named renders the clause "CLASS IS XUiXIEi{IC" ii ~ ~:-~,.. ~ An Application to COBOL* superfluous. At the same time it would render the clause among "CLASS IS AI~PHABETIC" contradictory The goa! ! sought here is to devise an arithmetic procedure which 1) 17 sistem :\[ELVIN E. CONWAY makes cleat' all of the properties declared, both explicitly i Ciearl; L. G. Hanscom Field, Bedjbrd, 3Iass. and implicitly, and 2) discovers any inconsistencies among i met.tie JOSEPH SPERON[ these properties. Those who take seriously the application "¢ ~, Sisten< Case Institute of Technology, C levela ~d, Ohio of these goals to COBOL know that the problem is not simple. There is hope that the methods presented here i have more general •utility in semantic analysis, e.g., resolu- ~ |ntroduction tion of meaning in mechanical translation and the forinali- The compiling technique of discovering the syntactical zation of the fringe area between syntax and semantics of If a is .. structure of

Journal

Communications of the ACM – Association for Computing Machinery

Published: Jan 1, 1963

There are no references for this article.