package coq-metacoq-quotation
- Overview
- No Docs
You can search for identifiers within the package.
in-package search v0.2.0
Install
Dune Dependency
Authors
-
AAbhishek Anand <aa755@cs.cornell.edu>
-
DDanil Annenkov <danil.v.annenkov@gmail.com>
-
SSimon Boulier <simon.boulier@inria.fr>
-
CCyril Cohen <cyril.cohen@inria.fr>
-
YYannick Forster <forster@ps.uni-saarland.de>
-
JJason Gross <jgross@mit.edu>
-
FFabian Kunze <fkunze@fakusb.de>
-
MMeven Lennon-Bertrand <Meven.Bertrand@univ-nantes.fr>
-
KKenji Maillard <kenji.maillard@inria.fr>
-
GGregory Malecha <gmalecha@gmail.com>
-
JJakob Botsch Nielsen <Jakob.botsch.nielsen@gmail.com>
-
MMatthieu Sozeau <matthieu.sozeau@inria.fr>
-
NNicolas Tabareau <nicolas.tabareau@inria.fr>
-
TThéo Winterhalter <theo.winterhalter@inria.fr>
Maintainers
Sources
sha512=df2552795eab097c779e1e70d5f7f14a7e1b696d0ce42d1929f7a8b6ffc1a26a93d9e2bdcaf462c9d326c040efa57d1f3daa3fe953afcf6a18075d04d5ee3298
Description
MetaCoq is a meta-programming framework for Coq.
The Quotation module is geared at providing functions □T → □□T
for
□T := Ast.term
(currently implemented) and for □T := { t : Ast.term & Σ ;;; [] |- t : T }
(still in the works). Currently Ast.term → Ast.term
and (Σ ;;; [] |- t : T) → Ast.term
functions are provided
for Template and PCUIC terms, in MetaCoq.Quotation.ToTemplate.All
and MetaCoq.Quotation.ToPCUIC.All
. Proving well-typedness is still
a work in progress.
Ultimately the goal of this development is to prove that □
is a lax monoidal
semicomonad (a functor with cojoin : □T → □□T
that codistributes over unit
and ×
), which is sufficient for proving Löb's theorem.
Published: 06 Sep 2024
Dependencies (3)
-
coq-metacoq-template-pcuic
= version
-
coq-metacoq-pcuic
= version
-
coq-metacoq-template
= version
Dev Dependencies
None
Used by (1)
-
coq-metacoq
>= "1.3.2+8.20"
Conflicts
None