- About
-
The Global ETD Search service is a free service for researchers
to find electronic theses and dissertations. This service is
provided by the
Networked Digital Library of Theses and Dissertations.
Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
Search results
Showing 1 to 8 of 8 (0.081 seconds)| 1 |
Left-Incompatible Term Rewriting Systems and Functional StrategySAKAI, Masahiko 12 1900 (has links)
No description available.
|
| 2 |
Index Reduction of Overlapping Strongly Sequential SystemsTOYAMA, Yoshihito, SAKAI, Masahiko, NAGAYA, Takashi 20 May 1998 (has links)
No description available.
|
| 3 |
Enhancing Dependency Pair Method using Strong Computability in Simply-Typed Term Rewriting草刈, 圭一朗, Kusakari, Keiichirou, 酒井, 正彦, Sakai, Masahiko January 2007 (has links)
No description available.
|
| 4 |
Higher-Order Path Orders Based on ComputabilityKUSAKARI, Keiichirou 01 February 2004 (has links)
No description available.
|
| 5 |
A Higher-Order Knuth-Bendix Procedure and Its ApplicationsCHIBA, Yuki, KUSAKARI, Keiichirou 01 April 2007 (has links)
No description available.
|
| 6 |
Primitive Inductive Theorems Bridge Implicit Induction Methods and Inductive Theorems in Higher-Order RewritingKUSAKARI, Keiichirou, SAKAI, Masahiko, SAKABE, Toshiki 12 1900 (has links)
No description available.
|
| 7 |
An Improved Recursive Decomposition Ordering for Higher-Order Rewrite SystemsIWAMI, Munehiro, SAKAI, Masahiko, TOYAMA, Yoshihito 09 1900 (has links)
No description available.
|
| 8 |
Reduktionssysteme zur Berechnung einer Auflösung der orthogonalen freien Quantengruppen A<sub>o</sub>(n) / Reduction systems for computing a resolution of the free orthogonal quantum groups A<sub>o</sub>(n)Härtel, Johannes 04 July 2008 (has links)
No description available.
|
Page generated in 0.0842 seconds