Towards size-dependent types for array programming
We present a type system for expressing size constraints on array-typed function parameters in an ML-style type system. The goal is to detect shape mismatches at compile-time, while being simpler than full dependent types. The main restrictions is that the only terms that can occur in types are array sizes, and syntactically they must be variables or constants. For those programs where this is not sufficient, we support a form of existential types, with the type system automatically managing the requisite book-keeping. We formalise a large subset of the type system in a small core language, which we prove sound. We also present an integration of the type system in the high-performance parallel functional language Futhark, and show on a collection of 44 representative programs that the restrictions in the type system are not too problematic in practice.
Mon 21 JunDisplayed time zone: Eastern Time (US & Canada) change
09:00 - 11:45 | |||
10:30 15mDay opening | Welcome and opening ARRAY Jeremy Gibbons Department of Computer Science, University of Oxford | ||
10:45 30mTalk | Towards size-dependent types for array programming ARRAY | ||
11:15 30mTalk | Padding in the Mathematics of Arrays ARRAY Benjamin Chetioui University of Bergen, Norway, Ole Abusdal Western Norway University of Applied Sciences, Magne Haveraaen University of Bergen, Norway, Jaakko Järvi University of Turku, Lenore Mullin University at Albany, SUNY |