On the Modularity of Deciding Call-by-Need
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
Modularity of strong normalization in the algebraic-λ-cube
Journal of Functional Programming
Decidable call-by-need computations in term rewriting
Information and Computation
Polymorphic higher-order recursive path orderings
Journal of the ACM (JACM)
Higher-order semantic labelling for inductive datatype systems
Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Decidable call-by-need computations in term rewriting
Information and Computation
Remarks on Thatte's transformation of term rewriting systems
Information and Computation
Argument filterings and usable rules for simply typed dependency pairs
FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
Automated termination proofs for haskell by term rewriting
ACM Transactions on Programming Languages and Systems (TOPLAS)
Simplifying algebraic functional systems
CAI'11 Proceedings of the 4th international conference on Algebraic informatics
Harnessing first order termination provers using higher order dependency pairs
FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
Generalized and formalized uncurrying
FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
Proving and disproving termination of higher-order functions
FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
| Hi-index | 0.00 |