1205 search results - page 85 / 241 » Program Extraction from Large Proof Developments |
131
click to vote
ICFP
2003
ACM
16 years 1 months ago
2003
ACM
I describe the mechanisation in HOL of some basic -calculus theory, using the axioms proposed by Gordon and Melham [4]. Using these as a foundation, I mechanised the proofs from C...
106
click to vote
ESOP
2009
Springer
15 years 5 months ago
2009
Springer
We describe the mechanisation of SLR parsing, covering background properties of context-free languages and grammars, as well as the construction of an SLR automaton. Among the vari...
106
click to vote
HASKELL
2009
ACM
15 years 8 months ago
2009
ACM
Data-type generic programming can be used to traverse and manipulate specific parts of large heterogeneously-typed tree structures, without the need for tedious boilerplate. Gene...
110
click to vote
BMCBI
2002
15 years 1 months ago
2002
Background: The biomedical community is developing new methods of data analysis to more efficiently process the massive data sets produced by microarray experiments. Systematic an...
122
click to vote
KDD
2001
ACM
16 years 2 months ago
2001
ACM
Surveys are an important part of marketing and customer relationship management, and open answers (i.e., answers to open questions) in particular may contain valuable information ...