360 search results - page 41 / 72 » Dependently Typed Programming in Agda |
POPL
2007
ACM
14 years 8 months ago
2007
ACM
This work presents a framework for fusing flow analysis and theorem proving called logic-flow analysis (LFA). The framework itthe reduced product of two abstract interpretations: ...
CPE
1994
Springer
13 years 11 months ago
1994
Springer
When implementingparallel programs forparallel computer systems the performancescalability of these programs should be tested and analyzed on different computer configurations and...
JFP
2010
13 years 6 months ago
2010
The aim of our work is to be able to do fully formal, machine verified proofs over Generic Haskellstyle polytypic programs. In order to achieve this goal, we embed polytypic prog...
ACL
1992
13 years 8 months ago
1992
We have recently reported on two new word-sense disambiguation systems, one trained on bilingual material (the Canadian Hansards) and the other trained on monolingual material (Ro...
POPL
2004
ACM
14 years 8 months ago
2004
ACM
We show how some classical static analyses for imperative programs, and the optimizing transformations which they enable, may be expressed and proved correct using elementary logi...