The following pages link to Claudio Sacerdoti Coen (Q651318):
Displaying 50 items.
- Lebesgue's dominated convergence theorem in Bishop's style (Q651319) (← links)
- Spurious disambiguation errors and how to get rid of them (Q841693) (← links)
- (Q1040005) (redirect page) (← links)
- A compact kernel for the calculus of inductive constructions (Q1040007) (← links)
- Mathematical knowledge management in HELM (Q1810904) (← links)
- Formal metatheory of programming languages in the Matita interactive theorem prover (Q1945919) (← links)
- Logic-independent proof search in logical frameworks (short paper) (Q2096460) (← links)
- Reversibility in Erlang: imperative constructs (Q2097430) (← links)
- Relational data across mathematical libraries (Q2287899) (← links)
- The Coq library as a theory graph (Q2287907) (← links)
- A plugin to export Coq libraries to XML (Q2287917) (← links)
- A survey on retrieval of mathematical knowledge (Q2364882) (← links)
- On the value of variables (Q2401632) (← links)
- User interaction with the Matita proof assistant (Q2462635) (← links)
- Declarative representation of proof terms (Q2655330) (← links)
- (Q2767919) (← links)
- Reduction and Conversion Strategies for the Calculus of (co)Inductive Constructions: Part I (Q2866803) (← links)
- Tinycals: Step by Step Tacticals (Q2867943) (← links)
- A Bi-Directional Refinement Algorithm for the Calculus of (Co)Inductive Constructions (Q2881085) (← links)
- On the Value of Variables (Q2938129) (← links)
- Formalising Overlap Algebras in Matita (Q3094175) (← links)
- Hints in Unification (Q3183522) (← links)
- ELPI: Fast, Embeddable, $$\lambda $$ Prolog Interpreter (Q3460075) (← links)
- Certified Complexity (CerCo) (Q3460499) (← links)
- (Q3497625) (← links)
- Working with Mathematical Structures in Type Theory (Q3499757) (← links)
- Some Considerations on the Usability of Interactive Provers (Q3582703) (← links)
- Crafting a Proof Assistant (Q3612433) (← links)
- Natural Deduction Environment for Matita (Q3637307) (← links)
- (Q4413879) (← links)
- On the Relative Usefulness of Fireballs (Q4635799) (← links)
- (Q4790651) (← links)
- (Q4964708) (← links)
- (Q5111895) (← links)
- A User Interface for a Mathematical System that Allows Ambiguous Formulae (Q5166498) (← links)
- Matita Tutorial (Q5195259) (← links)
- The Matita Interactive Theorem Prover (Q5200015) (← links)
- A Foundational View on Integration Problems (Q5200111) (← links)
- Formalization of Formal Topology by Means of the Interactive Theorem Prover Matita (Q5200125) (← links)
- Implementing type theory in higher order constraint logic programming (Q5236551) (← links)
- Mathematical Knowledge Management (Q5313072) (← links)
- Mathematical Knowledge Management (Q5313073) (← links)
- Spurious Disambiguation Error Detection (Q5428286) (← links)
- A Formal Correspondence Between OMDoc with Alternative Proofs and the ${\overline{\lambda}\mu\tilde{\mu}}$ -Calculus (Q5756760) (← links)
- Theoretical Computer Science (Q5897349) (← links)
- Types for Proofs and Programs (Q5898170) (← links)
- Types for Proofs and Programs (Q5898175) (← links)
- Mathematical Knowledge Management (Q5898523) (← links)
- Mathematical Knowledge Management (Q5898528) (← links)
- Reversible debugging of concurrent Erlang programs: supporting imperative primitives (Q6197585) (← links)
