Sciweavers

8132 search results - page 7 / 1627
» Dependability, Abstraction, and Programming
Sort
View
BIRTHDAY
2006
Springer
15 years 1 months ago
Eliminating Dependent Pattern Matching
Abstract. This paper gives a reduction-preserving translation from Coquand's dependent pattern matching [4] into a traditional type theory [11] with universes, inductive types...
Healfdene Goguen, Conor McBride, James McKinna
MPC
2010
Springer
165views Mathematics» more  MPC 2010»
15 years 2 months ago
Dependently Typed Grammars
Parser combinators are a popular tool for designing parsers in functional programming languages. If such combinators generate an abstract representation of the grammar as an interm...
Kasper Brink, Stefan Holdermans, Andres Löh
SOFTVIS
2010
ACM
14 years 7 months ago
Dependence cluster visualization
Large clusters of mutual dependence have long been regarded as a problem impeding comprehension, testing, maintenance, and reverse engineering. An effective visualization can aid ...
Syed S. Islam, Jens Krinke, David Binkley
ICFP
2010
ACM
14 years 10 months ago
Abstracting abstract machines
David Van Horn, Matthew Might
LPAR
2004
Springer
15 years 3 months ago
Abstraction-Carrying Code
ion-Carrying Code Elvira Albert1 , Germ´an Puebla2 , and Manuel Hermenegildo2,3 1 DSIP, Universidad Complutense Madrid 2 Facultad de Inform´atica, Technical University of Madrid ...
Elvira Albert, Germán Puebla, Manuel V. Her...