Efficient algorithms for isomorphisms of simple types (Q5892119): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: TREX / 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.1145/604131.604146 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2003399024 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4301602 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular expression pattern matching for XML / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411812 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2778806 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4409150 / rank
 
Normal rank

Latest revision as of 18:54, 10 July 2024

scientific article; zbMATH DE number 6481293
Language Label Description Also known as
English
Efficient algorithms for isomorphisms of simple types
scientific article; zbMATH DE number 6481293

    Statements

    Efficient algorithms for isomorphisms of simple types (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    11 September 2015
    0 references
    0 references
    first-order isomorphism
    0 references
    linear isomorphism
    0 references
    non-recursive types
    0 references
    simple types
    0 references
    type signature
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references