System description of LAMBDALG

A higher order algebraic specification language
  • Yexuan Gui
  • Mitsuhiro Okada
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 698)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Val Breazu-Tannen and Jean Gallier. Polymorphic rewriting conserves algebraic strong normalization. Theoretical Computer Science, 1991. (Originally, ICALP 89.)Google Scholar
  2. 2.
    N. Dershowitz and M. Okada. A rationale for conditional equational programming. Theoretical Computer Science, 1991.Google Scholar
  3. 3.
    K. Futatsugi, J. Goguen, Jean-Pierre Jouannaud, and J. Meseguer. Principles of OBJ2. ACM POPL'85 Google Scholar
  4. 4.
    Y. Gui and M. Okada. LAMBDALG: Higher Order Algebraic Specification Language. RTA'93, Montréal, (Springer LNCS).Google Scholar
  5. 5.
    J. A. Goguen, T. Winkler. Introducing OBJ3. Technical Report: SRI-CSL-88-9, Computer Science Laboratory, SRI International, 1988.Google Scholar
  6. 6.
    R. Harper, D. MacQueen, and R. Milner. Standard ML, LFCS Report Series: ECS-LFCS-86-2, LFCS, Dept. of Computer Science, Univ. of Edinburge, 1986.Google Scholar
  7. 7.
    J. Jouannaud, M. Okada. A computation model for executable higher-order algebraic specification languages. In Proc. 6th IEEE LICS. 1991.Google Scholar
  8. 8.
    J. Mitchell, S. Meldal, and N. Madhav. An extension of standard ML modules with subtyping and inheritance. ACM POPL'91 Google Scholar
  9. 9.
    M. Okada. Strong normalizability for the combined system of the typed lambda calculus and an arbitrary convergent term rewriting system. In Proc. ISSAC 89, Portland, Oregon, 1989.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Yexuan Gui
    • 1
  • Mitsuhiro Okada
    • 1
  1. 1.Logic and Formal Methods Lab Department of Computer ScienceConcordia UniversityMontréalCanada

Personalised recommendations