Generalized and Formalized Uncurrying (Q3172898): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: CoLoR / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Isabelle/HOL / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Tyrolean / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Jambox / 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/978-3-642-24364-6_17 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1849654074 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Term Rewriting and All That / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mechanizing and improving dependency pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Frontiers of Combining Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uncurrying for Termination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparing curried and uncurried rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isabelle/HOL. A proof assistant for higher-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Signature Extensions Preserve Termination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certification of Termination Proofs Using CeTA / rank
 
Normal rank

Latest revision as of 12:39, 4 July 2024

scientific article
Language Label Description Also known as
English
Generalized and Formalized Uncurrying
scientific article

    Statements

    Generalized and Formalized Uncurrying (English)
    0 references
    0 references
    0 references
    7 October 2011
    0 references
    0 references
    uncurrying
    0 references
    termination
    0 references
    formalization
    0 references
    interactive theorem proving
    0 references
    dependency pairs
    0 references
    term rewriting
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references