Zobrazeno 1 - 10
of 19
pro vyhledávání: '"Pierre Valarcher"'
Publikováno v:
Fundamenta Informaticae. 107:313-330
We formalize the algorithms computing primitive recursive (PR) functions as the abstract state machines (ASMs) whose running length is computable by a PR function. Then we show that there exists a programming language (implementing only PR functions)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::33145da06bef508c5e6bdbf98249294a
https://doi.org/10.3233/fi-2011-405
https://doi.org/10.3233/fi-2011-405
Autor:
Pierre Valarcher
Publikováno v:
RAIRO - Theoretical Informatics and Applications. 42:69-82
We give a complete characterization of the class of functions that are the intensional behaviours of primitive recursive (PR) algorithms. This class is the set of primitive recursive functions that have a null basic case of recursion. This result is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::44235a9e54a2a2e10e587abe4fc076e2
https://doi.org/10.1051/ita:2007053
https://doi.org/10.1051/ita:2007053
Autor:
Pierre Valarcher
Publikováno v:
Electronic Notes in Theoretical Computer Science. 35:230-243
This paper is a contribution to the development of a theory of behaviour of programs. We study an intensional behaviour of system T of Godel that is devoted to capturing not which function is computed but how it is computed. This intensional behaviou
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0fc378be9a2713cb8d316a7fcf0fbad3
Autor:
Pierre Valarcher, Serge Grigorieff
Publikováno v:
LICS
We consider computable functionals mapping the Baire space into the set of integers. By continuity, the value of the functional on a given function depends only on a ``critical" finite part of this function. Care: there is in general no way to comput
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7198426e62d987bbfbb49780518f2907
https://doi.org/10.1109/lics.2012.45
https://doi.org/10.1109/lics.2012.45
Publikováno v:
Abstract State Machines, Alloy, B and Z ISBN: 9783642118104
ASM
ASM
We aim at extending the B language in order to build ASM programs which are correct with respect to B-like logical specifications. On the one hand, the main strengths of the B formal method are: i) the ability to express logical statements, and ii) t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3f3bad8ec8e5809cd8c4a08e76966b2a
https://doi.org/10.1007/978-3-642-11811-1_29
https://doi.org/10.1007/978-3-642-11811-1_29
Publikováno v:
ACM Transactions on Computational Logic
ACM Transactions on Computational Logic, Association for Computing Machinery, 2009, 10 (4), pp.1--37. ⟨10.1145/1555746.1555750⟩
ACM Transactions on Computational Logic, Association for Computing Machinery, 2009, 10 (4), pp.1--37. ⟨10.1145/1555746.1555750⟩
We extend Meyer and Ritchie's Loop language with higher-order procedures and procedural variables and we show that the resulting programming language (called Loop ω ) is a natural imperative counterpart of Gödel System T. The argument is two-fold:
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::365d0f6698ae68f93be20dd1cae5dd01
https://hal.archives-ouvertes.fr/hal-00422158/document
https://hal.archives-ouvertes.fr/hal-00422158/document
Publikováno v:
RAIRO-Theoretical Informatics and Applications (RAIRO: ITA)
RAIRO-Theoretical Informatics and Applications (RAIRO: ITA), EDP Sciences, 2005, 39, pp.ITA0442
RAIRO-Theoretical Informatics and Applications (RAIRO: ITA), EDP Sciences, 2005, 39, pp.ITA0442
We investigate the structure of ``worst-case'' quasi reduced ordered decision diagrams and Boolean functions whose truth tables are associated to: we suggest different ways to count and enumerate them. We, then, introduce a notion of complexity which
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d8985ac64633fa4b33eeea57bcab49e7
https://hal.archives-ouvertes.fr/hal-00081326
https://hal.archives-ouvertes.fr/hal-00081326
Publikováno v:
Proceedings of CCC'03
Coding, Cryptography and Combinatorics ISBN: 9783034896023
Coding, Cryptography and Combinatorics ISBN: 9783034896023
HFE (Hidden Field Equations) is a public key cryptosystem using univariate polynomials over finite fields. It was proposed by J. Patarin in 1996. Well chosen parameters during the construction produce a system of quadratic multivariate polynomials ov
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a79bec0413d488187d1b4714093530e3
https://hal.archives-ouvertes.fr/hal-00081338
https://hal.archives-ouvertes.fr/hal-00081338