Functional back-ends within the lambda-sigma calculus
Proceedings of the first ACM SIGPLAN international conference on Functional programming
A framework for implementing hypothetical queries
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
A Polymorphic Environment Calculus and its Type-Inference Algorithm
Higher-Order and Symbolic Computation
Theoretical Computer Science
Proof-term synthesis on dependent-type systems via explicit substitutions
Theoretical Computer Science
A Methodological View of Constraint Solving
Constraints
HOL-lambdasigma: An Intentional First-Order Expression of Higher-Order Logic
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
Abstract Syntax for Variable Binders: An Overview
CL '00 Proceedings of the First International Conference on Computational Logic
Higher-order unification and matching
Handbook of automated reasoning
Confluence and Preservation of Strong Normalisation in an Explicit Substitutions Calculus
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
MLF: raising ML to the power of system F
ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
Dependent types and explicit substitutions: a meta-theoretical development
Mathematical Structures in Computer Science
Cut rules and explicit substitutions
Mathematical Structures in Computer Science
Sequent combinators: a Hilbert system for the lambda calculus
Mathematical Structures in Computer Science
Functional runtime systems within the lambda-sigma calculus
Journal of Functional Programming
A modal foundation for meta-variables
MERLIN '03 Proceedings of the 2003 ACM SIGPLAN workshop on Mechanized reasoning about languages with variable binding
Theoretical Computer Science
Resource operators for λ-calculus
Information and Computation
ACM Transactions on Computational Logic (TOCL)
Higher-order term indexing using substitution trees
ACM Transactions on Computational Logic (TOCL)
Extending the explicit substitution paradigm
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Expression reduction systems and extensions: an overview
Processes, Terms and Cycles
Strong reduction for typed lambda calculus with first-class environments
ICICA'12 Proceedings of the Third international conference on Information Computing and Applications
| Hi-index | 0.00 |
Higher-order unification is equational unification for beta-eta- conversion. But it is not first-order equational unification, as substitution has to avoid capture. In this paper higher-order unification is reduced to first-order equational unification in a suitable theory: the lambda-sigma-calculus of explicit substitutions.