797 search results - page 97 / 160 » Eliminating Proofs from Programs |
ICFP
2003
ACM
14 years 10 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...
FOSSACS
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. We show how to generate well-founded and stable term orderings based on polynomial interpretations over the real numbers. Monotonicity (another usual requirement in termi...
TPHOL
2003
IEEE
14 years 3 months ago
2003
IEEE
Abstract. Polytypic functions have mainly been studied in the context of functional programming languages. In that setting, applications of polytypism include elegant treatments of...
ICALP
2001
Springer
14 years 2 months ago
2001
Springer
We prove a lower bound of (n4/3 log1/3 n) on the randomized decision tree complexity of any nontrivial monotone n-vertex graph property, and of any nontrivial monotone bipartite g...
ESOP
2009
Springer
14 years 1 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...