human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "a logical foundation for environment classifiers"
  Abstract: Taha and Nielsen have developed a multi-stage calculus {\lambda}{\alpha} with#N#a sound type system using the notion of environment classifiers. They are#N#special identifiers, with which code fragments and variable declarations are#N#annotated, and their scoping mechanism is used to ensure statically that#N#certain code fragments are closed and safely runnable. In this paper, we#N#investigate the Curry-Howard isomorphism for environment classifiers by#N#developing a typed {\lambda}-calculus {\lambda}|>. It corresponds to#N#multi-modal logic that allows quantification by transition variables---a#N#counterpart of classifiers---which range over (possibly empty) sequences of#N#labeled transitions between possible worlds. This interpretation will reduce#N#the "run" construct---which has a special typing rule in#N#{\lambda}{\alpha}---and embedding of closed code into other code fragments of#N#different stages---which would be only realized by the cross-stage persistence#N#operator in {\lambda}{\alpha}---to merely a special case of classifier#N#application. {\lambda}|> enjoys not only basic properties including subject#N#reduction, confluence, and strong normalization but also an important property#N#as a multi-stage calculus: time-ordered normalization of full reduction. Then,#N#we develop a big-step evaluation semantics for an ML-like language based on#N#{\lambda}|> with its type system and prove that the evaluation of a well-typed#N#{\lambda}|> program is properly staged. We also identify a fragment of the#N#language, where erasure evaluation is possible. Finally, we show that the proof#N#system augmented with a classical axiom is sound and complete with respect to a#N#Kripke semantics of the logic.

Connected through hyperedge HE-1 (induced by source paper "a dependently typed multi stage calculus"):
  with members:
    - "program logics for homogeneous generative run time meta programming"

Connected through hyperedge HE-2 (induced by source paper "modelling homogeneous generative meta programming"):
  with members:
    - "the formalization of syntax based mathematical algorithms using quotation and evaluation"
    - "frameworks for reasoning about syntax that utilize quotation and evaluation"

Connected through hyperedge HE-3 (induced by source paper "program logics for homogeneous generative run time meta programming"):
  with members:
    - "logical reasoning for higher order functions with local state"

Connected through hyperedge HE-4 (induced by source paper "tracking data flow with open closure types"):
  with members:
    - "semi continuous sized types and termination"

Question: Please tell me which class the center node 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)