Author:
Broy Manfred,Wirsing Martin
Reference35 articles.
1. Note: L.N.C.S., Lecture Notes in Computer Science; I.C.A.L.P., Int. Colloquium on Automata, Languages and Programming.
2. 1. BACKUS J., Can Programming be Liberated from the von Neumann Style? A Functional Style and lts Algebra of Programs, Comm. A.C.M., Vol. 21, No. 8, 1978, pp. 613-641.5203920383.68013
3. 2. BAUER F. L. and WÖSSNER H., Algorithmische Sprache und Programmentwicklung, Berlin-Heidelberg-New York, Springer, 1981.0466.68006
4. 3. DE BAKKER J. W., Least Fixed Points Revisited. In C. BÖHM, Ed., λ-Calculus and Computer Science Theory, Roma, I.N.C.S., Vol. 37, pp. 27-62, Berlin, Springer, 1975.4749420328.68009
5. 4. BERGSTRA J. A. and TUCKER J. V., Algebraic Specification of Computable and Semi-Computable Data Structures, Afdeling Informatica Amsterdam, IW115/79, 1979.0419.68029
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献