The Inverse Lambda Calculus Algorithm for Typed First Order Logic Lambda Calculus and Its Application to Translating English to FOL (Q2900507): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4570895 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Wide-Coverage Efficient Statistical Parsing with CCG and Log-Linear Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Welfare Economics and Robinson Crusoe the Producer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4722037 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4346206 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical methods in linguistics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of higher-order matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Third order matching is decidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Higher Order   Matching is Undecidable / 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 \(\bar\lambda\)-calculus / rank
 
Normal rank

Latest revision as of 12:35, 5 July 2024

scientific article
Language Label Description Also known as
English
The Inverse Lambda Calculus Algorithm for Typed First Order Logic Lambda Calculus and Its Application to Translating English to FOL
scientific article

    Statements

    Identifiers

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