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

Tommaso Petrucciani

dblp:182/2309 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2019
—ORCID · none

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

Software engineering, systems software and programming languages · 2

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 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Programming languages and type systems › type systems
gradual typing
0.412019
Gradual typing: a new perspective · Proc. ACM Program. Lang. 2019
Programming languages and type systems › type systems
polymorphism
0.412019
Gradual typing: a new perspective · Proc. ACM Program. Lang. 2019
Programming languages and type systems › type systems
subtyping
0.412019
Gradual typing: a new perspective · Proc. ACM Program. Lang. 2019
Programming languages and type systems
type systems
0.412019
Gradual typing: a new perspective · Proc. ACM Program. Lang. 2019

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

unification · 0.4tallying · 0.4
YearPublicationVenuePosition
2019 Gradual typing: a new perspective
abstract
We define a new, more semantic interpretation of gradual types and use it to ``gradualize'' two forms of polymorphism: subtyping polymorphism and implicit parametric polymorphism. In particular, we use the new interpretation to define three gradual type systems ---Hindley-Milner, with subtyping, and with union and intersection types--- in terms of two preorders, subtyping and materialization. We define these systems both declaratively ---by adding two subsumption-like rules--- which yields clearer, more intelligible, and streamlined definitions, and algorithmically by reusing existing techniques such as unification and tallying.
Giuseppe Castagna, Victor Lanvin, Tommaso Petrucciani, Jeremy G. Siek
Proc. ACM Program. Lang.3
2016 Set-theoretic types for polymorphic variants
abstract
Polymorphic variants are a useful feature of the OCaml language whose current definition and implementation rely on kinding constraints to simulate a subtyping relation via unification. This yields an awkward formalization and results in a type system whose behaviour is in some cases unintuitive and/or unduly restrictive.
Giuseppe Castagna, Tommaso Petrucciani, Kim Nguyen 0001
ICFP2