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 "higher order program verification via hfl model checking"):
  Abstract: There are two kinds of higher-order extensions of model checking: HORS model checking and HFL model checking. Whilst the former has been applied to automated verification of higher-order functional programs, applications of the latter have not been well studied. In the present paper, we show that various verification problems for functional programs, including may/must-reachability, trace properties, and linear-time temporal properties (and their negations), can be naturally reduced to (extended) HFL model checking. The reductions yield a sound and complete logical characterization of those program properties. Compared with the previous approaches based on HORS model checking, our approach provides a more uniform, streamlined method for higher-order program verification.

Includes members:
  Member "relational semantics of linear logic and higher order model checking":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "intersection types for unboundedness problems")
  Member "a type directed negation elimination":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a type based hfl model checking algorithm")
  Member "finitary semantics of linear logic and higher order model checking":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "intersection types for unboundedness problems")
  Member "higher order program verification as satisfiability modulo theories with algebraic data types":
    also connected through other hyperedges:
      (none)
  Member "model checking process equivalences":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a type based hfl model checking algorithm")
  Member "the complexity of model checking higher order fixpoint logic":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a type based hfl model checking algorithm")

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)