Subset Coercions in Coq

DOI10.1007/978-3-540-74464-1_16zbMath1178.68531OpenAlexW1496429054MaRDI QIDQ3612448

Matthieu Sozeau

Publication date: 10 March 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74464-1_16

Mathematics Subject Classification ID

Related Items (13)

A Hoare Logic for the State Monad ⋮ A formalisation of nominal \(\alpha\)-equivalence with A, C, and AC function symbols ⋮ Indexed containers ⋮ Mtac: A monad for typed tactic programming in Coq ⋮ First-Class Type Classes ⋮ Simulating Finite Eilenberg Machines with a Reactive Engine ⋮ The Matita Interactive Theorem Prover ⋮ A Coq Library for Internal Verification of Running-Times ⋮ The Implicit Calculus of Constructions as a Programming Language with Dependent Types ⋮ A Modular Type-Checking Algorithm for Type Theory with Singleton Types and Proof Irrelevance ⋮ A New Elimination Rule for the Calculus of Inductive Constructions ⋮ A Machine-Checked Proof of the Average-Case Complexity of Quicksort in Coq ⋮ Implementing and reasoning about hash-consed data structures in Coq

Uses Software

• Coq
• PVS

This page was built for publication: Subset Coercions in Coq