Higher-order ghost state

R Jung, R Krebbers, L Birkedal, D Dreyer - Proceedings of the 21st ACM …, 2016 - dl.acm.org
The development of concurrent separation logic (CSL) has sparked a long line of work on
modular verification of sophisticated concurrent programs. Two of the most important …

An introduction to small scale reflection in Coq

G Gonthier, A Mahboubi - Journal of formalized reasoning, 2010 - inria.hal.science
This tutorial presents the Ssreflect extension to the Coq system. This extension consists of
an extension to the Coq language of script, and of a set of libraries, originating from the …

Type classes for mathematics in type theory

B Spitters, E Van der Weegen - Mathematical Structures in Computer …, 2011 - cambridge.org
The introduction of first-class type classes in the Coq system calls for a re-examination of the
basic interfaces used for mathematical formalisation in type theory. We present a new set of …

The Matita interactive theorem prover

A Asperti, W Ricciotti, C Sacerdoti Coen… - … Deduction–CADE-23 …, 2011 - Springer
Matita is an interactive theorem prover being developed by the Helm team at the University
of Bologna. Its stable version 0.5. x may be downloaded at http://matita. cs. unibo. it. The tool …

Use and abuse of instance parameters in the Lean mathematical library

A Baanen - arXiv preprint arXiv:2202.01629, 2022 - arxiv.org
The Lean mathematical library mathlib features extensive use of the typeclass pattern for
organising mathematical structures, based on Lean's mechanism of instance parameters …

Hierarchy Builder: algebraic hierarchies made easy in Coq with Elpi

C Cohen, K Sakaguchi, E Tassi - FSCD 2020-5th International …, 2020 - inria.hal.science
It is nowadays customary to organize libraries of machine checked proofs around
hierarchies of algebraic structures [2, 6, 8, 16, 18, 23, 27]. One influential example is the …

ELPI: fast, embeddable, prolog interpreter

C Dunchev, F Guidi, C Sacerdoti Coen… - Logic for Programming …, 2015 - Springer
We present a new interpreter for λ Prolog that runs consistently faster than the byte code
compiled by Teyjus, that is considered the best available implementation of λ Prolog. The …

Competing inheritance paths in dependent type theory: a case study in functional analysis

R Affeldt, C Cohen, M Kerjean, A Mahboubi… - … : 10th International Joint …, 2020 - Springer
This paper discusses the design of a hierarchy of structures which combine linear algebra
with concepts related to limits, like topology and norms, in dependent type theory. This …

A new look at generalized rewriting in type theory

M Sozeau - Journal of formalized reasoning, 2009 - jfr.unibo.it
Rewriting is an essential tool for computer-based reasoning, both automated and assisted.
This is because rewriting is a general notion that permits modeling a wide range of problems …

Canonical structures for the working Coq user

A Mahboubi, E Tassi - International Conference on Interactive Theorem …, 2013 - Springer
This paper provides a gentle introduction to the art of programming type inference with the
mechanism of Canonical Structures. Programmable type inference has been one of the key …