Partial evaluation and ω-completeness of algebraic specifications

Barendregt, 1981 Burstall, 1982, Algebras, theories and freeness: An introduction for computer scientists, 329 Bergstra, 1979, Algebraic specifications of computable and semi-computable data structures Bergstra, 1983, Initial and final algebra semantics for data type specifications: Two characterization theorems, SIAM J. Comput., 12, 366, 10.1137/0212024 Davis, 1976, Hilbert's tenth problem: Positive aspects of a negative solution, 323 Ershov, 1982, Mixed computation: Potential applications and problems for study, Theoret. Comput. Sci., 18, 41, 10.1016/0304-3975(82)90111-6 Henkin, 1977, The logic of equality, Amer. Math. Monthly, 84, 597, 10.2307/2321009 Hsiang, 1982, Topics in automated theorem proving and program generation Huet, 1982, Proofs by induction in equational theories with constructors, J. Comput. System Sci., 25, 239, 10.1016/0022-0000(82)90006-X Huet, 1980, Equations and rewrite rules: A survey Jones, 1985, An experiment in partial evaluation: The generation of a compiler generator Komorowski, 1981, A Specification of an Abstract PROLOG Machine and its Application to Partial Evaluation Lyndon, 1951, Identities in two-valued calculi, Trans. Amer. Math. Soc., 71, 457, 10.1090/S0002-9947-1951-0044470-3 Lyndon, 1954, Identities in finite algebras, 5, 8 Meseguer, 1986, Initiality, induction, and computability Nourani, 1981, On induction for programming logic: Syntax, semantics, and inductive closure, Bull. European Assoc. Theoret. Comput. Sci., 13, 51 Paul, 1984, Proof by induction in equational theories with relations between constructors Plotkin, 1974, The λ-calculus is ω-incomplete, J. Symbolic Logic, 39, 313, 10.2307/2272645 Taylor, 1979, Equational logic, Houston J. Math., Survey