Sciweavers

360 search results - page 31 / 72
» Dependently Typed Programming in Agda
Sort
View
POPL
2010
ACM
14 years 5 months ago
Pure Subtype Systems
This paper introduces a new approach to type theory called pure subtype systems. Pure subtype systems differ from traditional approaches to type theory (such as pure type systems)...
DeLesley S. Hutchins
PLDI
2011
ACM
12 years 10 months ago
Systematic editing: generating program transformations from an example
Software modifications are often systematic—they consist of similar, but not identical, program changes to multiple contexts. Existing tools for systematic program transformati...
Na Meng, Miryung Kim, Kathryn S. McKinley
IEEEPACT
1998
IEEE
13 years 12 months ago
Exploiting Method-Level Parallelism in Single-Threaded Java Programs
Method speculation of object-oriented programs attempts to exploit method-level parallelism (MLP) by executing sequential method invocations in parallel, while still maintaining c...
Michael K. Chen, Kunle Olukotun
APLAS
2007
ACM
13 years 11 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
ICFP
2006
ACM
14 years 7 months ago
Recursive modules for programming
d abstract) Keiko Nakata1 Jacques Garrigue2 1 Kyoto University Research Institute for Mathematical Sciences 2 Graduate School of Mathematics, Nagoya University The ML module syste...
Keiko Nakata, Jacques Garrigue