A certifying extraction with time bounds from Coq to call-by-value $λ$-calculus.
Yannick ForsterFabian KunzePublished in: CoRR (2019)
Keyphrases
- upper bound
- lower bound
- tight bounds
- formal methods
- error bounds
- computer algebra
- database
- algebraic structure
- average case
- knowledge extraction
- website
- artificial intelligence
- data sets
- expressive power
- active learning
- theorem prover
- optimal solution
- automatically extracted
- data dependent
- upper and lower bounds
- machine learning
- neural network