2013 Proceeding- Program Chair:
- Stephanie Weirich
- Sponsor:
- sigplan
It is my great pleasure to welcome you to the 2013 Workshop on Dependently Typed Programming. The mission of the workshop is to bring researchers with experience in dependently-typed languages together. The workshop program includes two portions: presentations of formal papers, each reviewed by the program committee members, and informal presentations intended to spark discussion about current work. This is the first year that DTP has co-located with the International Conference on Functional Programming (ICFP). The cross-fertilization between functional and dependently-typed languages continues to grow each year.
The call for formal papers requested diverse topics such as Language Design, Theory, Compilation, Tools, and Experience related to dependently-typed languages. This call attracted five high-caliber submissions that were all enthusiastically accepted by the program committee. The definitive versions of these papers appear in this proceedings. At the time of this writing, the program of informal presentations has not been fully determined. The full schedule and record of the DTP'13 program will be maintained at http://www.seas.upenn.edu/~sweirich/dtp13. Auxiliary material related to the program will also be posted at that site.
This workshop follows a series of workshops on dependently-typed programming. Past meetings include DTP 2011 in Nijmegen, DTP 2010 in Edinburgh, and DTP 2008 in Nottingham, as well as seminars organized in 2011 at Shonan Village, Japan and in 2005 at Dagstuhl, Germany.
Proceeding Downloads
Correct-by-construction pretty-printing
A new approach to correct-by-construction pretty-printing is presented. The basic methodology is the one of classical (not necessarily correct) pretty-printing: users convert values to pretty-printer documents, and a general rendering algorithm turns ...
New equations for neutral terms: a sound and complete decision procedure, formalized
The definitional equality of an intensional type theory is its test of type compatibility. Today's systems rely on ordinary evaluation semantics to compare expressions in types, frustrating users with type errors arising when evaluation fails to ...
A multivalued language with a dependent type system
Type systems are used to eliminate certain classes of errors at compile time. One of the goals of type system research is to allow more classes of errors (such as array subscript errors) to be eliminated. Dependent type systems have played a key role in ...
Relational algebraic ornaments
Dependently typed programming is hard, because ideally dependently typed programs should share structure with their correctness proofs, but there are very few guidelines on how one can arrive at such integrated programs. McBride's algebraic ...
Leveling up dependent types: generic programming over a predicative hierarchy of universes
Generic programming is about writing a single function that does something different for each type. In most languages one cannot case over the structure of types. So in such languages generic programming is accomplished by defining a universe, a data ...
Index Terms
- Proceedings of the 2013 ACM SIGPLAN workshop on Dependently-typed programming
Recommendations
Acceptance Rates
| Year | Submitted | Accepted | Rate |
|---|---|---|---|
| DTP '13 | 5 | 5 | 100% |
| Overall | 5 | 5 | 100% |