Higher-order unification via combinators (Q2367541): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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: Q5686017 / 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: The undecidability of the second-order unification problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Principal Type-Scheme of an Object 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: The undecidability of unification in third order logic / 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: Mechanizing \(\omega\)-order type theory through unification / 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: Q4391451 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692880 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Complete Mechanization of Second-Order Type Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3779784 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new implementation technique for applicative languages / rank
 
Normal rank

Latest revision as of 18:28, 17 May 2024

scientific article
Language Label Description Also known as
English
Higher-order unification via combinators
scientific article

    Statements

    Higher-order unification via combinators (English)
    0 references
    2 September 1993
    0 references
    automated theorem proving
    0 references
    type inference
    0 references
    machine learning
    0 references
    program transformation
    0 references
    higher-order unification
    0 references
    typed lambda calculus
    0 references

    Identifiers