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 "live functional programming with typed holes"):
  Abstract: This paper develops a dynamic semantics for incomplete functional programs, starting from the static semantics developed in recent work on Hazelnut. We model incomplete functional programs as expressions with holes, with empty holes standing for missing expressions or types, and non-empty holes operating as membranes around static and dynamic type inconsistencies. Rather than aborting when evaluation encounters any of these holes as in some existing systems, evaluation proceeds around holes, tracking the closure around each hole instance as it flows through the remainder of the program. Editor services can use the information in these hole closures to help the programmer develop and confirm their mental model of the behavior of the complete portions of the program as they decide how to fill the remaining holes. Hole closures also enable a fill-and-resume operation that avoids the need to restart evaluation after edits that amount to hole filling. Formally, the semantics borrows machinery from both gradual type theory (which supplies the basis for handling unfilled type holes) and contextual modal type theory (which supplies a logical basis for hole closures), combining these and developing additional machinery necessary to continue evaluation past holes while maintaining type safety. We have mechanized the metatheory of the core calculus, called Hazelnut Live, using the Agda proof assistant. #R##N#We have also implemented these ideas into the Hazel programming environment. The implementation inserts holes automatically, following the Hazelnut edit action calculus, to guarantee that every editor state has some (possibly incomplete) type. Taken together with this paper's type safety property, the result is a proof-of-concept live programming environment where rich dynamic feedback is truly available without gaps, i.e. for every reachable editor state.

Includes members:
  Member "exploratory and live programming and coding a literature study comparing perspectives on liveness":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "foundations of a live data exploration environment")
  Member "augmenting source code lines with sample variable values":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "draw this object a study of debugging representations")
  Member "using elm to introduce algebraic thinking to k 8 students":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "examples and results from a bsc level course on domain specific languages of mathematics")
  Member "imperative functional programs that explain their work":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "language integrated provenance by trace analysis")
  Member "toward semantic foundations for program editors":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "d euce a lightweight user interface for structured editing")
  Member "a survey of symbolic execution techniques":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "cbr controlled burst recording")
  Member "dynamic witnesses for static type errors or ill typed programs usually go wrong":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "gradual liquid type inference")
  Member "programmatic and direct manipulation together at last":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "program sketching with live bidirectional evaluation")

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)