80 search results - page 12 / 16 » Program Extraction from Normalization Proofs |
105
click to vote
GECCO
2008
Springer
15 years 2 months ago
2008
Springer
In the early days a policy was a set of simple rules with a clear intuitive motivation that could be formalised to good effect. However the world is becoming much more complex. S...
126
click to vote
ICFP
2007
ACM
16 years 1 months ago
2007
ACM
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
115
click to vote
ICFP
2008
ACM
16 years 1 months ago
2008
ACM
We describe an axiomatic extension to the Coq proof assistant, that supports writing, reasoning about, and extracting higher-order, dependently-typed programs with side-effects. C...
113
click to vote
CIE
2006
Springer
15 years 5 months ago
2006
Springer
This note reexamines Spector's remarkable computational interpretation of full classical analysis. Spector's interpretation makes use of a rather abstruse recursion schem...
118
click to vote
VLDB
1990
ACM
15 years 5 months ago
1990
ACM
Database programming requires having the knowledge of database semantics both to maintain database integrity and to explore more optimization opportunities. Automated programming ...