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

Learn More →

Formalism in programming languages

Formalism in programming languages B o o l e a n p r o c e d u r e exacno (arg, n); e e J n m e n t exactly n occurrences of arg; exacno : = i f -1 arg t h e n ( i f n ~ 0 t h e n t r u e e l s e false) else i f n =< 0 t h e n f a l s e else exacno (arg, n - - l ) B o o l e a n p r o c e d u r e minmax (arg, m, n); comment at least m but not more than n occurrences of arg; minmax : = i f -~ arg t h e n ( i f m ~ O t h e n t r u e e l s e false) e l s e i f n =< 0 t h e n f a l s e e l s e minimax (arg, m--l, n - - l ) The following identities are evident from the above definitions : arbno (arg) = minno (arg, O) = maxno (arg, oo) = http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Communications of the ACM Association for Computing Machinery

Formalism in programming languages

Communications of the ACM , Volume 7 (2) – Feb 1, 1964

Loading next page...
 
/lp/association-for-computing-machinery/formalism-in-programming-languages-rpBCgV8xBx

References (7)

Publisher
Association for Computing Machinery
Copyright
Copyright © 1964 by ACM Inc.
ISSN
0001-0782
DOI
10.1145/363921.363933
Publisher site
See Article on Publisher Site

Abstract

B o o l e a n p r o c e d u r e exacno (arg, n); e e J n m e n t exactly n occurrences of arg; exacno : = i f -1 arg t h e n ( i f n ~ 0 t h e n t r u e e l s e false) else i f n =< 0 t h e n f a l s e else exacno (arg, n - - l ) B o o l e a n p r o c e d u r e minmax (arg, m, n); comment at least m but not more than n occurrences of arg; minmax : = i f -~ arg t h e n ( i f m ~ O t h e n t r u e e l s e false) e l s e i f n =< 0 t h e n f a l s e e l s e minimax (arg, m--l, n - - l ) The following identities are evident from the above definitions : arbno (arg) = minno (arg, O) = maxno (arg, oo) =

Journal

Communications of the ACMAssociation for Computing Machinery

Published: Feb 1, 1964

There are no references for this article.