Miranda: a non-strict functional language with polymorphic types
Proc. of a conference on Functional programming languages and computer architecture
Introduction to combinators and &lgr;-calculus
Introduction to combinators and &lgr;-calculus
An introduction to mathematical logic and type theory: to truth through proof
An introduction to mathematical logic and type theory: to truth through proof
ML for the working programmer
Handbook of theoretical computer science (vol. B)
Functional programming and lambda calculus
Handbook of theoretical computer science (vol. B)
The clausal theory of types
Word unification and transformation of generalized equations
Journal of Automated Reasoning
Handbook of logic in artificial intelligence and logic programming
Complexity of Makanin's algorithm
Journal of the ACM (JACM)
Completion of rewrite systems with membership constraints. Part I: deduction rules
Journal of Symbolic Computation - Special issue: order-sorted rewriting
On the undecidability of second-order unification
Information and Computation - Special issue on RTA-98
On rewrite constraints and context unification
Information Processing Letters - Special issue analytical theory of fuzzy control with applications
Solvability of context equations with two context variable is decidable
Journal of Symbolic Computation
forall exists*-Equational Theory of Context Unification is Pi10-Hard
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
Makanin's Algorithm for Word Equations - Two Improvements and a Generalization
IWWERT '90 Proceedings of the First International Workshop on Word Equations and Related Topics
On the Exponent of Periodicity of Minimal Solutions of Context Equation
RTA '98 Proceedings of the 9th International Conference on Rewriting Techniques and Applications
Linear Second-Order Unification and Context Unification with Tree-Regular Constraints
RTA '00 Proceedings of the 11th International Conference on Rewriting Techniques and Applications
A Decidable Variant of Higher Order Matching
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Linear Second-Order Unification
RTA '96 Proceedings of the 7th International Conference on Rewriting Techniques and Applications
Higher-Order Matching and Tree Automata
CSL '97 Selected Papers from the11th International Workshop on Computer Science Logic
Decidability of Bounded Higher-Order Unification
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
On Equality Up-to Constraints over Finite Trees, Context Unification, and One-Step Rewriting
CADE-14 Proceedings of the 14th International Conference on Automated Deduction
Handbook of automated reasoning
Higher-order unification and matching
Handbook of automated reasoning
Handbook of automated reasoning
Linear higher-order pre-unification
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
The Security of Individual RSA Bits
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Satisfiability of Word Equations with Constants is in PSPACE
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
HOPE: An experimental applicative language
LFP '80 Proceedings of the 1980 ACM conference on LISP and functional programming
Decidability of fourth-order matching
Mathematical Structures in Computer Science
Decidability of bounded second order unification
Information and Computation
| Hi-index | 0.00 |
It is shown that unifiability of terms in the simply typed lambda calculus with @b and @h rules becomes decidable if there is a bound on the number of bound variables and lambdas in a unifier in @h-expanded @b-normal form.