swh:1:snp:510544f7899e7fee487ee146b60cd834a253fd12
Tip revision: 17d639410a78b8b6dd6e66a4f11bd93d2809a6d9 authored by Alley Stoughton on 29 March 2021, 13:09:27 UTC
An axiom-free formalization of well-founded relations, induction and recursion.
An axiom-free formalization of well-founded relations, induction and recursion.
Tip revision: 17d6394
COPYRIGHT
EasyCrypt (excluding the EasyCrypt standard library):
Copyright (c) - 2012-2016 - IMDEA Software Institute
Copyright (c) - 2012-2021 - Inria
Copyright (c) - 2012-2021 - X
Distributed under the terms of the CeCILL-C license
http://www.cecill.info/licences/Licence_CeCILL-C_V1-en.txt
EasyCrypt standard library (theories/**/*.ec):
Copyright (c) - 2012-2016 - IMDEA Software Institute
Copyright (c) - 2012-2021 - Inria
Copyright (c) - 2012-2021 - X
Distributed under the terms of the CeCILL-B licence.
http://www.cecill.info/licences/Licence_CeCILL-B_V1-en.txt