human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "a role for dependent types in haskell extended version"):
  Abstract: Modern Haskell supports zero-cost coercions, a mechanism where types that share the same run-time representation may be freely converted between. To make sure such conversions are safe and desirable, this feature relies on a mechanism of roles to prohibit invalid coercions. In this work, we show how to integrate roles with dependent type systems and prove, using the Coq proof assistant, that the resulting system is sound. We have designed this work as a foundation for the addition of dependent types to the Glasgow Haskell Compiler, but we also expect that it will be of use to designers of other dependently-typed languages who might want to adopt Haskell's safe coercions feature.

Includes members:
  Member "generic zero cost reuse for dependent types":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "elaborating inductive definitions and course of values induction in cedille")
  Member "models of type theory with strict equality":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "free higher groups in homotopy type theory")
  Member "dependent types in haskell theory and practice":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "kind inference for datatypes")
  Member "cubical type theory a constructive interpretation of the univalence axiom":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a cubical language for bishop sets")
  Member "extending homotopy type theory with strict equality":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "free higher groups in homotopy type theory")
  Member "on irrelevance and algorithmic equality in predicative type theory":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a cubical language for bishop sets")

Question: Please tell me which class the source paper belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.PL(Programming Languages)