Executable Relational Specifications of Polymorphic Type Systems Using Prolog

Conference paper

DOI: 10.1007/978-3-319-29604-3_8

Part of the Lecture Notes in Computer Science book series (LNCS, volume 9613)
Cite this paper as:
Ahn K.Y., Vezzosi A. (2016) Executable Relational Specifications of Polymorphic Type Systems Using Prolog. In: Kiselyov O., King A. (eds) Functional and Logic Programming. FLOPS 2016. Lecture Notes in Computer Science, vol 9613. Springer, Cham


A concise, declarative, and machine executable specification of the Hindley–Milner type system (HM) can be formulated using logic programming languages such as Prolog. Modern functional language implementations such as the Glasgow Haskell Compiler support more extensive flavors of polymorphism beyond Milner’s theory of type polymorphism in the late 70’s. We progressively extend the HM specification to include more advanced type system features. An interesting development is that extending dimensions of polymorphism beyond HM resulted in a multi-staged solution: resolve the typing relations first, while delaying to resolve kinding relations, and then resolve the delayed kinding relations. Our work demonstrates that logic programing is effective for prototyping polymorphic type systems with rich features of polymorphism, and that logic programming could have been even more effective for specifying type inference if it were equipped with better theories and tools for staged resolution of different relations at different levels.


Hindley–Milner Functional language Type system Type inference Unification Parametric polymorphism Higher-kinded polymorphism Type constructor polymorphism Kind polymorphism Algebraic datatype Nested datatype Logic programming Prolog Delayed goals 

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  1. 1.Portland State UniversityPortlandUSA
  2. 2.Chalmers University of TechnologyGothenburgSweden

Personalised recommendations