Procedural representation of CIC proof terms
From MaRDI portal
Publication:2655331
DOI10.1007/S10817-009-9137-6zbMATH Open1185.68622OpenAlexW2100997280MaRDI QIDQ2655331FDOQ2655331
Publication date: 25 January 2010
Published in: Journal of Automated Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10817-009-9137-6
Cites Work
- User interaction with the Matita proof assistant
- A modern perspective on type theory. From its origins until today
- Mathematical knowledge management in HELM
- Mathematical Knowledge Management
- The formal system λδ
- Procedural representation of CIC proof terms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (2)
Uses Software
Recommendations
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- A duality between proof systems for cyclic term graphs π π
- Proofs, programs, processes π π
- Cyclic proofs of program termination in separation logic π π
- Abstract cyclic proofs π π
- Structured proof procedures π π
- Declarative representation of proof terms π π
- Labelled cyclic proofs for separation logic π π
This page was built for publication: Procedural representation of CIC proof terms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2655331)