Matita

swMATH6140MaRDI QIDQ18274FDOQ18274

Author name not available (Why is that?)

Described by source

• User interaction with the Matita proof assistant
• Matita Tutorial
• The Matita interactive theorem prover

Cited In (73)

• A user-friendly interface for a lightweight verification system
• The swap of integral and limit in constructive mathematics
• Enabling collaboration on semiformal mathematical knowledge by semantic web integration
• Natural Deduction Environment for Matita
• Formalization of formal topology by means of the interactive theorem prover Matita
• Supporting User-Defined Notations When Integrating Scientific Text-Editors with Proof Assistance Systems
• Validating Mathematical Structures
• Title not available (Why is that?)
• Type classes for efficient exact real arithmetic in \textsc{Coq}
• Hints in Unification
• Programming and Proving with Classical Types
• From types to sets by local type definition in higher-order logic
• From the universality of mathematical truth to the interoperability of proof systems
• From types to sets by local type definitions in higher-order logic
• Towards ``mouldable code via nested code graph transformation
• Spurious disambiguation errors and how to get rid of them
• Type classes for mathematics in type theory
• A user interface for a mathematical system that allows ambiguous formulae
• Asynchronous proof processing with Isabelle/Scala and Isabelle/jEdit
• Friends with Benefits
• About the Formalization of Some Results by Chebyshev in Number Theory
• Aligning concepts across proof assistant libraries
• Title not available (Why is that?)
• Title not available (Why is that?)
• Zenon: An Extensible Automated Theorem Prover Producing Checkable Proofs
• Higher order Proof Reconstruction from Paramodulation-Based Refutations: The Unit Equality Case
• Reverse complexity
• Computational Complexity Via Finite Types
• The strategy challenge in SMT solving
• Towards semantic mathematical editing
• Dot-types and their implementation
• A formalization of multi-tape Turing machines
• On Choice Rules in Dependent Type Theory
• Formalising overlap algebras in Matita
• Pure type systems with explicit substitutions
• A constructive and formal proof of Lebesgue's dominated convergence theorem in the interactive theorem prover Matita
• A canonical locally named representation of binding
• Asynchronous user interaction and tool integration in Isabelle/PIDE
• Declarative representation of proof terms
• Crystal: Integrating structured queries into a tactic language
• Procedural representation of CIC proof terms
• Title not available (Why is that?)
• A Compact Proof of Decidability for Regular Expression Equivalence
• Title not available (Why is that?)
• A Language of Patterns for Subterm Selection
• Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility
• A Certified Study of a Reversible Programming Language
• Congruence closure in intensional type theory
• The CADE-22 automated theorem proving system competition -- CASC-22
• Isabelle as document-oriented proof assistant
• Preface to the special issue: Interactive theorem proving and the formalization of mathematics
• A formal proof of Borodin-Trakhtenbrot's gap theorem
• Tinycals: step by step tacticals
• Recycling proof patterns in Coq: case studies
• Tactics for hierarchical proof
• Packaging Mathematical Structures
• Incompleteness, Undecidability and Automated Proofs
• Deciding Kleene algebra terms equivalence in Coq
• Formal metatheory of programming languages in the Matita interactive theorem prover
• Title not available (Why is that?)
• Implementing type theory in higher order constraint logic programming
• Crafting a Proof Assistant
• A plugin to export Coq libraries to XML
• The Coq library as a theory graph
• Foundational extensible corecursion: a proof assistant perspective
• A Web Interface for Matita
• Formalizing Turing Machines
• Proviola: a tool for proof re-animation
• The Lean theorem prover (system description)
• An Interactive Driver for Goal-directed Proof Strategies
• A study on fractional differential equations using the fractional Fourier transform
• Certifying algorithms and relevant properties of reversible primitive permutations with \textsf{Lean}
• A bi-directional refinement algorithm for the calculus of (co)inductive constructions

This page was built for software: Matita