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 "non idempotent types for classical calculi in natural deduction style"):
  Abstract: In the first part of this paper, we define two resource aware typing systems for the $\lambda\mu$-calculus based on non-idempotent intersection and union types. The non-idempotent approach provides very simple combinatorial arguments --based on decreasing measures of type derivations-- to characterize head and strongly normalizing terms. Moreover, typability provides upper bounds for the lengths of the head-reduction and the maximal reduction sequences to normal-form. #R##N#In the second part of this paper, the $\lambda\mu$-calculus is refined to a resource aware interpretation called $\lambda\mu$r, which is inspired by the substitution at a distance paradigm. The small-step $\lambda\mu$r-calculus turns out to be compatible with a natural extension of the non-idempotent interpretations of $\lambda\mu$, i.e. $\lambda\mu$r-reduction preserves and decreases typing derivations in an extended appropriate typing system. We thus derive a simple arithmetical characterization of strongly $\lambda\mu$r-normalizing terms by means of typing.

Includes members:
  Member "non idempotent intersection types and strong normalisation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "types by need extended version")
  Member "sound and complete typing for lambda mu":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "characterisation of approximation and head normalisation for λμ using strict intersection types")
  Member "a theory of explicit substitutions with safe and full composition":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "reduction monads and their signatures")
  Member "execution time of lambda terms via denotational semantics and intersection types":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the bang calculus revisited")

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.LO(Logic in Computer Science)