C. Sacerdoti Coen; E. Zoli, Lebesgue's dominated convergence theorem in Bishop's style, «ANNALS OF PURE AND APPLIED LOGIC», 2012, 163(2), pp. 140 - 150 [articolo]
A. Asperti; F. Guidi; W. Ricciotti; C. Sacerdoti Coen; E. Tassi, Matita 0.99.1, 2012. [software]
Dominic P. Mulligan;Claudio Sacerdoti Coen, On the Correctness of an Optimising Assembler for the Intel MCS-51 MicroprocessorCertified Programs and Proofs, in: Lecture Notes in Computer ScienceCertified Programs and Proofs, Springer Verlag, «LECTURE NOTES IN ARTIFICIAL INTELLIGENCE», 2012, 7679, pp. 43 - 59 (atti di: Certified Programs and Proofs, Kyoto, 13-15 Dicembre 2012) [Contributo in Atti di convegno]
D. Aspinall; C. Sacerdoti Coen, Proceedings of the 9th International Workshop On User Interfaces for Theorem Provers (UITP10), Amsterdam, Academic Press (Elsevier), 2012, pp. 120 . [curatela]
F.Rabe; M.Kohlhase; C.Sacerdoti Coen, A Foundational View on Integration Problems, in: Intelligence Computer Mathematics - Lecture Notes in Artificial Intelligence, HEIDELBERG, Springer-Verlag, «LECTURE NOTES IN COMPUTER SCIENCE», 2011, 6824, pp. 107 - 122 (atti di: International Conference on Intelligent Computer Mathematics (CICM 2011), Bertinoro (Italy), 18-23/07/2011) [Contributo in Atti di convegno]
R. Armadio; A. Asperti; N. Ayache; B. Campbell; D. Mulligan; R. Pollack; Y. Regis-Gianas; C. Sacerdoti Coen; I. Stark, Certified Complexity, «PROCEDIA COMPUTER SCIENCE», 2011, 7, pp. 175 - 177 [articolo]
C. Sacerdoti Coen; E. Tassi, Formalising Overlap Algebras in Matita, «MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE», 2011, 21(4), pp. 763 - 793 [articolo]
Asperti, Andrea; Maietti, M. E.; SACERDOTI COEN, Claudio; Sambin, G.; Valentini, S., Formalization of Formal Topology by Means of the Interactive Theorem Prover Matita., in: Lecture Notes in Computer Science, Springer-Verlag, 2011, 6824, pp. 278 - 280 (atti di: Intelligent Computer Mathematics - 18th Symposium, Calculemus 2011, and 10th International Conference, MKM 2011., Bertinoro, Italy,, 18-23 Luglio 2011) [Contributo in Atti di convegno]
Claudio Sacerdoti Coen;Enrico Tassi, Nonuniform Coercions via Unification Hints, «ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE», 2011, 53, pp. 16 - 29 [articolo]
Asperti, Andrea; Ricciotti, Wilmer; SACERDOTI COEN, Claudio; Tassi, E., The Matita Interactive Theorem Prover, in: Lecture Notes in Computer Science, Springer-Verlag, 2011, 6803, pp. 64 - 69 (atti di: 23rd International Conference on Automated Deduction - CADE 23, Wroclaw, Poland, July 31 - August 5, 2011.) [Contributo in Atti di convegno]
Coordinamento del progetto: Certified Complexity (CerCo).
C. Sacerdoti Coen, Declarative Representation of Proof Terms, «JOURNAL OF AUTOMATED REASONING», 2010, 44, pp. 25 - 52 [articolo]
M. Cimini; C. Sacerdoti Coen; D. Sangiorgi, Functions as Processes: Termination and the lambda mu mu~ - Calculus, in: Lecture Notes in Computer Science, BERLIN, Springer, 2010, 6084, pp. 73 - 86 (atti di: 5th International Symposium on Trustworthly Global Computing - TGC 2010, Munich, Germany, February 24-26, 2010) [Contributo in Atti di convegno]
C. Sacerdoti Coen; S. Valentini, General Recursion and Formal Topology, in: Proceedings Workshop on Partiality and Recursion in Interactive Theorem Provers, s.l, Electronic Proceedings in Theoretical Computer Sci, 2010, 43, pp. 65 - 75 (atti di: Workshop on Partiality and Recursion in Interactive Theorem Provers (PAR 2010), Edinburgh, 15th July 2010) [Contributo in Atti di convegno]
A., Asperti; C., Sacerdoti Coen, Some Considerations on the Usability of Interactive Provers., in: Intelligent Computer Mathematics, «LECTURE NOTES IN COMPUTER SCIENCE», 2010, 6167, pp. 147 - 156 (atti di: 17th Symposium, Calculemus 2010, Paris, France, July 5-10, 2010) [Contributo in Atti di convegno]
