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 cost analysis for functional imperative programs"):
  Abstract: Relational cost analysis aims at formally establishing bounds on the difference in the evaluation costs of two programs. As a particular case, one can also use relational cost analysis to establish bounds on the difference in the evaluation cost of the same program on two different inputs. One way to perform relational cost analysis is to use a relational type-and-effect system that supports reasoning about relations between two executions of two programs. #R##N#Building on this basic idea, we present a type-and-effect system, called ARel, for reasoning about the relative cost of array-manipulating, higher-order functional-imperative programs. The key ingredient of our approach is a new lightweight type refinement discipline that we use to track relations (differences) between two arrays. This discipline combined with Hoare-style triples built into the types allows us to express and establish precise relative costs of several interesting programs which imperatively update their data.

Includes members:
  Member "verifying and synthesizing constant resource implementations with types":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "exponential automatic amortized resource analysis")
  Member "bidirectional type checking for relational properties":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "duet an expressive higher order language and linear type system for statically enforcing differential privacy")
  Member "automating induction for solving horn clauses":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "specification and inference of trace refinement relations")
  Member "higher order approximate relational refinement types for mechanism design and differential privacy":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "guidelines for implementing and auditing differentially private systems")
  Member "effect dependent transformations for concurrent programs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "factorisation systems for logical relations and monadic lifting in type and effect system semantics")
  Member "a simple and scalable static analysis for bound analysis and amortized complexity analysis":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "cost analysis of nondeterministic probabilistic programs")
  Member "linear dependent types and relative completeness":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "session types with arithmetic refinements and their application to work analysis")
  Member "abstract effects and proof relevant logical relations":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "on the versatility of open logical relations continuity automatic differentiation and a containment theorem")

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)