Concepedia

Functorial Abstraction

Functorial Abstraction is a theoretical construct in generic programming that formalizes the systematic generalization of type-preserving mappings by encapsulating computational patterns into higher-order type constructors endowed with structure-preserving transformations.

2

Publications

51

Citations

7

Authors

3

Institutions

Publications per year

2017–2026

0

Parents

Publications

2

1–2 of 2

Authors

7

  1. TR
    Tim Revell

    University of Strathclyde, United Kingdom

    1 publications · 19 citations

    1

    h-index

  2. NG
    Neil Ghani

    University of Leicester, United Kingdom

    1 publications · 19 citations

    1

    h-index

  3. RH
    Robert Harper

    Carnegie Mellon University, United States

    1 publications · 32 citations

    1

    h-index

  4. PJ
    Patricia Johann

    Rutgers, The State University of New Jersey, United States

    1 publications · 19 citations

    1

    h-index

  5. FO
    Federico Orsanigo

    Appalachian State University, United States

    1 publications · 19 citations

    1

    h-index

1–5 of 7

Institutions

3

  1. Appalachian State University

    Boone, United States

    1 h-index

    1 publications

    19 citations

  2. University of Strathclyde

    Glasgow, United Kingdom

    1 h-index

    4 publications

    76 citations

  3. Carnegie Mellon University

    Pittsburgh, United States

    1 h-index

    2 publications

    64 citations

1–3 of 3

Venues

  1. Electronic Notes in Theoretical Computer Science

    ENTCS · 2 publications · 51 citations

    2

    h-index

1–1