Sciweavers

1063 search results - page 84 / 213
» Programming Methodologies in GCLA
Sort
View
PEPM
2004
ACM
14 years 1 months ago
Dynamic slicing based on redex trails
Tracing computations is a widely used methodology for program debugging. Lazy languages, in particular, pose new demands on tracing techniques since following the actual trace of ...
Claudio Ochoa, Josep Silva, Germán Vidal
IDT
2010
124views more  IDT 2010»
13 years 6 months ago
Modelling decision making with probabilistic causation
Humans know how to reason based on cause and effect, but cause and effect is not enough to draw conclusions due to the problem of imperfect information and uncertainty. To resol...
Luís Moniz Pereira, Carroline Kencana Ramli
CTCS
1989
Springer
13 years 11 months ago
A Category-theoretic Account of Program Modules
The type-theoretic explanation of modules proposed to date (for programming languages like ML) is unsatisfactory, because it does not capture that evaluation of type-expressions i...
Eugenio Moggi
ERSHOV
1999
Springer
14 years 9 hour ago
The Essence of Program Transformation by Partial Evaluation and Driving
Abstract. An abstract framework is developed to describe program transformation by specializing a given program to a restricted set of inputs. Particular cases include partial eval...
Neil D. Jones
ISCA
1992
IEEE
113views Hardware» more  ISCA 1992»
13 years 11 months ago
Dynamic Dependency Analysis of Ordinary Programs
A quantitative analysis of program execution is essential to the computer architecture design process. With the current trend in architecture of enhancing the performance of unipr...
Todd M. Austin, Gurindar S. Sohi