Zobrazeno 1 - 10
of 102
pro vyhledávání: '"POTTIER, FRANÇOIS"'
Common functional languages incentivize tail-recursive functions, as opposed to general recursive functions that consume stack space and may not scale to large inputs. This distinction occasionally requires writing functions in a tail-recursive style
Externí odkaz:
http://arxiv.org/abs/2411.19397
Publikováno v:
Logical Methods in Computer Science, Volume 19, Issue 4 (October 23, 2023) lmcs:8851
We apply program verification technology to the problem of specifying and verifying automatic differentiation (AD) algorithms. We focus on define-by-run, a style of AD where the program that must be differentiated is executed and monitored by the aut
Externí odkaz:
http://arxiv.org/abs/2112.07292
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
This is a talk proposal for HOPE 2013. Using iteration over a collection as a case study, we wish to illustrate the strengths and weaknesses of the prototype programming language Mezzo.
Externí odkaz:
http://arxiv.org/abs/1311.7256
Autor:
Protzenko, Jonathan, Pottier, François
Publikováno v:
ICFP 2013, Proceedings of the 18th ACM SIGPLAN international conference on Functional programming
We present Mezzo, a typed programming language of ML lineage. Mezzo is equipped with a novel static discipline of duplicable and affine permissions, which controls aliasing and ownership. This rules out certain mistakes, including representation expo
Externí odkaz:
http://arxiv.org/abs/1311.7242
Publikováno v:
Logical Methods in Computer Science (LMCS); 2023, Vol. 19 Issue 4, p1-51, 51p
We consider a simple yet expressive λ-calculus equipped with references, effect handlers, and dynamic allocation of effect labels, and whose operational semantics does not involve coercions or rely on type information. We equip this language with a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______165::cf243d9344cd6286b9b23bd029ebd555
https://inria.hal.science/hal-03886668/document
https://inria.hal.science/hal-03886668/document
Autor:
Pottier, François
Publikováno v:
JFLA 2021-32es Journées Francophones des Langages Applicatifs
JFLA 2021-32es Journées Francophones des Langages Applicatifs, Feb 2021, Saint Médard d’Excideuil, France
JFLA 2021-32es Journées Francophones des Langages Applicatifs, Feb 2021, Saint Médard d’Excideuil, France
National audience; We present Monolith, a programmable tool that helps apply random testing or fuzz testing to an OCaml library. Monolith provides a rich specification language, which allows the user to describe her library's API, and an engine, whic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::7b39d39043a99785c3063db22d4c5a96
https://inria.hal.science/hal-03049511/file/pottier-monolith-2021.pdf
https://inria.hal.science/hal-03049511/file/pottier-monolith-2021.pdf
Publikováno v:
2021, ⟨swh:1:dir:80952d7602e8e9614979f1b1f50fdad8a4c369f1;origin=https://hal.archives-ouvertes.fr/hal-03473197;visit=swh:1:snp:781fc4f58efbdfa6ea16006272793bf7c610d760;anchor=swh:1:rel:3df60f40567bfdf2b365cac2fe61c6bb38d94503;path=/⟩
This repository contains the formalization of a transient stack and its iterator, as described in the CPP'22 paper "Specification and Verification of a Transient Stack".
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______1398::d9e2e22997c65ddcea29b39ef9e95f16
https://hal.inria.fr/hal-03473197
https://hal.inria.fr/hal-03473197