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 "imperative functional programs that explain their work"):
  Abstract: Program slicing provides explanations that illustrate how program outputs were produced from inputs. We build on an approach introduced in prior work by Perera et al., where dynamic slicing was defined for pure higher-order functional programs as a Galois connection between lattices of partial inputs and partial outputs. We extend this approach to imperative functional programs that combine higher-order programming with references and exceptions. We present proofs of correctness and optimality of our approach and a proof-of-concept implementation and experimental evaluation.

Includes members:
  Member "dynamic witnesses for static type errors or ill typed programs usually go wrong":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "live functional programming with typed holes")
  Member "causally consistent dynamic slicing":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "verified self explaining computation")
  Member "hazelnut a bidirectionally typed structure editor calculus":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "foundations of a live data exploration environment")
  Member "constructive galois connections taming the galois connection framework for mechanized metatheory":
    also connected through other hyperedges:
      (none)
  Member "database queries that explain their work":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "language integrated provenance by trace analysis")
  Member "a core calculus for provenance":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "language integrated provenance by trace analysis")

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)