Matita Tutorial

DOI10.6092/ISSN.1972-5787/4651MaRDI QIDQ5195259zbMATH OpenOpenAlexFDO

Authors Andrea Asperti, Wilmer Ricciotti, Claudio Sacerdoti Coen

Publication date 18 September 2019

Full work available at URL https://doaj.org/article/4d8a6cc746ce48f1b9070f7dcaee0079

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Recommendations

• Matlab Guide
• Matlab guide
• MATLAB guide
• scientific article; zbMATH DE number 1472783
• Learning MATLAB
• scientific article; zbMATH DE number 5593472

Cited in

(9)

• Aligning concepts across proof assistant libraries
• Hammer for Coq: automation for dependent type theory
• Matita
• User interaction with the Matita proof assistant
• Reverse complexity
• Proving Properties of Lazy Functional Programs with Sparkle
• Implementing type theory in higher order constraint logic programming
• Causal reversibility implies time reversibility
• Encoding of predicate subtyping with proof irrelevance in the -calculus modulo theory

This page was built for publication: Matita Tutorial

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5195259)