A unification algorithm for typed \(\bar\lambda\)-calculus (Q1227601): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Resolution in type theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A formulation of the simple theory of types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5677084 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5686017 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5663463 / 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: Application à la viscoélasticité non linéaire du calcul symbolique à plusieurs variables / 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: A Complete Mechanization of Second-Order Type Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5624683 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Machine-Oriented Logic Based on the Resolution Principle / rank
 
Normal rank

Latest revision as of 19:07, 12 June 2024

scientific article
Language Label Description Also known as
English
A unification algorithm for typed \(\bar\lambda\)-calculus
scientific article

    Statements