Higher-order unification with dependent function types (Q5055716): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3343471 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3787520 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3789101 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5625124 / 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: A framework for defining logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4722037 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unification algorithm for typed \(\bar\lambda\)-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving and applying program transformations expressed with second-order patterns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform proofs as a foundation for logic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of type polymorphism in programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proofs of the normalization and Church-Rosser theorems for the typed \(\lambda\)-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4068054 / 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: Q3721784 / rank
 
Normal rank

Latest revision as of 01:57, 31 July 2024

scientific article; zbMATH DE number 7631112
Language Label Description Also known as
English
Higher-order unification with dependent function types
scientific article; zbMATH DE number 7631112

    Statements

    Identifiers

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