A combinatory logic approach to higher-order E-unification (Q673971): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Conditional rewrite rules: Confluence and termination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polymorphic rewriting conserves algebraic strong normalization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5565113 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination of rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385532 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adding algebraic rewriting to the untyped lambda calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Higher-order unification via combinators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Higher-order unification with dependent function types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete sets of transformations for general E-unification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Higher-order unification revisited: Complete sets of transformations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Axioms for strong reduction in combinatory logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Short Proof of Curry's Normal Form Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4722037 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unification algorithm for typed \(\overline\lambda\)-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4867027 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normal forms in combinatory logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4297316 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3918095 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The decidability of hindley's axioms for strong reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong reduction and normal form in combinatory logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Unification Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385534 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular higher-order E-unification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692880 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3779784 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unification in a combination of arbitrary disjoint equational theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unification theory / rank
 
Normal rank

Latest revision as of 11:29, 27 May 2024

scientific article
Language Label Description Also known as
English
A combinatory logic approach to higher-order E-unification
scientific article

    Statements

    A combinatory logic approach to higher-order E-unification (English)
    0 references
    0 references
    0 references
    28 February 1997
    0 references
    0 references
    0 references
    0 references
    0 references
    first-order equational theory
    0 references