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 "isomorphisms considered as equalities projecting functions and enhancing partial application through an implementation of λ"):
  Abstract: We propose an implementation of λ+, a recently introduced simply typed lambda-calculus with pairs where isomorphic types are made equal. The rewrite system of λ+ is a rewrite system modulo an equivalence relation, which makes its implementation non-trivial. We also extend λ+ with natural numbers and general recursion and use Bekic's theorem to split mutual recursions. This splitting, together with the features of λ+, allows for a novel way of program transformation by reduction, by projecting a function before it is applied in order to simplify it. Also, currying together with the associativity and commutativity of pairs gives an enhanced form of partial application.

Includes members:
  Member "the vectorial λ calculus":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "extensional proofs in a propositional logic modulo isomorphisms")
  Member "quantum superpositions and projective measurement in the lambda calculus":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the vectorial λ calculus")
  Member "simply typed lambda calculus modulo type isomorphisms":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the vectorial λ calculus")
  Member "elaborating intersection and union types":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "bidirectional typing")
  Member "call by value non determinism in a linear logic type discipline":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "types by need extended version")
  Member "non idempotent intersection types and strong normalisation":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "types by need extended version")
  Member "bounding normalization time through intersection types":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "the vectorial λ calculus")
  Member "a system f accounting for scalars":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "extensional proofs in a propositional logic modulo isomorphisms")

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)