Zobrazeno 1 - 10
of 223
pro vyhledávání: '"Gilles Dowek"'
Publikováno v:
Logical Methods in Computer Science, Vol Volume 19, Issue 1 (2023)
The lambda-Pi-calculus modulo theory is a logical framework in which many type systems can be expressed as theories. We present such a theory, the theory U, where proofs of several logical systems can be expressed. Moreover, we identify a sub-theory
Externí odkaz:
https://doaj.org/article/093a027d55594976939e3129fbb58e43
Autor:
Gilles Dowek
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 262, Iss Proc. PxTP 2017, Pp 3-12 (2017)
We describe the first results of a project of analyzing in which theories formal proofs can be ex- pressed. We use this analysis as the basis of interoperability between proof systems.
Externí odkaz:
https://doaj.org/article/08510e68816547aea7f7cab2cfbb80d6
Autor:
Pablo Arrighi, Gilles Dowek
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 204, Iss Proc. DCM 2015, Pp 1-10 (2016)
Three reasonable hypotheses lead to the thesis that physical phenomena can be described and simulated with cellular automata. In this work, we attempt to describe the motion of a particle upon which a constant force is applied, with a cellular automa
Externí odkaz:
https://doaj.org/article/e4595503b38049f1b2569b3550db7421
Autor:
Pablo Arrighi, Gilles Dowek
Publikováno v:
Logical Methods in Computer Science, Vol Volume 13, Issue 1 (2017)
We provide a computational definition of the notions of vector space and bilinear functions. We use this result to introduce a minimal language combining higher-order computation and linear algebra. This language extends the Lambda-calculus with the
Externí odkaz:
https://doaj.org/article/26816753f7984b1b9c40cfbf5e10df64
Autor:
Alejandro Díaz-Caro, Gilles Dowek
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 144, Iss Proc. DCM 2013, Pp 1-15 (2014)
We show how to provide a structure of probability space to the set of execution traces on a non-confluent abstract rewrite system, by defining a variant of a Lebesgue measure on the space of traces. Then, we show how to use this probability space to
Externí odkaz:
https://doaj.org/article/55f4c5c0af1848a79678efe70f0cdfb4
Autor:
Alejandro Díaz-Caro, Gilles Dowek
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 113, Iss Proc. LSFA 2012, Pp 137-144 (2013)
We define an equivalence relation on propositions and a proof system where equivalent propositions have the same proofs. The system obtained this way resembles several known non-deterministic and algebraic lambda-calculi.
Externí odkaz:
https://doaj.org/article/1311c00756bf456ab4c8c2e80de6fd07
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 18, Iss Proc. SOS 2009, Pp 77-91 (2010)
The Plan Execution Interchange Language (PLEXIL) is a synchronous language developed by NASA to support autonomous spacecraft operations. In this paper, we propose a rewriting logic semantics of PLEXIL in Maude, a high-performance logical engine. The
Externí odkaz:
https://doaj.org/article/fb954f1427934e559fe438396653d7aa
Autor:
Gilles Dowek
Publikováno v:
LICS
Scopus-Elsevier
Scopus-Elsevier
The problem of determining whether a term is an instance of another in the simply typed lambda -calculus, i.e. of solving the equation a=b where a and b are simply typed lambda -terms and b is ground, is addressed. An algorithm that decides whether a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::862d43a6dc44ce3e7181a9bac279457d
http://arxiv.org/abs/2306.01473
http://arxiv.org/abs/2306.01473
Autor:
Ying Jiang, Gilles Dowek
We give a new proof of a theorem of Mints that the positive fragment of minimal predicate logic is decidable. The idea of the proof is to replace the eigenvariable condition of sequent calculus by an appropriate scoping mechanism. The algorithm given
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9e80e56d8c3e3bd71513ec224830bbcb
http://arxiv.org/abs/2305.08416
http://arxiv.org/abs/2305.08416
Publikováno v:
Mathematical Structures in Computer Science
Mathematical Structures in Computer Science, 2022, pp.1-36. ⟨10.1017/S0960129522000044⟩
Mathematical Structures in Computer Science, 2022, pp.1-36. ⟨10.1017/S0960129522000044⟩
User-defined higher-order rewrite rules are becoming a standard in proof assistants based on intuitionistic type theory. This raises the question of proving that they preserve the properties of beta-reductions for the corresponding type systems. In a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::36a94b6be4375f00362681044ef42114
https://doi.org/10.1017/s0960129522000044
https://doi.org/10.1017/s0960129522000044