NDLTD Global ETD Search
  • Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1
  • Tagged with
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 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 1 of 1 (0.05 seconds)

Spelling suggestions: "subject:"3trong computability"" "subject:"3trong imputability""

1

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

草刈, 圭一朗, Kusakari, Keiichirou, 酒井, 正彦, Sakai, Masahiko January 2007 (has links)
No description available.
Termination
Simply-Typed Term Rewriting System
Plain Function-Passing
Dependency Pair
Strong Computability

Page generated in 0.0531 seconds