Representing program schemes in logic

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.