Sciweavers

678 search results - page 69 / 136
» Dependent Types for Program Understanding
Sort
View
148
Voted
ICFP
2012
ACM
13 years 4 months ago
Transporting functions across ornaments
Programming with dependent types is a blessing and a curse. It is a blessing to be able to bake invariants into the definition of datatypes: we can finally write correct-by-cons...
Pierre-Évariste Dagand, Conor McBride
233
Voted
PLDI
2009
ACM
16 years 2 months ago
Semantics-aware trace analysis
As computer systems continue to become more powerful and comdo programs. High-level abstractions introduced to deal with complexity in large programs, while simplifying human reas...
Kevin J. Hoffman, Patrick Eugster, Suresh Jagannat...
147
Voted
ANLP
1992
170views more  ANLP 1992»
15 years 3 months ago
Automatic Extraction of Facts from Press Releases to Generate News Stories
While complete understanding of arbitrary input text remains in the future, it is currently possible to construct natural language processing systems that provide a partial unders...
Peggy M. Andersen, Philip J. Hayes, Steven P. Wein...
251
Voted
POPL
2009
ACM
16 years 2 months ago
Semi-sparse flow-sensitive pointer analysis
Pointer analysis is a prerequisite for many program analyses, and the effectiveness of these analyses depends on the precision of the pointer information they receive. Two major a...
Ben Hardekopf, Calvin Lin
ICFP
2010
ACM
15 years 3 months ago
Total parser combinators
A monadic parser combinator library which guarantees termination of parsing, while still allowing many forms of left recursion, is described. The library's interface is simil...
Nils Anders Danielsson