• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 5
  • Tagged with
  • 5
  • 5
  • 5
  • 5
  • 4
  • 3
  • 3
  • 3
  • 3
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 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.
1

Enhancing Dependency Pair Method using Strong Computability in Simply-Typed Term Rewriting

草刈, 圭一朗, Kusakari, Keiichirou, 酒井, 正彦, Sakai, Masahiko January 2007 (has links)
No description available.
2

Higher-Order Path Orders Based on Computability

KUSAKARI, Keiichirou 01 February 2004 (has links)
No description available.
3

A Higher-Order Knuth-Bendix Procedure and Its Applications

CHIBA, Yuki, KUSAKARI, Keiichirou 01 April 2007 (has links)
No description available.
4

Static Dependency Pair Method for Simply-Typed Term Rewriting and Related Technique

SAKAI, Masahiko, KUSAKARI, Keiichirou 01 February 2009 (has links)
No description available.
5

Primitive Inductive Theorems Bridge Implicit Induction Methods and Inductive Theorems in Higher-Order Rewriting

KUSAKARI, Keiichirou, SAKAI, Masahiko, SAKABE, Toshiki 12 1900 (has links)
No description available.

Page generated in 0.113 seconds