EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 18 / No 3 (1984) RAIRO. Inform. théor., 18 3 (1984) 209-223 References
Free Access
Issue
RAIRO. Inform. théor.
Volume 18, Number 3, 1984
Page(s) 209 - 223
DOI https://doi.org/10.1051/ita/1984180302091
Published online 01 February 2017
  1. 1. H. P. BARENDREGT, The Lambda-Calculus, Its Syntax and Semantics, North-Holland P.C. 1981. [MR: 622912] [Zbl: 0467.03010] [Google Scholar]
  2. 2. H. BEKIĆ, Definable Operations in General Algebras, and the Theory of Automata and Flowcharts, Research Report, I.B.M. Laboratory, Vienna, 1969. [Google Scholar]
  3. 3. W. DAMM, E. FEHR and K. INDERMARK, Higher type recursion and self-application as control structures, in: E. NEUHOLD, Ed., Formal Description of Programming Concepts, North-Holland, Amsterdam, 1978, pp. 461-487. [MR: 537917] [Zbl: 0373.68021] [Google Scholar]
  4. 4. W. DAMM, The 10- and OI-hierarchies, Theoret. Comput. Sc., 20, 1982, 2, pp. 95-208. [MR: 666544] [Zbl: 0478.68012] [Google Scholar]
  5. 5. I. GUESSARIAN, Algebraic Semantics, Lecture Notes in Computer Science, 99, 1981. [MR: 617908] [Zbl: 0474.68010] [Google Scholar]
  6. 6. K. INDERMARK, Schemes with recursion on higher types, Proc. M.F.C.S.-76, Lecture Notes in Computer Science, 45, 1976, pp. 352-358. [Zbl: 0337.68015] [Google Scholar]
  7. 7. K. INDERMARK, Análisis algebráico der estructuras de control, Proc. Seminario sobre relaciones entre la lógica matemática y la informática teorica, Universidad Complutense de Madrid, 1981. [Google Scholar]
  8. 8. K. INDERMARK, On rational definitions in complete algebras without rank, Theoret. Comput. Sc., 21, 1982, pp. 281-313. [MR: 680919] [Zbl: 0498.68017] [Google Scholar]
  9. 9. K. INDERMARK, Complexity of infinite trees, I.C.A.L.P. 83, Barcelona, 1983. [MR: 727668] [Zbl: 0528.68014] [Google Scholar]
  10. 10. M. NIVAT, Languages algébriques sur le magma libre et sémantique des schémas de programme, in: Automata, Languages, and Programming, M. NIVAT, Ed., North-Holland P.C., 1972, pp. 293-308. [MR: 383813] [Zbl: 0279.68010] [Google Scholar]
  11. 11. M. NIVAT, On the Interpretation of Recursive Polyadic Program Schemes, Symposia Matematica, 15, Rome, 1975, pp. 255-281. [MR: 391563] [Zbl: 0346.68041] [Google Scholar]
  12. 12. E. G. WAGNER, An Algebraic Theory of Recursive Definitions and Recursive Languages, Proc. 3rd A.C.M. Symp. Theory of Computing, 1971, pp. 12-23. [Zbl: 0252.02048] [Google Scholar]
  13. 13. E. G. WAGNER, Languages for Defining Sets in Arbitrary Algebras, Proc. I.E.E.E. Conf. SWAT, 12, 1971, pp. 192-201. [Google Scholar]
  14. 14. M. WAND, A concrete approach to abstract recursive definitions in: Automata, Languages, and Programming, M. NIVAT, Ed., North-Holland P.C., 1972, pp. 331-344. [MR: 366767] [Zbl: 0278.68066] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.