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 "relational parametricity for computational effects"):
  Abstract: According to Strachey, a polymorphic program is parametric if it applies a#N#uniform algorithm independently of the type instantiations at which it is#N#applied. The notion of relational parametricity, introduced by Reynolds, is one#N#possible mathematical formulation of this idea. Relational parametricity#N#provides a powerful tool for establishing data abstraction properties, proving#N#equivalences of datatypes, and establishing equalities of programs. Such#N#properties have been well studied in a pure functional setting. Many programs,#N#however, exhibit computational effects, and are not accounted for by the#N#standard theory of relational parametricity. In this paper, we develop a#N#foundational framework for extending the notion of relational parametricity to#N#programming languages with effects.

Includes members:
  Member "logical relations for monadic types":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the versatility of open logical relations continuity automatic differentiation and a containment theorem")
  Member "linear abadi and plotkin logic":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "logical step indexed logical relations")
  Member "relational parametricity and control":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "induction by coinduction and control operators in call by name")

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)