Sciweavers

856 search results - page 59 / 172
» Dependent Types in Practical Programming
Sort
View
ICFP
2009
ACM
16 years 3 months ago
Purely functional lazy non-deterministic programming
Functional logic programming and probabilistic programming have demonstrated the broad benefits of combining laziness (non-strict evaluation with sharing of the results) with non-...
Sebastian Fischer, Oleg Kiselyov, Chung-chieh Shan
HICSS
2005
IEEE
125views Biometrics» more  HICSS 2005»
15 years 8 months ago
Taking Topic Detection From Evaluation to Practice
Abstract— The Topic Detection and Tracking (TDT) research community investigates information retrieval methods for organizing a constantly arriving stream of news articles by the...
James Allan, Stephen M. Harding, David Fisher, Alv...
205
Voted
POPL
2005
ACM
16 years 2 months ago
Parametric polymorphism for XML
Despite the extensiveness of recent investigations on static typing for XML, parametric polymorphism has rarely been treated. This well-established typing discipline can also be u...
Haruo Hosoya, Alain Frisch, Giuseppe Castagna
SIGSOFT
1994
ACM
15 years 6 months ago
Speeding up Slicing
Program slicing is a fundamental operation for many software engineering tools. Currently, the most efficient algorithm for interprocedural slicing is one that uses a program repr...
Thomas W. Reps, Susan Horwitz, Shmuel Sagiv, Genev...
123
Voted
APLAS
2007
ACM
15 years 6 months ago
Finally Tagless, Partially Evaluated
We have built the first family of tagless interpretations for a higher-order typed object language in a typed metalanguage (Haskell or ML) that require no dependent types, general...
Jacques Carette, Oleg Kiselyov, Chung-chieh Shan