HIGHLIGHTS
- who: Valentin Blot et al. from the u201923, u201317, Boston, MA, USA have published the research work: Compositional pre-processing for automated reasoning in dependent type theory, in the Journal: (JOURNAL)
- what: This paper discusses how to better design such pre-processing phases for improved formal proof automation. Consider the following goal: forall (f: int -> int -> int) (x y: int), f x (y + 0)=f (x + 0) y It features universal quantifiers and an uninterpreted function, as in Example 3.3, but also addition and zero on the int type. This paper proposes a collection . . .
If you want to have access to all the content you need to log in!
Thanks :)
If you don't have an account, you can create one here.