We formalize proofs over Generic Haskell-style polytypic programs in the proof assistant Coq. This makes it possible to do fully formal (machine verified) proofs over polytypic programs with little ef-fort. Moreover, the formalization can be seen as a machine verified proof that polytypic proof specialization is correct with respect to polytypic property specialization
In this paper, we study natural language inference based on the formal semantics in modern type theo...
A polytypic program is a program that behaves uniformly over a large class of datatypes. For functio...
A handbook to the Coq software for writing and checking mathematical proofs, with a practical engine...
The aim of our work is to be able to do fully formal, machine verified proofs over Generic Haskell-s...
Computer proof assistants vary along many dimensions. Among the mature implementations, the Coq syst...
Many algorithms have to be implemented over and over again for different datatypes, either because d...
International audienceWe propose a new language for writing programs with dependent types on top of ...
AbstractThe idea of polytypic programming is to write programs that are defined by induction on the ...
Abstract. We propose a new language for writing programs with de-pendent types on top of the Coq pro...
Language: English Existing skills or strong desire to learn: • functional programming (e.g. OCaml or...
Many functions have to be written over and over again for different datatypes, either because dataty...
Official ReleaseCoq is a formal proof management system. It provides a formal language to write math...
Abstract. Universes are used in Type Theory to ensure consistency by checking that definitions are w...
International audienceUniverses are used in Type Theory to ensure consistency by checking that defin...
In this paper, we study natural language inference based on the formal semantics in modern type theo...
A polytypic program is a program that behaves uniformly over a large class of datatypes. For functio...
A handbook to the Coq software for writing and checking mathematical proofs, with a practical engine...
The aim of our work is to be able to do fully formal, machine verified proofs over Generic Haskell-s...
Computer proof assistants vary along many dimensions. Among the mature implementations, the Coq syst...
Many algorithms have to be implemented over and over again for different datatypes, either because d...
International audienceWe propose a new language for writing programs with dependent types on top of ...
AbstractThe idea of polytypic programming is to write programs that are defined by induction on the ...
Abstract. We propose a new language for writing programs with de-pendent types on top of the Coq pro...
Language: English Existing skills or strong desire to learn: • functional programming (e.g. OCaml or...
Many functions have to be written over and over again for different datatypes, either because dataty...
Official ReleaseCoq is a formal proof management system. It provides a formal language to write math...
Abstract. Universes are used in Type Theory to ensure consistency by checking that definitions are w...
International audienceUniverses are used in Type Theory to ensure consistency by checking that defin...
In this paper, we study natural language inference based on the formal semantics in modern type theo...
A polytypic program is a program that behaves uniformly over a large class of datatypes. For functio...
A handbook to the Coq software for writing and checking mathematical proofs, with a practical engine...
DOI
Add to ORKG