Necessary and sufficient conditions for the universality of programming formalisms
Authors:
- 1 October 1985
- journal article
- Published by Springer Nature in Acta Informatica
- Vol. 22 (4) , 347-377
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Definability by programs in first-order structuresTheoretical Computer Science, 1983
- Generalized Galois theory and its application to complexityTheoretical Computer Science, 1981
- First-Order Dynamic Logic1979
- Interpolation theorems for program schemataInformation and Control, 1978
- Translatability of schemas over restricted interpretationsJournal of Computer and System Sciences, 1974
- Program schemes, recursion schemes, and formal languagesJournal of Computer and System Sciences, 1973
- Program Schemes with Pushdown StoresSIAM Journal on Computing, 1972
- On Classes of Program SchemataSIAM Journal on Computing, 1972
- On formalised computer programsJournal of Computer and System Sciences, 1970
- Algorithmic properties of structuresTheory of Computing Systems, 1967