|
Hongwei Xi
Dependently typed pattern matching
Journal of Universal Computer Science, 9(8):851-872, 2003
The mechanism for declaring datatypes to model data structures in
programming languages such as Standard ML and Haskell can offer both
convenience in programming and clarity in code. With the introduction of
dependent datatypes in DML, the programmer can model data structures with
more accuracy, thus capturing more program invariants. In this paper, we
study some practical aspects of dependent datatypes that affect both
type-checking and compiling pattern matching. The results, which have
already been tested, demonstrate that dependent datatype can not only offer
various programming benefits but also lead to performance gains, yielding a
concrete case where safer programs run faster.
[ bib |
.ps |
.pdf ]
Back
This file has been generated by
bibtex2html 1.61
Copyright notice: The documents contained
in these pages are included by the contributing authors as a means to
ensure timely dissemination of scholarly and technical work on a
non-commercial basis. Copyright and all rights therein are maintained
by the authors or by other copyright holders, notwithstanding that
they have offered their works here electronically. It is understood that all persons copying this information will
adhere to the terms and constraints invoked by each author's
copyright. These works
may not be reposted without the explicit permission of the copyright
holder.
If you experience problems downloading any of the files above,
it is most likely because your browser does not handle compressed
files correctly.
In particular, Netscape might save the file in the compressed
gz-format with extension .ps or
.pdf (indicating postscript or PDF, resp.). You can work around this by saving the file,
renaming it to .ps.gz or .pdf.gz, and then
uncrompress it.
|
