Algebraic data types are a distinctive feature of statically typed functional programming languages. Existing gradual typing systems support algebraic data types with set-theoretic approaches, e.g., union and intersection types. What would it look like for a gradual typing system to support algebraic data types directly? We describe our early explorations of the design space of gradually typed algebraic data types using the Abstracting Gradual Typing methodology.