no. 3
Reduction semantics for rational schemes
RAIRO. Informatique théorique, Tome 18 (1984) no. 3, pp. 209-223. 
@article{ITA_1984__18_3_209_0,
     author = {Indermark, K.},
     title = {Reduction semantics for rational schemes},
     journal = {RAIRO. Informatique th\'eorique},
     pages = {209--223},
     publisher = {EDP-Sciences},
     volume = {18},
     number = {3},
     year = {1984},
     mrnumber = {763667},
     zbl = {0546.68018},
     language = {en},
     url = {http://archive.numdam.org/item/ITA_1984__18_3_209_0/}
}
TY  - JOUR
AU  - Indermark, K.
TI  - Reduction semantics for rational schemes
JO  - RAIRO. Informatique théorique
PY  - 1984
SP  - 209
EP  - 223
VL  - 18
IS  - 3
PB  - EDP-Sciences
UR  - http://archive.numdam.org/item/ITA_1984__18_3_209_0/
LA  - en
ID  - ITA_1984__18_3_209_0
ER  - 
%0 Journal Article
%A Indermark, K.
%T Reduction semantics for rational schemes
%J RAIRO. Informatique théorique
%D 1984
%P 209-223
%V 18
%N 3
%I EDP-Sciences
%U http://archive.numdam.org/item/ITA_1984__18_3_209_0/
%G en
%F ITA_1984__18_3_209_0
Indermark, K. Reduction semantics for rational schemes. RAIRO. Informatique théorique, Tome 18 (1984) no. 3, pp. 209-223. http://archive.numdam.org/item/ITA_1984__18_3_209_0/

1. H. P. Barendregt, The Lambda-Calculus, Its Syntax and Semantics, North-Holland P.C. 1981. | MR | Zbl

2. H. Bekić, Definable Operations in General Algebras, and the Theory of Automata and Flowcharts, Research Report, I.B.M. Laboratory, Vienna, 1969.

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 | Zbl

4. W. Damm, The 10- and OI-hierarchies, Theoret. Comput. Sc., 20, 1982, 2, pp. 95-208. | MR | Zbl

5. I. Guessarian, Algebraic Semantics, Lecture Notes in Computer Science, 99, 1981. | MR | Zbl

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

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.

8. K. Indermark, On rational definitions in complete algebras without rank, Theoret. Comput. Sc., 21, 1982, pp. 281-313. | MR | Zbl

9. K. Indermark, Complexity of infinite trees, I.C.A.L.P. 83, Barcelona, 1983. | MR | Zbl

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 | Zbl

11. M. Nivat, On the Interpretation of Recursive Polyadic Program Schemes, Symposia Matematica, 15, Rome, 1975, pp. 255-281. | MR | Zbl

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

13. E. G. Wagner, Languages for Defining Sets in Arbitrary Algebras, Proc. I.E.E.E. Conf. SWAT, 12, 1971, pp. 192-201.

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 | Zbl