Zobrazeno 1 - 10
of 23
pro vyhledávání: '"Jérôme Vouillon"'
Autor:
Gabriel Radanne, Jérôme Vouillon
Publikováno v:
WWW (Companion Volume)
Tierless Web programming languages allow combining client-side and server-side programming in a single program. This allows defining expressions with both client and server parts, and at the same time provides good static guarantees regarding client-
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dfabc1a89ef65a769a4c1fe7957e5407
https://doi.org/10.1145/3184558.3185953
https://doi.org/10.1145/3184558.3185953
Autor:
Jérôme Vouillon, Vincent Balat
Publikováno v:
Software: Practice and Experience. 44:951-972
We present the design and implementation of a compiler from OCaml bytecode to JavaScript. The compiler first translates the bytecode into a static single-assignment intermediate representation on which optimizations are performed, before generating J
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::368e7eec3e70d1584615a4809cd6a2b4
https://doi.org/10.1002/spe.2187
https://doi.org/10.1002/spe.2187
Publikováno v:
APLAS 2016
APLAS 2016, Nov 2016, Hanoi, Vietnam
Programming Languages and Systems ISBN: 9783319479576
APLAS
APLAS 2016, Nov 2016, Hanoi, Vietnam
Programming Languages and Systems ISBN: 9783319479576
APLAS
International audience; Eliom is a dialect of OCaml for Web programming in which server and client pieces of code can be mixed in the same file using syntactic annotations. This allows to build a whole application as a single distributed program, in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cdce49827c4bf8785ea2095ed8b30113
https://hal.archives-ouvertes.fr/hal-01349774
https://hal.archives-ouvertes.fr/hal-01349774
Publikováno v:
IFL
IFL, Aug 2016, Leuven, Belgium. ⟨10.1145/3064899.3064901⟩
IFL, Aug 2016, Leuven, Belgium. ⟨10.1145/3064899.3064901⟩
International audience; ELIOM is a dialect of OCAML for Web programming. It can be used both server and client-side. Server and client sections can also be mixed in the same file using syntactic annotations. This allows one to build a whole applicati
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f817757cac64fb3a6b4e47092ac1ac3d
https://hal.inria.fr/hal-01407898v2/document
https://hal.inria.fr/hal-01407898v2/document
Publikováno v:
International Conference on Software Engineering
International Conference on Software Engineering, May 2014, Hyderabad, India. pp.756-766, ⟨10.1145/2568225.2568262⟩
ICSE
International Conference on Software Engineering, May 2014, Hyderabad, India. pp.756-766, ⟨10.1145/2568225.2568262⟩
ICSE
International audience; Modern software systems are built by composing components drawn from large repositories, whose size and complexity increase at a fast pace. Maintaining and evolving these software collections is a complex task, and a strict qu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d6814a8751f22be9b3bbd55a90b6e665
https://hal.archives-ouvertes.fr/hal-01134312
https://hal.archives-ouvertes.fr/hal-01134312
Autor:
Jérôme Vouillon
Publikováno v:
POPL
We presen t an object-oriented calculus whic hallows arbitrary hiding of methods in protot ypes, even in the presence of binary methods and friend functions. This combination of features permits complete control of the in terface a class exposes to t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8c9366a8fdc7da1965dd7a96fb0269f0
https://doi.org/10.1145/373243.360233
https://doi.org/10.1145/373243.360233
Publikováno v:
ICFP
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM Transactions on Programming Languages and Systems (TOPLAS), ACM, 2005, 27 (1), pp.46-90. ⟨10.1145/1053468.1053470⟩
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM Transactions on Programming Languages and Systems (TOPLAS), ACM, 2005, 27 (1), pp.46-90. ⟨10.1145/1053468.1053470⟩
We propose regular expression types as a foundation for statically typed XML processing languages. Regular expression types, like most schema languages for XML, introduce regular expression notations such as repetition (*), alternation (|), etc., to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::407ce600f9b54648d9f93ef055bf26b2
https://doi.org/10.1145/357766.351242
https://doi.org/10.1145/357766.351242
Autor:
Jérôme Vouillon, Didier Rémy
Publikováno v:
Theory and Practice of Object Systems. 4:27-50
Objective ML is a small practical extension to ML with ob- jects and top level classes. It is fully compatible with ML; its type system is based on ML polymorphism, record types with polymorphic access, and a better treatment of type abbreviations. O
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::098143aec0616f84a00a84612dc01492
https://doi.org/10.1002/(sici)1096-9942(1998)4:1<27::aid-tapo3>3.0.co
https://doi.org/10.1002/(sici)1096-9942(1998)4:1<27::aid-tapo3>3.0.co
Autor:
Jérôme Vouillon, Roberto Di Cosmo
Publikováno v:
ACM Transactions on Software Engineering and Methodology
ACM Transactions on Software Engineering and Methodology, Association for Computing Machinery, 2013, 22 (4), pp.34. ⟨10.1145/2522920.2522927⟩
ESEC/FSE
ESEC/FSE, Sep 2011, France. pp.n-a, ⟨10.1145/2025113.2025149⟩
SIGSOFT FSE
ACM Transactions on Software Engineering and Methodology, Association for Computing Machinery, 2013, 22 (4), pp.34. ⟨10.1145/2522920.2522927⟩
ESEC/FSE
ESEC/FSE, Sep 2011, France. pp.n-a, ⟨10.1145/2025113.2025149⟩
SIGSOFT FSE
Modern software systems are built by composing components drawn from large repositories , whose size and complexity is increasing at a very fast pace. A fundamental challenge for the maintainability and the scalability of such software systems is the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c9ee83fba81d9c85e8052a35b13ba941
https://hal.archives-ouvertes.fr/hal-00910926
https://hal.archives-ouvertes.fr/hal-00910926
Autor:
Jérôme Vouillon
Publikováno v:
Journal of Automated Reasoning
Journal of Automated Reasoning, Springer Verlag, 2011, pp.1-36. ⟨10.1007/s10817-011-9230-5⟩
Journal of Automated Reasoning, Springer Verlag, 2011, pp.1-36. ⟨10.1007/s10817-011-9230-5⟩
International audience; The POPLmark challenge proposes a set of benchmarks intended to assess the usability of proof assistants in the context of research on programming languages. It is based on the metatheory of System Fsub. We present a solution
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f9f3c128f5969f6f5f5dff29bae5d33e
https://hal.archives-ouvertes.fr/hal-00628381
https://hal.archives-ouvertes.fr/hal-00628381