Zobrazeno 1 - 10
of 70
pro vyhledávání: '"Pierre Neron"'
Autor:
Pierre Neron
Publikováno v:
Journal of Formalized Reasoning, Vol 6, Iss 1, Pp 89-111 (2013)
The use of real numbers in a program can introduce differences between the expected and the actual behavior of the program, due to the finite representation of these numbers. Therefore, one may want to define programs using real numbers such that thi
Externí odkaz:
https://doaj.org/article/1148087c56974d28aafdf2da3c5034a2
Autor:
Pierre Néron, Étienne Girard
Publikováno v:
Národní knihovna České republiky.
Autor:
Pierre Neron
Publikováno v:
Electronic Notes in Theoretical Computer Science. 317:117-131
This paper presents the implementation of a program transformation that removes square roots and divisions from functional programs without recursion, producing code that can be exactly computed. This transformation accepts different subsets of langu
Publikováno v:
PEPM
PEPM '16: Proceedings of the 2016 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation
PEPM '16
Report TUD-SERG-2015-009
PEPM '16: Proceedings of the 2016 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation
PEPM '16
Report TUD-SERG-2015-009
In previous work, we introduced scope graphs as a formalism for describing program binding structure and performing name resolution in an AST-independent way. In this paper, we show how to use scope graphs to build static semantic analyzers. We use c
Publikováno v:
Pursuit of the Universal ISBN: 9783319401881
CiE
CiE
We propose a formalization of generic algorithms that includes analog algorithms. This is achieved by reformulating and extending the framework of abstract state machines to include continuous-time models of computation. We prove that every hybrid al
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5394213828125c1edca3eeaf10ca5232
https://doi.org/10.1007/978-3-319-40189-8_22
https://doi.org/10.1007/978-3-319-40189-8_22
Publikováno v:
Programming Languages and Systems ISBN: 9783662466681
ESOP
ESOP
We describe a language-independent theory for name binding and resolution, suitable for programming languages with complex scoping rules including both lexical scoping and modules. We formulate name resolution as a two-stage problem. First a language
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::27d078145015ae95aa60c7eca5b4d948
https://doi.org/10.1007/978-3-662-46669-8_9
https://doi.org/10.1007/978-3-662-46669-8_9
Autor:
Andrew Tolmach, Eelco Visser, Augusto Passalaqua, Vlad Vergu, Guido Wachsmuth, Gabrieël Konat, Pierre Neron
Publikováno v:
Onward! 2014: Proceedings of the 2014 ACM International Symposium on New Ideas, New Paradigms, and Reflections on Programming and Software
Onward! 2014
Onward!
Onward! 2014
Onward!
The realization of a language design requires multiple artifacts that redundantly encode the same information. This entails significant effort for language implementors, and often results in late detection of errors in language definitions. In this p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::30a8e0cae4ca83aa81dba1d754100b43
http://resolver.tudelft.nl/uuid:4c5a5d4d-a7be-48b3-b788-4972556a23fe
http://resolver.tudelft.nl/uuid:4c5a5d4d-a7be-48b3-b788-4972556a23fe
Autor:
Pierre Neron
Publikováno v:
PPDP
Computing accurately with real numbers is always a challenge. This is particularly true in critical embedded systems since memory issues do not allow the use of dynamic data structures. This constraint imposes a finite representation of the real numb
Autor:
Pierre Neron
Publikováno v:
Interactive Theorem Proving ISBN: 9783642396335
ITP
ITP-4th Conference on Interactive Theorem Proving
ITP-4th Conference on Interactive Theorem Proving, Jul 2013, Rennes, France. pp.457-462, ⟨10.1007/978-3-642-39634-2_33⟩
ITP
ITP-4th Conference on Interactive Theorem Proving
ITP-4th Conference on Interactive Theorem Proving, Jul 2013, Rennes, France. pp.457-462, ⟨10.1007/978-3-642-39634-2_33⟩
International audience; In this paper we present a new strategy for PVS that imple- ments a square root and division elimination in order to use automatic arithmetic strategies that were not able to deal with these operations in the ﰁrst place. Thi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5ac9322e2c93f1b9f985faa6d2797366
https://doi.org/10.1007/978-3-642-39634-2_33
https://doi.org/10.1007/978-3-642-39634-2_33
Autor:
Pierre Neron
Publikováno v:
Certified Programs and Proofs ISBN: 9783642353079
CPP
CPP
The use of real numbers in a program can introduce differences between the expected and the actual behavior of the program, due to the finite representation of these numbers. Therefore, one may want to define programs using real numbers such that thi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8eabedbf4325f28503bcecc43784d617
https://doi.org/10.1007/978-3-642-35308-6_20
https://doi.org/10.1007/978-3-642-35308-6_20