Guarded impredicative polymorphism

Serrano, Aurelio; Hage, Jurriaan; Vytiniotis, Dimitrios; Jones, Simon Peyton

doi:10.1145/3192366.3192389

Cited by 21 publications

(35 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The type system in Quique is quite advanced. In particular, it includes higher-rank and impredicative polymorphism [35,36], type families [37], and Generalized Algebraic Data Types (GADTs) [10]. This shows that our architecture is implementable.…”

Section: Discussionmentioning

confidence: 88%

A compiler architecture for domain-specific type error diagnosis

Serrano

Hage

2019

Open Computer Science

Self Cite

View full text Add to dashboard Cite

Domain-specific languages (DSLs) permeate current programming practices. An important kind of DSLs includes those developed and integrated within a host language, which we call embedded or internal DSLs. Unfortunately, embedded DSLs usually fall short on domain-specific error diagnosis, that is, they do not give control to DSL authors over how errors are reported to the programmer. As a consequence, implementation details of the DSL leak through in error messages, and programmers need to understand the internals of the DSL implementation to fix their code in a productive way. This paper addresses the challenge of building a compiler with integrated support for domain-specific error diagnosis. We assume that the type system is described using a constraint-based approach, and constraint solving is specified using rewrite rules. Domain information can then be injected at constraint gathering time via type rules, during constraint solving via specialized rules and axioms, and finally at blaming and reparation time via transformations. Furthermore, we define error contexts as a way to control the order in which solving and blaming proceeds. We engineer domain-specific error diagnosis in such a way that the compiler can also reuse the techniques for improving general error diagnosis.

show abstract

Section: Discussionmentioning

confidence: 88%

A compiler architecture for domain-specific type error diagnosis

Serrano

Hage

2019

Open Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…As a result, such algorithms tend to be more complicated, and thus less adopted in practice. Recent work proposed Guarded Impredicative Polymorphism [Serrano et al 2018], as an improvement on GHC's type inference algorithm with impredicative instantiation. They make use of local information in n-ary applications to infer polymorphic instantiations with a relatively simple specification and unification algorithm.…”

Section: Related Workmentioning

confidence: 99%

“…Therefore some type annotations are necessary to guide type inference. In response to this challenge several decidable type systems requiring some annotations have been proposed [Dunfield and Krishnaswami 2013;Le Botlan and Rémy 2003;Leijen 2008;Peyton Jones et al 2007;Serrano et al 2018;Vytiniotis et al 2008]. Two closely related type systems that support predicative higher-ranked type inference were proposed by Peyton Jones et al [Peyton Jones et al 2007] and Dunfield and Krishnaswami [Dunfield and Krishnaswami 2013] (henceforth denoted as DK).…”

Section: Introductionmentioning

confidence: 99%

A mechanical formalization of higher-ranked polymorphic type inference

Zhao

Oliveira

Schrijvers

2019

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

Modern functional programming languages, such as Haskell or OCaml, use sophisticated forms of type inference. While an important topic in the Programming Languages research, there is little work on the mechanization of the metatheory of type inference in theorem provers. In particular we are unaware of any complete formalization of the type inference algorithms that are the backbone of modern functional languages.This paper presents the first full mechanical formalization of the metatheory for higher-ranked polymorphic type inference. The system that we formalize is the bidirectional type system by Dunfield and Krishnaswami (DK). The DK type system has two variants (a declarative and an algorithmic one) that have been manually proven sound, complete and decidable. We present a mechanical formalization in the Abella theorem prover of DK's declarative type system with a novel algorithmic system. We have a few reasons to use a new algorithm. Firstly, our new algorithm employs worklist judgments, which precisely capture the scope of variables and simplify the formalization of scoping in a theorem prover. Secondly, while DK's original formalization comes with very well-written manual proofs, there are several details missing and some incorrect proofs, which complicate the task of writing a mechanized proof. Despite the use of a different algorithm we prove the same results as DK, although with significantly different proofs and proof techniques. Since such type inference algorithms are quite subtle and have a complex metatheory, mechanical formalizations are an important advance in type-inference research.

show abstract

“…Thus motivated, a long succession of papers have tackled the problem of type inference for impredicativity [Botlan and Rémy 2003;Leijen 2008Leijen , 2009Serrano et al 2018;Vytiniotis et al 2006Vytiniotis et al , 2008. None has succeeded in producing a system that is simultaneously expressive enough to be useful, simple enough to support robust programmer intuition, compatible with a myriad other type system extensions, and implementable without an invasive rewrite of a type inference engine tailored to predicative type inference.…”

Section: Introductionmentioning

confidence: 99%

“…→ . Our idea, just as in previous work [Serrano et al 2018], is to exploit that special case. Our overall goals are these:…”

Section: Introductionmentioning

confidence: 99%

A quick look at impredicativity

Serrano

Hage

Jones

et al. 2020

Proc. ACM Program. Lang.

Self Cite

View full text Add to dashboard Cite

Type inference for parametric polymorphism is wildly successful, but has always suffered from an embarrassing flaw: polymorphic types are themselves not first class. We present Quick Look, a practical, implemented, and deployable design for impredicative type inference. To demonstrate our claims, we have modified GHC, a production-quality Haskell compiler, to support impredicativity. The changes required are modest, localised, and are fully compatible with GHC's myriad other type system extensions. CCS Concepts: • Theory of computation → Type structures.

show abstract

Guarded impredicative polymorphism

Cited by 21 publications

References 17 publications

A compiler architecture for domain-specific type error diagnosis

A compiler architecture for domain-specific type error diagnosis

A mechanical formalization of higher-ranked polymorphic type inference

A quick look at impredicativity

Contact Info

Product

Resources

About