Translatability of schemas over restricted interpretations

Abramson, 1971, Effective computation over the real numbers Brown, 1972, Program schemes with pushdown stores, SIAM J. Comput., 1, 242, 10.1137/0201017 Chandra, 1972, Program schemas with equality Friedman, 1970, Algorithmic procedures, generalized Turing algorithms, and elementary recursion theory Garland, 1973, Program schemes, recursion schemes, and formal languages, J. Comput. Sys. Sci., 7, 10.1016/S0022-0000(73)80040-6 Garland, 1972, On the equivalence of schemes Kfoury, 1973, Comparing algebraic structures up to algorithmic equivalence Kreisel, 1965, Model-theoretic invariants Moschovakis, 1969, Abstract computability, Trans. Am. Math. Society, 138, 427 Paterson, 1968, Program schemata Paterson, 1970, Equivalence problems in a model of computation Paterson, 1970, Comparative schematology Scott, 1971, The lattice of flow-diagrams Shepherdson, 1963, The computability of partial recursive functions, J. Assoc. Comp. Mach., 10, 217, 10.1145/321160.321170 Strong, 1971, High level languages of maximum power Strong, 1971, Translating recursion equations into flow-charts, J. Comput. Sys. Sci., 5, 254, 10.1016/S0022-0000(71)80036-3 Birkhoff, 1967, Vol. 25