Decidable higher-order unification problems (Q5210802): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Elf / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: TPS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Nuprl / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/3-540-58156-1_46 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1507462387 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3086786 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The lambda calculus. Its syntax and semantics. Rev. ed. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3787520 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Third order matching is decidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unification algorithm for second-order monadic terms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple second-order languages for which unification is undecidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994895 / 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: Synthesis of rewrite programs by higher-order and semantic unification / 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: Q3883561 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4283239 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logic programming language with lambda-abstraction, function variables, and simple unification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4012879 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Higher-order narrowing with definitional trees / 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: Q2914641 / rank
 
Normal rank

Latest revision as of 12:23, 21 July 2024

scientific article; zbMATH DE number 7154579
Language Label Description Also known as
English
Decidable higher-order unification problems
scientific article; zbMATH DE number 7154579

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references