References
Val Breazu-Tannen and Jean Gallier. Polymorphic rewriting conserves algebraic strong normalization. Theoretical Computer Science, 1991. (Originally, ICALP 89.)
N. Dershowitz and M. Okada. A rationale for conditional equational programming. Theoretical Computer Science, 1991.
K. Futatsugi, J. Goguen, Jean-Pierre Jouannaud, and J. Meseguer. Principles of OBJ2. ACM POPL'85
Y. Gui and M. Okada. LAMBDALG: Higher Order Algebraic Specification Language. RTA'93, Montréal, (Springer LNCS).
J. A. Goguen, T. Winkler. Introducing OBJ3. Technical Report: SRI-CSL-88-9, Computer Science Laboratory, SRI International, 1988.
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.
J. Jouannaud, M. Okada. A computation model for executable higher-order algebraic specification languages. In Proc. 6th IEEE LICS. 1991.
J. Mitchell, S. Meldal, and N. Madhav. An extension of standard ML modules with subtyping and inheritance. ACM POPL'91
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.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gui, Y., Okada, M. (1993). System description of LAMBDALG. In: Voronkov, A. (eds) Logic Programming and Automated Reasoning. LPAR 1993. Lecture Notes in Computer Science, vol 698. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56944-8_69
Download citation
DOI: https://doi.org/10.1007/3-540-56944-8_69
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56944-2
Online ISBN: 978-3-540-47830-0
eBook Packages: Springer Book Archive