Get 20M+ Full-Text Papers For Less Than $1.50/day. Subscribe now for You or Your Team.

Learn More →

Higher-order unification with dependent function types

Higher-order unification with dependent function types http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Rewriting Techniques and Applications, Lecture Notes in Computer Science CrossRef

Higher-order unification with dependent function types

Rewriting Techniques and Applications, Lecture Notes in Computer Science : 121-136 – Jan 1, 1989

Higher-order unification with dependent function types

Rewriting Techniques and Applications, Lecture Notes in Computer Science : 121-136 – Jan 1, 1989

Loading next page...
 
/lp/crossref/higher-order-unification-with-dependent-function-types-kf7oH1SR31

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
CrossRef
ISSN
0302-9743
DOI
10.1007/3-540-51081-8_104
Publisher site
See Article on Publisher Site

Abstract

Journal

Rewriting Techniques and Applications, Lecture Notes in Computer ScienceCrossRef

Published: Jan 1, 1989

There are no references for this article.