Unification under a mixed prefix
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3878393 (Why is no real title available?)
- scientific article; zbMATH DE number 4053062 (Why is no real title available?)
- scientific article; zbMATH DE number 65531 (Why is no real title available?)
- scientific article; zbMATH DE number 1158760 (Why is no real title available?)
- scientific article; zbMATH DE number 3993540 (Why is no real title available?)
- scientific article; zbMATH DE number 3999882 (Why is no real title available?)
- A Complete Mechanization of Second-Order Type Theory
- A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification
- A unification algorithm for typed \(\overline\lambda\)-calculus
- Completeness in the theory of types
- General models and extensionality
- Higher-order Horn clauses
- Higher-order unification revisited: Complete sets of transformations
- Higher-order unification with dependent function types
- Intuitionistic propositional logic is polynomial-space complete
- Mechanizing \(\omega\)-order type theory through unification
- Natural deduction as higher-order resolution
- On the existence of closed terms in the typed lambda calculus II: Transformations of unification problems
- Proving and applying program transformations expressed with second-order patterns
- Resolution in type theory
- The foundation of a generic theorem prover
- The undecidability of the second-order unification problem
- The undecidability of unification in third order logic
Cited in
(34)- COCHIS: stable and coherent implicits
- Higher-Order Multi-Valued Resolution
- Curry-Howard for incomplete first-order logic derivations using one-and-a-half level terms
- A two-level logic approach to reasoning about computations
- Verifying termination and reduction properties about higher-order logic programs
- Third order matching is decidable
- Third-order matching in the polymorphic lambda calculus
- Types for modules
- Proof-term synthesis on dependent-type systems via explicit substitutions
- Higher order unification via explicit substitutions
- Set theory for verification. I: From foundations to functions
- Recasting ML\(^{\text F}\)
- The undecidability of proof search when equality is a logical connective
- Nominal abstraction
- Choices in representation and reduction strategies for lambda terms in intensional contexts
- On the role of names in reasoning about \(\lambda\)-tree syntax specifications
- Implementing type theory in higher order constraint logic programming
- PNL to HOL: from the logic of nominal sets to the logic of higher-order functions
- A Survey of the Proof-Theoretic Foundations of Logic Programming
- Mechanized metatheory revisited
- Implementing tactics and tacticals in a higher-order logic programming language
- Higher order disunification: some decidable cases
- Tactics and parameters
- A colored version of the \(\lambda\)-calculus
- Proof generalization in \(\mathrm {LK}\) by second order unifier minimization
- Idris, a general-purpose dependently typed programming language: Design and implementation
- Translating higher-order clauses to first-order clauses
- Reasoning in Abella about structural operational semantics specifications
- Functions-as-constructors higher-order unification: extended pattern unification
- Hybrid linear logic, revisited
- A proof procedure for the logic of hereditary Harrop formulas
- Hilbert's epsilon as an operator of indefinite committed choice
- Unification with extended patterns
- On extensibility of proof checkers
This page was built for publication: Unification under a mixed prefix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1201348)
