Zobrazeno 1 - 10
of 188
pro vyhledávání: '"Dubois, Catherine"'
Autor:
Assaf, Ali, Burel, Guillaume, Cauderlier, Raphaël, Delahaye, David, Dowek, Gilles, Dubois, Catherine, Gilbert, Frédéric, Halmagrand, Pierre, Hermant, Olivier, Saillard, Ronan
Dedukti is a Logical Framework based on the $\lambda$$\Pi$-Calculus Modulo Theory. We show that many theories can be expressed in Dedukti: constructive and classical predicate logic, Simple type theory, programming languages, Pure type systems, the C
Externí odkaz:
http://arxiv.org/abs/2311.07185
Many representations for sets are available in programming languages libraries. The paper focuses on sparse sets used, e.g., in some constraint solvers for representing integer variable domains which are finite sets of values, as an alternative to ra
Externí odkaz:
http://arxiv.org/abs/2307.03974
There are several ways to formally represent families of data, such as lambda terms, in a type theory such as the dependent type theory of Coq. Mathematical representations are very compact ones and usually rely on the use of dependent types, but the
Externí odkaz:
http://arxiv.org/abs/2212.10453
Autor:
Ziat, Ghiles, Botbol, Vincent, Dien, Matthieu, Gotlieb, Arnaud, Pépin, Martin, Dubois, Catherine
In program verification, constraint-based random testing is a powerful technique which aims at generating random test cases that satisfy functional properties of a program. However, on recursive constrained data-structures (e.g., sorted lists, binary
Externí odkaz:
http://arxiv.org/abs/2208.12747
Publikováno v:
EPTCS 360, 2022, pp. 27-44
Nested datatypes have been widely studied in the past 25 years, both theoretically using category theory, and practically in programming languages such as Haskell. They consist in recursive polymorphic datatypes where the type parameter changes throu
Externí odkaz:
http://arxiv.org/abs/2207.03994
Autor:
Dubois, Catherine
La baisse des niveaux d’eau due aux changements climatiques affecte la végétation des milieux riverains. Le lac Saint-Pierre, au Québec, n’en fait pas exception. Cette étude a pour objectif principal de suivre l’évolution des communautés
Externí odkaz:
https://hdl.handle.net/20.500.11794/34428
Autor:
Dubois, Catherine
It is well known in the Constraint Programming community that any non-binary constraint satisfaction problem (with finite domains) can be transformed into an equivalent binary one. One of the most well-known translations is the Hidden Variable Encodi
Externí odkaz:
http://arxiv.org/abs/2009.00583