Equational axiomatizations of if-then-else

  • Irène Guessarian
Part 1 Research Articles
Part of the Lecture Notes in Computer Science book series (LNCS, volume 308)


The equationally complete proof system for "if-then-else" of [Bloom and Tindell] is extended to a complete proof system for many-sorted algebras with extra operations, predicates and equations among those. We give similar completeness results for continuous algebras and program schemes (infinite trees) by the methods of algebraic semantics. These extensions provide a purely equational proof system to prove properties of functional programs over user-definable data types.


Proof System Axiom System Recursive Equation Induction Rule Algebraic Semantic 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Birkhoff]
    G. Birkhoff: On the structure of abstract algebras, Proc. Cambridge Philosophical Society 31 (1935), 433–454.Google Scholar
  2. [Bloom-Tindell]
    S. Bloom, R. Tindell: Varieties of if...then...else... SIAM J. Comput. 12 (1983), 677–707.Google Scholar
  3. [Dershowitz-Plaisted]
    N. Dershowitz, D.A. Plaisted: Equational Programming, to appear in Machine Intelligence 11 (1987).Google Scholar
  4. [Goguen-Meseguer]
    J. Goguen, J. Meseguer: Eqlog: Equality, Types, and Generic modules for Logic Programming, in Functional and Logic Programming, De Groot & Lindstrom (Eds.), Prentice Hall, London (1986), 295–363.Google Scholar
  5. [Goguen-Meseguer]
    J. Goguen, J. Meseguer: Completeness of many-sorted equational logic, SIGPLAN Notices 16 (1981), 24–32.Google Scholar
  6. [Guessarian]
    I. Guessarian: Algebraic Semantics, Lecture Notes in Computer Science 99, Springer Verlag, Berlin (1981).Google Scholar
  7. [Guessarian-Meseguer]
    I. Guessarian, J. Meseguer: On the axiomatization of "if-then-else", SIAM Journ. on Comput. 16 (1987), 332–357.Google Scholar
  8. [Jourannaud]
    J.-P. Jouannaud (Ed.): Proc. First Int. Conf. on Rewriting Techniques and Applications, Lect. Notes in Comput. Sci. 202, Springer-Verlag, Berlin (1985).Google Scholar
  9. [Kaplan]
    S. Kaplan: Simplifying conditional term rewriting systems: unification, termination and confluence, to appear in Jour. of Symbolic Comput. (1987)Google Scholar
  10. [Lankford-Musser]
    D. Lankford, D. Musser: On semideciding first-order validity and invalidity, USC Tech. Report (1978).Google Scholar
  11. [McCarthy]
    J. McCarthy: A basis for a mathematical theory of computation, in Computer Programming and formal systems, Braffort & Hirschberg, Eds, Amsterdm (1963), 33–70.Google Scholar
  12. [Manes]
    E. Manes: Guard Modules, Algebra Universalis 21 (1985), 103–110.CrossRefGoogle Scholar
  13. [Nivat]
    M. Nivat: On the interpretation of recursive polyadic program schemes, Symposia Mathematica 15, Rome (1975), 255–281.Google Scholar
  14. [Pappinghaus-Wirsing]
    P. Pappinghaus, M. Wirsing: Non deterministic three valued logic: Isotonic and guarded truth-functions, Studia Logica 42 (1983), 1–22.Google Scholar
  15. [Scott]
    D. Scott: The lattice of flow diagrans, in Symp. on Semantics of Algorithmic Languages, E. Engeler ed., Lecture Notes in Mathematics 182, Springer Verlag, Berlin (1971), 311–366.Google Scholar
  16. [Sethi]
    R. Sethi: Conditional expressions with equality tests, JACM 25 (1978), 667–674.Google Scholar
  17. [Zhang-Rémy]
    H. Zhang, J.-L. Rémy: Contextual Rewriting, Proc. First Int. Conf. on Rewriting Techniques and Applications, Lect. Notes in Comput. Sci. 202, Springer-Verlag, Berlin (1985), 46–62.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Irène Guessarian
    • 1
  1. 1.CNRS-LITP, UER de Math. — Université Paris 7Paris Cedex 05France

Personalised recommendations