Representing program schemes in logic
- 1 October 1972
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 02724847,p. 27-39
- https://doi.org/10.1109/swat.1972.20
Abstract
Our principle technical results are the development of a family of first order logics (called FILs), the translation of classes of program schemes into these logics and the development of routine decision procedures for these representations. We feel the results are interesting because the class of schemes include a previously studied important class (Paterson's monadic non-intersecting loops class), because the decision procedures are routine and the new logics are natural, and finally because this work provides information and tools for the important problem of designing and compiling highly declarative programming languages.Keywords
This publication has 7 references indexed in Scilit:
- On the equivalence of schemesPublished by Association for Computing Machinery (ACM) ,1972
- Towards automatic program synthesisPublished by Springer Nature ,1971
- Structure and meaning of elementary programsPublished by Springer Nature ,1971
- Decidability of Second-Order Theories and Automata on Infinite TreesTransactions of the American Mathematical Society, 1969
- Properties of Programs and the First-Order Predicate CalculusJournal of the ACM, 1969
- Algorithmic properties of structuresTheory of Computing Systems, 1967
- On Multi-Head Finite AutomataIBM Journal of Research and Development, 1966