Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Anastasiya Kravchuk-Kirilyuk

dblp:274/7991 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2024
0009-0001-0357-9690ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
1 paper
Programming languages and type systems · 100%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Programming languages and type systems › type systems › polymorphism
family polymorphism
0.812024
Persimmon: Nested Family Polymorphism with Extensible Variant Types · Proc. ACM Program. Lang. 2024
Programming languages and type systems › type systems › type soundness
progress and preservation
0.212024
Persimmon: Nested Family Polymorphism with Extensible Variant Types · Proc. ACM Program. Lang. 2024
Programming languages and type systems › type systems
type soundness
0.212024
Persimmon: Nested Family Polymorphism with Extensible Variant Types · Proc. ACM Program. Lang. 2024

Methods — techniques the papers use, named apart from their topics

type system · 0.8translation to scala · 0.8
YearPublicationVenuePosition
2024 Persimmon: Nested Family Polymorphism with Extensible Variant Types
abstract
Many obstacles stand in the way of modular, extensible code. Some language constructs, such as pattern matching, are not easily extensible. Inherited code may not be type safe in the presence of extended types. The burden of setting up design patterns can discourage users, and parameter clutter can make the code less readable. Given these challenges, it is no wonder that extensibility often gives way to code duplication. We present our solution: Persimmon, a functional system with nested family polymorphism, extensible variant types, and extensible pattern matching. Most constructs in our language are built-in "extensibility hooks," cutting down on the parameter clutter and user burden associated with extensible code. Persimmon preserves the relationships between nested families upon inheritance, enabling extensibility at a large scale. Since nested family polymorphism can express composable extensions, Persimmon supports mixins via an encoding. We show how Persimmon can be compiled into a functional language without extensible variants with our translation to Scala. Finally, we show that our system is sound by proving the properties of progress and preservation.
Anastasiya Kravchuk-Kirilyuk, Gary Feng, Jonas Iskander, Yizhou Zhang 0001, Nada Amin
Proc. ACM Program. Lang.1