A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Efficient Type Checking for Path Polymorphism
2018
Types for Proofs and Programs
A type system combining type application, constants as types, union types (associative, commutative and idempotent) and recursive types has recently been proposed for statically typing path polymorphism, the ability to define functions that can operate uniformly over recursively specified applicative data structures. A typical pattern such functions resort to is x y which decomposes a compound, in other words any applicative tree structure, into its parts. We study type-checking for this type
doi:10.4230/lipics.types.2015.6
dblp:conf/types/EdiVB15
fatcat:prriuezrorbn5hlfw7wtwcgb3y