-
[文献書誌] Jouannaud and Okada: "A Computation model for executable higher order algebraic specification languages" Proc.of Logic in Computer Science,IEEE.6. (1991)
-
[文献書誌] Okada and Scott.P.J.: "Rewriting theory for the unizueness condition of higher order functionals" Proc.of the Montreal Workshop on Programming Language Theory,Logic and Formal Methosd 2.2. 20-29 (1991)
-
[文献書誌] Okada: "Rewriting Technizues for Programming Languages,survey and editor" Theoretical Computer Science,special Issue.(1992)
-
[文献書誌] Jouannand and Okada: "The satisfiability problem for the systoms of ordinal notations with subterm property is decidable." Proc.ICALP91(Automata,Language and Programming),Springer LNCS. 516. (1991)
-
[文献書誌] Grogono and Okada: "Term rewriting and functional languages" Proc.of the Montreal Workshop on Programming Language Theory,Logic and Formal Methods 3. 3. (1992)
-
[文献書誌] 岡田 光弘: "証明論とプログラム言語理論(解説記事)" 情報処理.
-
[文献書誌] S.Kaplan and M.Okada,editors: "Conditional and Typed Rewiting" springer,Heidelberg, 461 (1991)
-
[文献書誌] M.Okada and P.J.Scott,editors: "Proc.of the First Workshop on Programming Language Theory" CENPARMI,Montreal, 103 (1991)