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 "do be do be do"):
  Abstract: We explore the design and implementation of Frank, a strict functional programming language with a bidirectional effect type system designed from the ground up around a novel variant of Plotkin and Pretnar's effect handler abstraction. #R##N#Effect handlers provide an abstraction for modular effectful programming: a handler acts as an interpreter for a collection of commands whose interfaces are statically tracked by the type system. However, Frank eliminates the need for an additional effect handling construct by generalising the basic mechanism of functional abstraction itself. A function is simply the special case of a Frank operator that interprets no commands. Moreover, Frank's operators can be multihandlers which simultaneously interpret commands from several sources at once, without disturbing the direct style of functional programming with values. #R##N#Effect typing in Frank employs a novel form of effect polymorphism which avoid mentioning effect variables in source code. This is achieved by propagating an ambient ability inwards, rather than accumulating unions of potential effects outwards. #R##N#We introduce Frank by example, and then give a formal account of the Frank type system and its semantics. We introduce Core Frank by elaborating Frank operators into functions, case expressions, and unary handlers, and then give a sound small-step operational semantics for Core Frank. #R##N#Programming with effects and handlers is in its infancy. We contribute an exploration of future possibilities, particularly in combination with other forms of rich type system.

Includes members:
  Member "on the expressive power of user defined effects effect handlers monadic reflection delimited control":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "handling polymorphic algebraic effects")
  Member "programming with algebraic effects and handlers":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a cubical language for bishop sets")
  Member "inferring algebraic effects":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "no value restriction is needed for algebraic effects and handlers")
  Member "koka programming with row polymorphic effect types":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "gradual typing for extensibility by rows")
  Member "an effect system for algebraic effects and handlers":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "asynchronous effects")
  Member "handling algebraic effects":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "signature restriction for polymorphic algebraic effects")
  Member "programming interfaces and basic topology":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "infinite types infinite data infinite interaction")

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)