{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,3,9]],"date-time":"2023-03-09T09:21:14Z","timestamp":1678353674589},"reference-count":41,"publisher":"Association for Computing Machinery (ACM)","issue":"2","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["J. ACM"],"published-print":{"date-parts":[[1982,4]]},"DOI":"10.1145\/322307.322325","type":"journal-article","created":{"date-parts":[[2002,7,27]],"date-time":"2002-07-27T11:26:10Z","timestamp":1027769170000},"page":"577-602","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["The Pattern-of-Calls Expansion Is the Canonical Fixpoint for Recursive Definitions"],"prefix":"10.1145","volume":"29","author":[{"given":"Michael A.","family":"Arbib","sequence":"first","affiliation":[{"name":"Department of Computer and Information Science, University of Massachusetts, Amherst, MA"}]},{"given":"Ernest G.","family":"Manes","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Statistics, University of Massachusetts, Amherst, MA"}]}],"member":"320","published-online":{"date-parts":[[1982,4]]},"reference":[{"key":"e_1_2_1_1_2","first-page":"127","volume-title":"Proc. Int. Workshop on Graph Grammars and their Applications to Computer Science and Biology, Lecture Notes in Computer Science 73","author":"Arbib M.A.","year":"1979","unstructured":"Arbib , M.A. , xr,,o MANr.s, E.G. Parttally-addative monoids, graph-growing and the algebraic semantics of recursive calls . In Proc. Int. Workshop on Graph Grammars and their Applications to Computer Science and Biology, Lecture Notes in Computer Science 73 , V. Claus, H. Ehrig, and G. Rozenberg, Eds., Springer-Verlag, Berlin, Heidelberg, New York , 1979 , pp. 127 - 138 . Arbib, M.A., xr,,o MANr.s, E.G. Parttally-addative monoids, graph-growing and the algebraic semantics of recursive calls. In Proc. Int. Workshop on Graph Grammars and their Applications to Computer Science and Biology, Lecture Notes in Computer Science 73, V. Claus, H. Ehrig, and G. Rozenberg, Eds., Springer-Verlag, Berlin, Heidelberg, New York, 1979, pp. 127-138."},{"key":"e_1_2_1_2_2","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0021-8693(80)90212-4","article-title":"Partaally-add~dve categories and flow-diagram semantics, d","volume":"62","author":"Arbib M A","unstructured":"Arbib , M A . , AND MA .'~S, E.G . Partaally-add~dve categories and flow-diagram semantics, d . Algebra 62 09so), 203 - 227 . Arbib, M A., AND MA.'~S, E.G. Partaally-add~dve categories and flow-diagram semantics, d. Algebra 62 09so), 203-227.","journal-title":"Algebra"},{"key":"e_1_2_1_3_2","volume-title":"IRIA Laboria, 78150 Le Chesnay","author":"Arnold A.","year":"1978","unstructured":"Arnold , A. , ANn NrvAr, M. The metric space of inf'mite trees : Algebraic and topological properties. Tech. Pep. 323 , IRIA Laboria, 78150 Le Chesnay , France , 1978 . Arnold, A., ANn NrvAr, M.The metric space of inf'mite trees: Algebraic and topological properties. Tech. Pep. 323, IRIA Laboria, 78150 Le Chesnay, France, 1978."},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1145\/321765.321780"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/359576.359579"},{"key":"e_1_2_1_6_2","first-page":"203","article-title":"of ordered algebras. ~ Comput","volume":"13","author":"Varieties","year":"1976","unstructured":"BLOOM, S.L. Varieties of ordered algebras. ~ Comput . Syst. Scf. 13 ( 1976 ), 203 - 212 . BLOOM, S.L.Varieties of ordered algebras. ~ Comput. Syst. Scf. 13 (1976), 203-212.","journal-title":"Syst. Scf."},{"key":"e_1_2_1_7_2","volume-title":"of Pure and Applied Mathematics","author":"Pteprint","year":"1977","unstructured":"BLOOM, S.L.lterative and metric algebraic theories. Pteprint , Dep. of Pure and Applied Mathematics , Stevens Institute of Technology , Hoboken , N,J., 1977 . BLOOM, S.L.lterative and metric algebraic theories. Pteprint, Dep. of Pure and Applied Mathematics, Stevens Institute of Technology, Hoboken, N,J., 1977."},{"key":"e_1_2_1_8_2","first-page":"118","volume-title":"North-Holland","author":"Chomsky N","year":"1963","unstructured":"Chomsky , N ,, AND SCHUTZ I~NBF , J~ .GE E~ , M. The algebraic theory of exmtext-frt~ languages. In Computer Programming and Formal Systems, P. Brat'ford and D. Hirsehberg, Eds ., North-Holland , Amsterdam , 1963 , pp. 118 - 161 . Chomsky, N,, AND SCHUTZI~NBF, J~.GEE~, M.The algebraic theory of exmtext-frt~ languages. In Computer Programming and Formal Systems, P. Brat'ford and D. Hirsehberg, Eds., North-Holland, Amsterdam, 1963, pp. 118-161."},{"key":"e_1_2_1_9_2","volume-title":"New York","author":"Corn P.M.","year":"1965","unstructured":"Corn % P.M. Universal Algebra. Harper and Row , New York , 1965 . Corn% P.M. Universal Algebra. Harper and Row, New York, 1965."},{"key":"e_1_2_1_10_2","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/S0022-0000(75)80056-0","article-title":"On the completeness of the inductive assertion method","volume":"11","author":"K~ J W","year":"1975","unstructured":"DE BAK K~ , J W . , AND M.EERTILMS , L.G . On the completeness of the inductive assertion method . J. Comput. Syst. Scl. 11 ( 1975 ), 323 - 357 . DE BAKK~, J W., AND M.EERTILMS, L.G. On the completeness of the inductive assertion method. J. Comput. Syst. Scl. 11 (1975), 323-357.","journal-title":"J. Comput. Syst. Scl."},{"key":"e_1_2_1_11_2","volume-title":"Mathemattsch Centmm","author":"RoLwva~ W.P.","year":"1976","unstructured":"DE RoLwva~ , W.P. Jr,Reeursive program schemes : Semantics and proof theory. Mathematical Centre Tracts 70 , Mathemattsch Centmm , Amsterdam , 1976 . DE RoLwva~, W.P. Jr,Reeursive program schemes: Semantics and proof theory. Mathematical Centre Tracts 70, Mathemattsch Centmm, Amsterdam, 1976."},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1145\/360933.360975"},{"key":"e_1_2_1_13_2","unstructured":"Elgot S. Automata Languages and Machines Vol. A. Academic Press New York 1974. Elgot S. Automata Languages and Machines Vol. A. Academic Press New York 1974."},{"key":"e_1_2_1_14_2","first-page":"175","volume-title":"North Holland","year":"1975","unstructured":"ELOOT, C.C. Monadic computation and iterative algebraic theories. In Logic Co#oqumm \"73, Studies in Logic 80, H.E. Rose aad~ J.C. Sh~epherdson, Eds ., North Holland , Amsterdam , 1975 , pp. 175 - 230 . ELOOT, C.C. Monadic computation and iterative algebraic theories. In Logic Co#oqumm \"73, Studies in Logic 80, H.E. Rose aad~ J.C. Sh~epherdson, Eds., North Holland, Amsterdam, 1975, pp. 175-230."},{"key":"e_1_2_1_15_2","series-title":"Lecture Notes in Computer Science 20","volume-title":"Simple Program Schemes and Formal Languages","year":"1974","unstructured":"ENGELFRIET, J. Simple Program Schemes and Formal Languages . Lecture Notes in Computer Science 20 , Springer-Vedag , Berlin, Heidelberg , New York, 1974 . ENGELFRIET, J. Simple Program Schemes and Formal Languages. Lecture Notes in Computer Science 20, Springer-Vedag, Berlin, Heidelberg, New York, 1974."},{"key":"e_1_2_1_17_2","doi-asserted-by":"publisher","DOI":"10.1145\/321127.321132"},{"key":"e_1_2_1_18_2","series-title":"Lecture Notes in Computer Science 45","first-page":"153","volume-title":"Mathematical Foundations of Computer ScJence","author":"Gtm N","year":"1976","unstructured":"GO Gtm N , J.A. , TttA~cI~t , J.W , WAO N~ L , E G., AND W~ GH'r, J.B. Some fundamentals of orderalgebraic semantics . In Mathematical Foundations of Computer ScJence , Lecture Notes in Computer Science 45 , G. Goos and J. Hartmams, Eds., Springer-Verlag , Berlin, Hetdelberg , New York, 1976 , pp. 153 - 168 . GOGtmN, J.A., TttA~cI~t, J.W, WAON~L, E G., AND W~GH'r, J.B. Some fundamentals of orderalgebraic semantics. In Mathematical Foundations of Computer ScJence, Lecture Notes in Computer Science 45, G. Goos and J. Hartmams, Eds., Springer-Verlag, Berlin, Hetdelberg, New York, 1976, pp. 153-168."},{"key":"e_1_2_1_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/321992.321997"},{"key":"e_1_2_1_20_2","volume-title":"Topics m Mathematical System Theory. McGraw-Hall","author":"L~t~lq R.E.","year":"1969","unstructured":"KA L~t~lq , R.E. , FALe, P.L. , ~.r ~o ARBm, M A . Topics m Mathematical System Theory. McGraw-Hall , New York , 1969 . KAL~t~lq, R.E., FALe, P.L., ~.r~o ARBm, M A. Topics m Mathematical System Theory. McGraw-Hall, New York, 1969."},{"key":"e_1_2_1_21_2","volume-title":"Rationalizing many-sorted algebratc theories. Res. Pep. RC7574","author":"Am N","year":"1979","unstructured":"K Am N , S. Rationalizing many-sorted algebratc theories. Res. Pep. RC7574 , IBM Thomas J Watson Research Center, Yorktown Heights , N.Y. , 1979 . KAmN, S. Rationalizing many-sorted algebratc theories. Res. Pep. RC7574, IBM Thomas J Watson Research Center, Yorktown Heights, N.Y., 1979."},{"key":"e_1_2_1_22_2","volume-title":"Harvard Univ.","year":"1959","unstructured":"KARP, R,M. Some applications of logical syntax to digital computer programming. Ph.D. Dtssertation , Harvard Univ. , Cambridge , Mass ., 1959 . KARP, R,M. Some applications of logical syntax to digital computer programming. Ph.D. Dtssertation, Harvard Univ., Cambridge, Mass., 1959."},{"key":"e_1_2_1_23_2","unstructured":"Kleene~ Introductton to Maamathematics. Van Nostrand 1952. Kleene~ Introductton to Maamathematics. Van Nostrand 1952."},{"key":"e_1_2_1_24_2","first-page":"133","article-title":"sure les fonctions des ensembles","volume":"6","author":"Ula","year":"1928","unstructured":"KNASTER, B. Ula th6or~me sure les fonctions des ensembles . Ann. Soc. Polort Math. 6 ( 1928 ), 133 -- 134 . KNASTER, B. Ula th6or~me sure les fonctions des ensembles. Ann. Soc. Polort Math. 6 (1928), 133--134.","journal-title":"Ann. Soc. Polort Math."},{"key":"e_1_2_1_25_2","first-page":"220","article-title":"On formalized computer programs. ~ Comput","volume":"4","author":"Luckham D.C.","year":"1970","unstructured":"Luckham , D.C. , PARK , D.M.R., AND P^rERSON, M S . On formalized computer programs. ~ Comput . Syst. ScL 4 ( 1970 ), 220 - 249 . Luckham, D.C., PARK, D.M.R., AND P^rERSON, M S. On formalized computer programs. ~ Comput. Syst. ScL 4 (1970), 220-249.","journal-title":"Syst. ScL"},{"key":"e_1_2_1_26_2","volume-title":"Fundamentals of Computatwn Theory, FCT'79, L. Budach, F.d.","year":"1979","unstructured":"MANES, E.G. Partialty-addiuve semantics: A progress report . In Fundamentals of Computatwn Theory, FCT'79, L. Budach, F.d. , Akademie-Verlag , Berlin , 1979 , 279-290. MANES, E.G. Partialty-addiuve semantics: A progress report. In Fundamentals of Computatwn Theory, FCT'79, L. Budach, F.d., Akademie-Verlag, Berlin, 1979, 279-290."},{"key":"e_1_2_1_27_2","volume-title":"Mathematical Theory of Computatwn","year":"1974","unstructured":"MANNA, Z. Mathematical Theory of Computatwn . McGraw-Hill , New York , 1974 . MANNA, Z. Mathematical Theory of Computatwn. McGraw-Hill, New York, 1974."},{"key":"e_1_2_1_28_2","doi-asserted-by":"publisher","DOI":"10.1145\/355609.362336"},{"key":"e_1_2_1_29_2","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0304-3975(78)90033-6","article-title":"The convergence of functions to fixedpoints of recursive det'mitions","volume":"6","author":"Mxhq~ Z.","year":"1978","unstructured":"Mxhq~ ^, Z. , AND Sn~tm , A . The convergence of functions to fixedpoints of recursive det'mitions . Theor. Comput. Set 6 ( 1978 ), 109 - 141 . Mxhq~^, Z., AND Sn~tm, A. The convergence of functions to fixedpoints of recursive det'mitions. Theor. Comput. Set 6 (1978), 109-141.","journal-title":"Theor. Comput. Set"},{"key":"e_1_2_1_30_2","volume-title":"A Theory of Programming Language Semantics, 2 vols","author":"Sa' I~Y","year":"1976","unstructured":"milne R., AND Sa' RAC I~Y , C. A Theory of Programming Language Semantics, 2 vols . Chapman and Hall , London , 1976 . milne R., AND Sa'RACI~Y, C. A Theory of Programming Language Semantics, 2 vols. Chapman and Hall, London, 1976."},{"key":"e_1_2_1_31_2","volume-title":"Theory of Recurslve Functions and Effective Computab:lity","author":"Gers H. JR.","year":"1967","unstructured":"RO Gers , H. JR. Theory of Recurslve Functions and Effective Computab:lity . McGraw-Hill , New York , 1967 . ROGers, H. JR. Theory of Recurslve Functions and Effective Computab:lity. McGraw-Hill, New York, 1967."},{"key":"e_1_2_1_32_2","volume-title":"Jungen. Proc. Amer. Math. So~.","author":"Chutzenberger M.P.","year":"1962","unstructured":"S Chutzenberger , M.P. On a theorem of R . Jungen. Proc. Amer. Math. So~. , 1962 . SChutzenberger, M.P. On a theorem of R. Jungen. Proc. Amer. Math. So~., 1962."},{"key":"e_1_2_1_33_2","volume-title":"Oxford Umv. Computing Laboratory","author":"Scott D.","year":"1970","unstructured":"Scott , D. Outline of a mathematical theory of computation. Tech. Mon. PRG-2 , Oxford Umv. Computing Laboratory , 1970 . Scott, D. Outline of a mathematical theory of computation. Tech. Mon. PRG-2, Oxford Umv. Computing Laboratory, 1970."},{"key":"e_1_2_1_34_2","series-title":"Lecture Notes in Mathematics 188, E. Engeler, Ed","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/BFb0059703","volume-title":"Symposmm on Semantics of Algorithmic Languages","author":"ScoTt D.","year":"1971","unstructured":"ScoTt , D. The lattice of flow diagrams . In Symposmm on Semantics of Algorithmic Languages , Lecture Notes in Mathematics 188, E. Engeler, Ed , Sprmger-Verlag , Berlin, Heidelberg , New York, 1971 , pp. 311 - 366 . ScoTt, D. The lattice of flow diagrams. In Symposmm on Semantics of Algorithmic Languages, Lecture Notes in Mathematics 188, E. Engeler, Ed, Sprmger-Verlag, Berlin, Heidelberg, New York, 1971, pp. 311-366."},{"key":"e_1_2_1_35_2","first-page":"523","article-title":"Data types as lattices. SIAM 3","volume":"5","author":"Sco TT","year":"1976","unstructured":"Sco TT , D . Data types as lattices. SIAM 3 :. Comput. 5 ( 1976 ), 523 - 587 . ScoTT, D. Data types as lattices. SIAM 3:. Comput. 5 (1976), 523-587.","journal-title":"Comput."},{"key":"e_1_2_1_36_2","unstructured":"STOY J.E. Denotatwnal Semantics. MIT Press Cambridge Mass. 1977. STOY J.E. Denotatwnal Semantics. MIT Press Cambridge Mass. 1977."},{"key":"e_1_2_1_37_2","first-page":"285","volume-title":"Proc. ~ Math. 5","author":"Tarski A.","year":"1955","unstructured":"Tarski , A. Lattice-theoretical fixpoint theorem and its applicauons . Proc. ~ Math. 5 ( 1955 ), 285 - 309 . Tarski, A. Lattice-theoretical fixpoint theorem and its applicauons. Proc. ~ Math. 5 (1955), 285-309."},{"key":"e_1_2_1_38_2","doi-asserted-by":"publisher","DOI":"10.1145\/360303.360308"},{"key":"e_1_2_1_39_2","series-title":"Lecture Notes in Computer Science 56, G. Goos and .t","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1007\/3-540-08442-8_100","volume-title":"II. In Fundamentals of Computation Theory","author":"Truryn J.","year":"1977","unstructured":"Truryn , J. Fixed-points and algebras wtth infinitely long expressions , II. In Fundamentals of Computation Theory , Lecture Notes in Computer Science 56, G. Goos and .t . Hartmanis, Eds., Springer-Verlag , Berlin, Heidelberg , New York, 1977 , pp. 332 - 339 . Truryn, J. Fixed-points and algebras wtth infinitely long expressions, II. In Fundamentals of Computation Theory, Lecture Notes in Computer Science 56, G. Goos and .t. Hartmanis, Eds., Springer-Verlag, Berlin, Heidelberg, New York, 1977, pp. 332-339."},{"key":"e_1_2_1_40_2","volume-title":"Many-sorted and ordered algebraic theories. Res. Pep. RC7595","author":"Agner G.","year":"1979","unstructured":"W Agner e. G. , WRmtrr, J.B. , Am ) T~rcmn~, $. W. Many-sorted and ordered algebraic theories. Res. Pep. RC7595 , IBM Thomas J. Watson Research Center , Yorktown Heights , N.Y, 1979 . WAgner e.G., WRmtrr, J.B., Am) T~rcmn~, $.W. Many-sorted and ordered algebraic theories. Res. Pep. RC7595, IBM Thomas J. Watson Research Center, Yorktown Heights, N.Y, 1979."},{"key":"e_1_2_1_41_2","volume-title":"Computer Science Dep., Indiana Univ.","author":"WAND","year":"1977","unstructured":"WAND , M Fixed-point constructions in order-enriched categories Tech. Pep. 23 , Computer Science Dep., Indiana Univ. , Bloomington, Ind ., 1977 . WAND, M Fixed-point constructions in order-enriched categories Tech. Pep. 23, Computer Science Dep., Indiana Univ., Bloomington, Ind., 1977."},{"key":"e_1_2_1_42_2","first-page":"211","volume-title":"Calif.","author":"Eiger H.P.","year":"1969","unstructured":"Z Eiger , H.P. Formal models for some features of programming languages. 1st ACM Syrup. on Theory of Computing, Manna del Rey , Calif. , May 1969 , pp. 211 - 215 . 10.1145\/800169.805435 ZEiger, H.P. Formal models for some features of programming languages. 1st ACM Syrup. on Theory of Computing, Manna del Rey, Calif., May 1969, pp. 211-215. 10.1145\/800169.805435"}],"container-title":["Journal of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/322307.322325","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,31]],"date-time":"2022-12-31T20:24:59Z","timestamp":1672518299000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/322307.322325"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,4]]},"references-count":41,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1982,4]]}},"alternative-id":["10.1145\/322307.322325"],"URL":"https:\/\/doi.org\/10.1145\/322307.322325","relation":{},"ISSN":["0004-5411","1557-735X"],"issn-type":[{"value":"0004-5411","type":"print"},{"value":"1557-735X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1982,4]]},"assertion":[{"value":"1982-04-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}