 | 2012 |
| 39 |  | Claudio Sacerdoti Coen,
Enrico Zoli:
Lebesgue's dominated convergence theorem in Bishop's style.
Ann. Pure Appl. Logic 163(2): 140-150 (2012) |
| 38 |  | Andrea Asperti,
Wilmer Ricciotti,
Claudio Sacerdoti Coen,
Enrico Tassi:
A Bi-Directional Refinement Algorithm for the Calculus of (Co)Inductive Constructions
Logical Methods in Computer Science 8(1): (2012) |
| 2011 |
| 37 |  | Andrea Asperti,
Wilmer Ricciotti,
Claudio Sacerdoti Coen,
Enrico Tassi:
The Matita Interactive Theorem Prover.
CADE 2011: 64-69 |
| 36 |  | Florian Rabe,
Michael Kohlhase,
Claudio Sacerdoti Coen:
A Foundational View on Integration Problems.
Calculemus/MKM 2011: 107-122 |
| 35 |  | Andrea Asperti,
Maria Emilia Maietti,
Claudio Sacerdoti Coen,
Giovanni Sambin,
Silvio Valentini:
Formalization of Formal Topology by Means of the Interactive Theorem Prover Matita.
Calculemus/MKM 2011: 278-280 |
| 34 |  | Florian Rabe,
Michael Kohlhase,
Claudio Sacerdoti Coen:
A Foundational View on Integration Problems
CoRR abs/1105.2725: (2011) |
| 33 |  | Claudio Sacerdoti Coen,
Enrico Tassi:
Formalising Overlap Algebras in Matita.
Mathematical Structures in Computer Science 21(4): 763-793 (2011) |
| 32 |  | R. Armadio,
Andrea Asperti,
Nicholas Ayache,
B. Campbell,
D. Mulligan,
R. Pollack,
Yann Régis-Gianas,
Claudio Sacerdoti Coen,
I. Stark:
Certified Complexity.
Procedia CS 7: 175-177 (2011) |
| 2010 |
| 31 |  | Andrea Asperti,
Claudio Sacerdoti Coen:
Some Considerations on the Usability of Interactive Provers.
AISC/MKM/Calculemus 2010: 147-156 |
| 30 |  | Claudio Sacerdoti Coen,
Silvio Valentini:
General Recursion and Formal Topology
PAR 2010: 65-75 |
| 29 |  | Matteo Cimini,
Claudio Sacerdoti Coen,
Davide Sangiorgi:
Functions as Processes: Termination and the lm[(m)\tilde]\lambda\mu\widetilde{\mu}-Calculus.
TGC 2010: 73-86 |
| 28 |  | Andrea Asperti,
Claudio Sacerdoti Coen,
Enrico Tassi:
Regular Expressions, au point
CoRR abs/1010.2604: (2010) |
| 27 |  | Claudio Sacerdoti Coen:
Declarative Representation of Proof Terms.
J. Autom. Reasoning 44(1-2): 25-52 (2010) |
| 2009 |
| 26 |  | Jacques Carette,
Lucas Dixon,
Claudio Sacerdoti Coen,
Stephen M. Watt:
Intelligent Computer Mathematics, 16th Symposium, Calculemus 2009, 8th International Conference, MKM 2009, Held as Part of CICM 2009, Grand Bend, Canada, July 6-12, 2009. Proceedings
Springer 2009 |
| 25 |  | Claudio Sacerdoti Coen,
Enrico Tassi:
Natural Deduction Environment for Matita.
Calculemus/MKM 2009: 486-491 |
| 24 |  | Andrea Asperti,
Wilmer Ricciotti,
Claudio Sacerdoti Coen,
Enrico Tassi:
Hints in Unification.
TPHOLs 2009: 84-98 |
| 23 |  | Claudio Sacerdoti Coen,
Enrico Tassi:
Nonuniform Coercions via Unification Hints
TYPES 2009: 16-29 |
| 22 |  | Claudio Sacerdoti Coen:
A User Interface for a Mathematical System that Allows Ambiguous Formulae.
Electr. Notes Theor. Comput. Sci. 226: 67-87 (2009) |
| 2008 |
| 21 |  | Claudio Sacerdoti Coen,
Stefano Zacchiroli:
Spurious Disambiguation Errors and How to Get Rid of Them.
Mathematics in Computer Science 2(2): 355-378 (2008) |
| 2007 |
| 20 |  | Claudio Sacerdoti Coen,
Stefano Zacchiroli:
Spurious Disambiguation Error Detection.
Calculemus/MKM 2007: 381-392 |
| 19 |  | Claudio Sacerdoti Coen,
Enrico Tassi:
Working with Mathematical Structures in Type Theory.
TYPES 2007: 157-172 |
| 18 |  | Claudio Sacerdoti Coen:
Reduction and Conversion Strategies for the Calculus of (co)Inductive Constructions: Part I.
Electr. Notes Theor. Comput. Sci. 174(10): 97-118 (2007) |
| 17 |  | Claudio Sacerdoti Coen,
Enrico Tassi,
Stefano Zacchiroli:
Tinycals: Step by Step Tacticals.
Electr. Notes Theor. Comput. Sci. 174(2): 125-142 (2007) |
| 16 |  | Andrea Asperti,
Claudio Sacerdoti Coen,
Enrico Tassi,
Stefano Zacchiroli:
User Interaction with the Matita Proof Assistant.
J. Autom. Reasoning 39(2): 109-139 (2007) |
| 2006 |
| 15 |  | Serge Autexier,
Claudio Sacerdoti Coen:
A Formal Correspondence Between OMDoc with Alternative Proofs and the lambdaµµ-Calculus.
MKM 2006: 67-81 |
| 14 |  | Andrea Asperti,
Claudio Sacerdoti Coen,
Enrico Tassi,
Stefano Zacchiroli:
Crafting a Proof Assistant.
TYPES 2006: 18-32 |
| 2005 |
| 13 |  | Claudio Sacerdoti Coen:
Explanation in Natural Language of lamda-µµ-Terms.
MKM 2005: 234-249 |
| 12 |  | Andrea Asperti,
Herman Geuvers,
Iris Loeb,
Lionel Elie Mamane,
Claudio Sacerdoti Coen:
An Interactive Algebra Course with Formalised Proofs and Definitions.
MKM 2005: 315-329 |
| 2004 |
| 11 |  | Luca Padovani,
Claudio Sacerdoti Coen,
Stefano Zacchiroli:
A Generative Approach to the Implementation of Language Bindings for the Document Object Model.
GPCE 2004: 469-487 |
| 10 |  | Claudio Sacerdoti Coen:
Mathematical Libraries as Proof Assistant Environments.
MKM 2004: 332-346 |
| 9 |  | Claudio Sacerdoti Coen,
Stefano Zacchiroli:
Efficient Ambiguous Parsing of Mathematical Formulae.
MKM 2004: 347-362 |
| 8 |  | Andrea Asperti,
Ferruccio Guidi,
Claudio Sacerdoti Coen,
Enrico Tassi,
Stefano Zacchiroli:
A Content Based Mathematical Search Engine: Whelp.
TYPES 2004: 17-32 |
| 7 |  | Claudio Sacerdoti Coen:
A Semi-reflexive Tactic for (Sub-)Equational Reasoning.
TYPES 2004: 98-114 |
| 6 |  | Claudio Sacerdoti Coen,
Paolo Marinelli,
Fabio Vitali:
Schemapath, a minimal extension to xml schema for conditional constraints.
WWW 2004: 164-174 |
| 2003 |
| 5 |  | Claudio Sacerdoti Coen:
A Constructive Proof of the Soundness of the Encoding of Random Access Machines in a Linda Calculus with Ordered Semantics.
ICTCS 2003: 37-57 |
| 4 |  | Claudio Sacerdoti Coen:
From Proof-Assistants to Distributed Libraries of Mathematics: Tips and Pitfalls.
MKM 2003: 30-44 |
| 3 |  | Andrea Asperti,
Luca Padovani,
Claudio Sacerdoti Coen,
Ferruccio Guidi,
Irene Schena:
Mathematical Knowledge Management in HELM.
Ann. Math. Artif. Intell. 38(1-3): 27-46 (2003) |
| 2001 |
| 2 |  | Andrea Asperti,
Luca Padovani,
Claudio Sacerdoti Coen,
Irene Schena:
XML, Stylesheets and the Re-mathematization of Formal Content.
Extreme Markup Languages® 2001 |
| 1 |  | Andrea Asperti,
Luca Padovani,
Claudio Sacerdoti Coen,
Irene Schena:
HELM and the Semantic Math-Web.
TPHOLs 2001: 59-74 |