Lambda lifting: transforming programs to recursive equations
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
Information and Computation - Semantics of Data Types
Mechanical procedure for proof construction via closed terms in typed &lgr; calculus
Journal of Automated Reasoning
Partial polymorphic type inference and higher-order unification
LFP '88 Proceedings of the 1988 ACM conference on LISP and functional programming
Proofs and types
Higher-order unification revisited: Complete sets of transformations
Journal of Symbolic Computation
Higher-order unification with dependent function types
RTA-89 Proceedings of the 3rd international conference on Rewriting Techniques and Applications
CADE-10 Proceedings of the tenth international conference on Automated deduction
Programming by example and proving by example using higher-order unification
CADE-10 Proceedings of the tenth international conference on Automated deduction
Logic programming in the LF logical framework
Logical frameworks
Simple second-order languages for which unification is undecidable
Theoretical Computer Science
A framework for defining logics
Journal of the ACM (JACM)
Unification under a mixed prefix
Journal of Symbolic Computation
Higher-order unification via combinators
Theoretical Computer Science
Theoretical Computer Science
Handbook of logic in computer science (vol. 2)
Lambda-calculus, types and models
Lambda-calculus, types and models
Higher-order equational logic programming
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Confluence properties of weak and strong calculi of explicit substitutions
Journal of the ACM (JACM)
Second-order unification and type inference for Church-style polymorphism
POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A notation for lambda terms. A generalization of environment
Theoretical Computer Science
Completion of rewrite systems with membership constraints. Part II: constraint solving
Journal of Symbolic Computation - Special issue: order-sorted rewriting
Higher-order rewrite systems and their confluence
Theoretical Computer Science - Special issue: rewriting systems and applications
On rewrite constraints and context unification
Information Processing Letters - Special issue analytical theory of fuzzy control with applications
Solving Higher-Order Equations: From Logic to Programming
Solving Higher-Order Equations: From Logic to Programming
Higher-Order Rigid E-Unification
LPAR '94 Proceedings of the 5th International Conference on Logic Programming and Automated Reasoning
The Undecidability of Typability in the Lambda-Pi-Calculus
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
Inductive Definitions in the system Coq - Rules and Properties
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
On Equivalence Classes of Interpolation Equations
TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
Third-Order Matching in the Presence of Type Constructors
TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
Lambda-calculus, Combinators and the Comprehension Scheme
TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
Decidability of All Minimal Models
TYPES '95 Selected papers from the International Workshop on Types for Proofs and Programs
Linear Interpolation for the Higher-Order Matching Problem
TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Implementation of Higher-Order Unification Based on Calculus of Explicit Substitution
SOFSEM '95 Proceedings of the 22nd Seminar on Current Trends in Theory and Practice of Informatics
Linear Second-Order Unification and Context Unification with Tree-Regular Constraints
RTA '00 Proceedings of the 11th 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 Conditional Rewriting and Narrowing
CCL '94 Proceedings of the First International Conference on Constraints in Computational Logics
Modular AC Unification of Higher-Order Patterns
CCL '94 Proceedings of the First International Conference on Constraints in Computational Logics
Higher-Order Equational Unification via Explicit Substitutions
ALP '97-HOA '97 Proceedings of the 6th International Joint Conference on Algebraic and Logic Programming
Higher-Order Matching and Tree Automata
CSL '97 Selected Papers from the11th International Workshop on Computer Science Logic
Third-Order Matching in the Polymorphic Lambda Calculus
HOA '95 Selected Papers from the Second International Workshop on Higher-Order Algebra, Logic, and Term Rewriting
A Combinatory Logic Approach to Higher-order E-unification (Extended Abstract)
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Decidable Higher-Order Unification Problems
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
Unification in an Extensional Lambda Calculus with Ordered Function Sorts and Constant Overloading
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
Theory and Practice of Minimal Modular Higher-Order E-Unification
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
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
Handbook of automated reasoning
Proof-assistants using dependent type systems
Handbook of automated reasoning
Higher-order Unification via Explicit Substitutions
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Linear higher-order pre-unification
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Super-combinators a new implementation method for applicative languages
LFP '82 Proceedings of the 1982 ACM symposium on LISP and functional programming
Constrained resolution: a complete method for higher-order logic.
Constrained resolution: a complete method for higher-order logic.
The complexity of unification.
The complexity of unification.
Extensions and applications of higher-order unification
Extensions and applications of higher-order unification
HOL-λσ: an intentional first-order expression of higher-order logic
Mathematical Structures in Computer Science
Some uses of higher-order logic in computational linguistics
ACL '86 Proceedings of the 24th annual meeting on Association for Computational Linguistics
Type classes with more higher-order polymorphism
Proceedings of the seventh ACM SIGPLAN international conference on Functional programming
Complexity and Algorithms for the Matching of Bag and Set Terms
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Higher Order Unification 30 Years Later
TPHOLs '02 Proceedings of the 15th International Conference on Theorem Proving in Higher Order Logics
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
Handbook of automated reasoning
Handbook of automated reasoning
Encoding two-valued nonclassical logics in classical logic
Handbook of automated reasoning
Combining superposition, sorts and splitting
Handbook of automated reasoning
Numbering matters: first-order canonical forms for second-order recursive types
Proceedings of the ninth ACM SIGPLAN international conference on Functional programming
Theoretical Computer Science
A comprehensive combination framework
ACM Transactions on Computational Logic (TOCL)
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Nominal Unification from a Higher-Order Perspective
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
A Clausal Approach to Proof Analysis in Second-Order Logic
LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
Probabilistic modelling, inference and learning using logical theories
Annals of Mathematics and Artificial Intelligence
Automated deduction for verification
ACM Computing Surveys (CSUR)
Decidability of bounded higher-order unification
Journal of Symbolic Computation
On the complexity of higher-order matching in the linear λ-calculus
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Declarative programming for agent applications
Autonomous Agents and Multi-Agent Systems
Matching modulo superdevelopments application to second-order matching
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Stratified context unification is NP-complete
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Invited contribution: a comprehensive framework for combined decision procedures
FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
A tool for automated theorem proving in agda
TYPES'04 Proceedings of the 2004 international conference on Types for Proofs and Programs
Higher-order matching and games
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Nominal Unification from a Higher-Order Perspective
ACM Transactions on Computational Logic (TOCL)
Bounded second-order unification is NP-complete
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Higher-Order rewriting: framework, confluence and termination
Processes, Terms and Cycles
Complete completion using types and weights
Proceedings of the 34th ACM SIGPLAN conference on Programming language design and implementation
| Hi-index | 0.00 |