Type inference with polymorphic recursion
ACM Transactions on Programming Languages and Systems (TOPLAS)
Type-based useless variable elimination
PEPM '00 Proceedings of the 2000 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation
Type-Based Useless-Variable Elimination
Higher-Order and Symbolic Computation
Loop detection in term rewriting using the eliminating unfoldings
Theoretical Computer Science
Detecting non-termination of term rewriting systems using an unfolding operator
LOPSTR'06 Proceedings of the 16th international conference on Logic-based program synthesis and transformation
Proving and disproving termination of higher-order functions
FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
| Hi-index | 5.23 |