Zobrazeno 1 - 10
of 27
pro vyhledávání: '"MAILLARD, KENJI"'
Dependently typed proof assistant rely crucially on definitional equality, which relates types and terms that are automatically identified in the underlying type theory. This paper extends type theory with definitional functor laws, equations satisfi
Externí odkaz:
http://arxiv.org/abs/2310.14929
We present an extensive mechanization of the meta-theory of Martin-L\"of Type Theory (MLTT) in the Coq proof assistant. Our development builds on pre-existing work in Agda to show not only the decidability of conversion, but also the decidability of
Externí odkaz:
http://arxiv.org/abs/2310.06376
Publikováno v:
Proceedings of the ACM on Programming Languages Volume 6 Issue ICFP August 2022 Article No 124 pp 931-959
Gradualizing the Calculus of Inductive Constructions (CIC) involves dealing with subtle tensions between normalization, graduality, and conservativity with respect to CIC. Recently, GCIC has been proposed as a parametrized gradual type theory that ad
Externí odkaz:
http://arxiv.org/abs/2209.00975
Proof assistants play a dual role as programming languages and logical systems. As programming languages, proof assistants offer standard modularity mechanisms such as first-class functions, type polymorphism and modules. As logical systems, however,
Externí odkaz:
http://arxiv.org/abs/2108.10259
We investigate gradual variations on the Calculus of Inductive Construction (CIC) for swifter prototyping with imprecise types and terms. We observe, with a no-go theorem, a crucial tradeoff between graduality and the key properties of normalization
Externí odkaz:
http://arxiv.org/abs/2011.10618
We propose the first framework for defining relational program logics for arbitrary monadic effects. The framework is embedded within a relational dependent type theory and is highly expressive. At the semantic level, we provide an algebraic presenta
Externí odkaz:
http://arxiv.org/abs/1907.05244
Autor:
Maillard, Kenji, Ahman, Danel, Atkey, Robert, Martinez, Guido, Hritcu, Catalin, Rivas, Exequiel, Tanter, Éric
This paper proposes a general semantic framework for verifying programs with arbitrary monadic side-effects using Dijkstra monads, which we define as monad-like structures indexed by a specification monad. We prove that any monad morphism between a c
Externí odkaz:
http://arxiv.org/abs/1903.01237
Autor:
Ahman, Danel, Fournet, Cédric, Hritcu, Catalin, Maillard, Kenji, Rastogi, Aseem, Swamy, Nikhil
We provide a way to ease the verification of programs whose state evolves monotonically. The main idea is that a property witnessed in a prior state can be soundly recalled in the current state, provided (1) state evolves according to a given preorde
Externí odkaz:
http://arxiv.org/abs/1707.02466
Autor:
Grimm, Niklas, Maillard, Kenji, Fournet, Cédric, Hritcu, Catalin, Maffei, Matteo, Protzenko, Jonathan, Ramananandro, Tahina, Rastogi, Aseem, Swamy, Nikhil, Zanella-Béguelin, Santiago
Relational properties describe multiple runs of one or more programs. They characterize many useful notions of security, program refinement, and equivalence for programs with diverse computational effects, and they have received much attention in the
Externí odkaz:
http://arxiv.org/abs/1703.00055
Autor:
Ahman, Danel, Hritcu, Catalin, Maillard, Kenji, Martinez, Guido, Plotkin, Gordon, Protzenko, Jonathan, Rastogi, Aseem, Swamy, Nikhil
Dijkstra monads enable a dependent type theory to be enhanced with support for specifying and verifying effectful code via weakest preconditions. Together with their closely related counterparts, Hoare monads, they provide the basis on which verifica
Externí odkaz:
http://arxiv.org/abs/1608.06499