suzanne.soy/trivial
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

[icfp] experience draft

Browse Source
This commit is contained in:
ben 2016-03-15 22:35:21 -04:00
parent d9b5fbb897
commit 1686bc310d
1 changed files with 24 additions and 17 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

41
icfp-2016/experience.scrbl
View File

@ -1,32 +1,39 @@
#lang scribble/sigplan #lang scribble/sigplan
@require["common.rkt"] @require["common.rkt"]
@; TODO experiment is BOGUS because it doesn't measure overhead of define/let
@; Make those automatic and try again!
@title[#:tag "sec:experience"]{Experience} @title[#:tag "sec:experience"]{Experience}
Our initial experience programming with the library has been positive. Our initial experience programming with the library has been positive.
By far the most useful application is to @racket[regexp-match], as By far the most useful application is to @racket[regexp-match], as
Typed Racket's default requires either a type cast or guards on each Typed Racket's default requires either a type cast or guards on each
matched group. matched group.
The bugs reported by @racket[printf] and others are also useful, though The bugs reported by @racket[printf] and others have also proven useful
the real-time difference between catching a @racket[printf] bug during compilation in development.
versus finding the same bug at run-time is small, maybe 1-3 seconds.
We have also observed performance improvements on microbenchmarks involving
maps over large vectors, though we have yet to find the same benefits in real
code.
In total, we have applied the library to 10,000 lines of Typed Racket code Regarding the optimized vector operations mentioned at the end of @Secref{sec:vector},
we have observed performance improvements on microbenchmarks but have yet
to find real programs where the same benefits apply.
In future work, we hope to improve the vector library to include matrix arithmetic
and try similar experiments on numeric code.
Thus far, we have applied the library to 10,000 lines of Typed Racket code
taken from 7 small projects. taken from 7 small projects.
Including the library is a 1-line change, but the programmer needs to remove In total, we had to modify 6 lines to replace
now-redundant type annotations and casts manually. unrestricted mutation--which could violate our library's assumptions---with
Compiling with our library adds no statistically significant overhead, but reference cells.@note{None of the surveyed code used the database library;
tends to produce slightly larger bytecode files (at most 2% larger). we have only tested that interface in scripts.}
Running times are slightly worse for the added casts; in the worst case This gives us confidence that opting-in to our library truly is a 1-line
we saw 2-second slowdown. effort.
This could be improved by tighter integration with the type checker. Removing type annotations and casts made redundant by our library is, however,
still a manual task.
Compiling with our library adds no statistically significant overhead, but
tends to produce slightly larger bytecode files due to the inserted
annotations (at most 2% larger).
Running times we observed were slightly degraded by the added casts;
in the worst case we saw a 2-second slowdown.
This could be improved by a closer integration with the type checker to
remove casts guaranteed to succeed.
@;@figure["fig:experience" @;@figure["fig:experience"
@; "Experience Report" @; "Experience Report"