Faculty

Institution

Unit

Venue

Dr. Patricia Johann

Professor

Appalachian State University

Affiliations

Appalachian State University

University College

College Of Arts And Sciences

College of Arts and Sciences

Department Of Computer Science

College Of Arts And Sciences

Department Of Computer Science

Dr. Patricia Johann is currently serving as an Appalachian State University Professor at Appalachian State University.

Honors

Create free account to unlock more features

Experiences

Create free account to unlock more features

Education

Create free account to unlock more features

Dr. Patricia Johann

Appalachian State University

Professor

You can click a keyword to filter the displayed items

logic in computer science mathematics mathematical logic formal methods automated reasoning computer science category theory algebra mathematical sciences automated deduction type theory programming languages higher category theory applied mathematics formal verification semantics pure mathematics functional programming generic programming categorical model linguistics algebraic logic parameterized complexity syntax general systems combinatorial theory formal semantics categorical logic structural resolution software analysis formal specification algebraic structures computational logic logical frameworks logic programming dependently typed programming type systems inductive reasoning databases information fusion data privacy data security pragmatics nuclear fusion geometric topology mathematical programming declarative programming programming language theory equivalence checking extremal set theory proof complexity algebraic analysis model theory formal systems abstract algebra data exchange data manipulation data augmentation interaction effects formal notation operational semantics structured programming free theorems generic operational metatheory dependent type theory initial algebra semantics initial algebras parametric polymorphism higher-kinded data types notational definitions selective strictness coinductive proof search horn clause logic type refinement indexed induction monadic augment

Notable Scholarly Works

Notable Federal Grants

Collaborators

Deep Induction for Inductive Families. Lecture notes in computer science (2025)

artificial intelligenceinferencedeep inductionmachine learning researchcomputational intelligencedata sciencesymbolic machine learninginductive reasoninginductive inferencemachine learning

Early Announcement: Parametricity for Gadts. arXiv (Cornell University) (2024)

informaticsexploratory data analysisstatistical methodologystatistical sciencetechnologyquantitative science studiesstatistical theoryinformation scienceinformation managementapplied statisticsearly announcementanalyticsdata analyticsstatisticsinformation technology

Gadts Are Not (Even Partial) Functors. Mathematical Structures in Computer Science (2024)

higher category theorycategorical logiccategory theorycategorical model

Characterizing Functions Mappable Over Gadts. Lecture notes in computer science (2022)

computational sciencemathematical sciencesgeneralized functionsfunctions mappableparameterized complexityscientific computingmathematicsfunction theorytheory of computationfunction spacesapplied mathematicsformal methods

(Deep) Induction Rules for Gadts. (2022)

logic in computer scienceknowledge discoveryinferencedata scienceautomated reasoningtheory of computationinductive logic programminginductive inferenceinduction rules

Gadts, Functoriality, Parametricity: Pick Two. Electronic Proceedings in Theoretical Computer Science (2022)

parameterized complexitypure mathematicscategory theoryhigher category theorymathematicsgeneral systemsfunction spacesmathematical sciences

How Functorial Are (Deep) Gadts?. arXiv (Cornell University) (2022)

algebrahigher category theorycategory theorymathematicsfunctorial arequantitative science studiescategorical model

Deep Induction: Induction Rules for (Truly) Nested Types. (2021)

computer scienceautomated deductionlogic in computer sciencemathematical logicinferencerecursive functiondeep inductionpure mathematicstype theoryautomated reasoningtheory of computationinductive inferenceformal methods

Parametricity for Nested Types and Gadts. Logical Methods in Computer Science (2021)

automated deductionnested typesmathematical logicparameterized complexitycategory theorymathematicstype theorygeneric programmingfunction spaces

Parametricity for Primitive Nested Types. (2021)

automated deductionlogic in computer sciencemathematical sciencesmathematical logicalgebrapure mathematicsmathematicstype theorypolymorphism (computer science)generic programmingprimitive nested typesformal methods

1
2
3
4
5
10 / page

Dr. Patricia Johann

Professor

Appalachian State University

Affiliations

Appalachian State University

University College

College Of Arts And Sciences

College of Arts and Sciences

Department Of Computer Science

College Of Arts And Sciences

Department Of Computer Science

Dr. Patricia Johann is currently serving as an Appalachian State University Professor at Appalachian State University.

Honors

Create free account to unlock more features

Experiences

Create free account to unlock more features

Education

Create free account to unlock more features

Dr. Patricia Johann

Appalachian State University

Professor

You can click a keyword to filter the displayed items

Notable Scholarly Works

Notable Federal Grants

Collaborators

Deep Induction for Inductive Families. Lecture notes in computer science (2025)

artificial intelligenceinferencedeep inductionmachine learning researchcomputational intelligencedata sciencesymbolic machine learninginductive reasoninginductive inferencemachine learning

Early Announcement: Parametricity for Gadts. arXiv (Cornell University) (2024)

Gadts Are Not (Even Partial) Functors. Mathematical Structures in Computer Science (2024)

higher category theorycategorical logiccategory theorycategorical model

Characterizing Functions Mappable Over Gadts. Lecture notes in computer science (2022)

(Deep) Induction Rules for Gadts. (2022)

logic in computer scienceknowledge discoveryinferencedata scienceautomated reasoningtheory of computationinductive logic programminginductive inferenceinduction rules

Gadts, Functoriality, Parametricity: Pick Two. Electronic Proceedings in Theoretical Computer Science (2022)

parameterized complexitypure mathematicscategory theoryhigher category theorymathematicsgeneral systemsfunction spacesmathematical sciences

How Functorial Are (Deep) Gadts?. arXiv (Cornell University) (2022)

algebrahigher category theorycategory theorymathematicsfunctorial arequantitative science studiescategorical model

Deep Induction: Induction Rules for (Truly) Nested Types. (2021)

Parametricity for Nested Types and Gadts. Logical Methods in Computer Science (2021)

automated deductionnested typesmathematical logicparameterized complexitycategory theorymathematicstype theorygeneric programmingfunction spaces

Parametricity for Primitive Nested Types. (2021)

1
2
3
4
5
10 / page