Claudio Sacerdoti Coen - researchr profile publications

researchr

You are not signed in
Sign in
Sign up

Publications with a 'Claudio Sacerdoti Coen' as author, editor, or advisor:

Nonuniform Coercions via Unification HintsSacerdoti Coen, Claudio, Tassi, Enrico. Electronic Proceedings in Theoretical Computer Science, 53, Mar 2011. [doi]
Proceedings of the 9th International Workshop On User Interfaces for Theorem Provers, UITP 2010, Edinburgh, UK, July 15, 2010David Aspinall 0001, Claudio Sacerdoti Coen, editors, Volume 285 of Electronic Notes in Theoretical Computer Science, Elsevier, 2012. [doi]
The Matita Interactive Theorem ProverAndrea Asperti, Wilmer Ricciotti, Claudio Sacerdoti Coen, Enrico Tassi. cade 2011: 64-69 [doi]
A Generative Approach to the Implementation of Language Bindings for the Document Object ModelLuca Padovani, Claudio Sacerdoti Coen, Stefano Zacchiroli. GPCE 2004: 469-487 [doi]
A Semi-reflexive Tactic for (Sub-)Equational ReasoningClaudio Sacerdoti Coen. TYPES 2006: 98-114 [doi]
Logic-Independent Proof Search in Logical Frameworks - (Short Paper)Michael Kohlhase, Florian Rabe, Claudio Sacerdoti Coen, Jan Frederik Schaefer. cade 2020: 395-401 [doi]
A Plugin to Export Coq Libraries to XMLClaudio Sacerdoti Coen. mkm 2019: 243-257 [doi]
Matita TutorialAndrea Asperti, Wilmer Ricciotti, Claudio Sacerdoti Coen. jfrea, 7(2):91-199, 2014. [doi]
General Recursion and Formal TopologyClaudio Sacerdoti Coen, Silvio Valentini. itp 2012: 71-82 [doi]
Hints in UnificationAndrea Asperti, Wilmer Ricciotti, Claudio Sacerdoti Coen, Enrico Tassi. tphol 2009: 84-98 [doi]
Implementing type theory in higher order constraint logic programmingFerruccio Guidi, Claudio Sacerdoti Coen, Enrico Tassi. mscs, 29(8):1125-1150, 2019. [doi]
Some Considerations on the Usability of Interactive ProversAndrea Asperti, Claudio Sacerdoti Coen. AISC 2010: 147-156 [doi]
Tinycals: Step by Step TacticalsClaudio Sacerdoti Coen, Enrico Tassi, Stefano Zacchiroli. ENTCS, 174(2):125-142, 2007. [doi]
Joint Proceedings of the FMM and LML Workshops, Doctoral Program and Work in Progress at the Conference on Intelligent Computer Mathematics 2019 co-located with the 12th Conference on Intelligent Computer Mathematics (CICM 2019), Prague, Czech Republic, July 8-12, 2019Edwin C. Brady, James H. Davenport, William M. Farmer, Cezary Kaliszyk, Andrea Kohlhase, Michael Kohlhase, Dennis Müller 0001, Karol Pak, Claudio Sacerdoti Coen, editors, Volume 2634 of CEUR Workshop Proceedings, CEUR-WS.org, 2020. [doi]
Lebesgue's dominated convergence theorem in Bishop's styleClaudio Sacerdoti Coen, Enrico Zoli. APAL, 163(2):140-150, 2012. [doi]
A Constructive Proof of the Soundness of the Encoding of Random Access Machines in a Linda Calculus with Ordered SemanticsClaudio Sacerdoti Coen. ictcs 2003: 37-57 [doi]
Intelligent Computer Mathematics - 12th International Conference, CICM 2019, Prague, Czech Republic, July 8-12, 2019, ProceedingsCezary Kaliszyk, Edwin Brady, Andrea Kohlhase, Claudio Sacerdoti Coen, editors, Volume 11617 of Lecture Notes in Computer Science, Springer, 2019. [doi]
A Bi-Directional Refinement Algorithm for the Calculus of (Co)Inductive ConstructionsAndrea Asperti, Wilmer Ricciotti, Claudio Sacerdoti Coen, Enrico Tassi. Log. Methods Comput. Sci., 8(1), 2012. [doi]
User Interaction with the Matita Proof AssistantAndrea Asperti, Claudio Sacerdoti Coen, Enrico Tassi, Stefano Zacchiroli. JAR, 39(2):109-139, 2007. [doi]
A Foundational View on Integration ProblemsFlorian Rabe, Michael Kohlhase, Claudio Sacerdoti Coen. mkm 2011: 107-122 [doi]
Efficient Ambiguous Parsing of Mathematical FormulaeClaudio Sacerdoti Coen, Stefano Zacchiroli. mkm 2004: 347-362 [doi]
Certified Complexity (CerCo)Roberto M. Amadio, Nicolas Ayache, François Bobot, Jaap Boender, Brian Campbell, Ilias Garnier, Antoine Madet, James McKinna, Dominic P. Mulligan, Mauro Piccolo, Randy Pollack, Yann Régis-Gianas, Claudio Sacerdoti Coen, Ian Stark, Paolo Tranquilli. FOPARA 2014: 1-18 [doi]
Declarative Representation of Proof TermsClaudio Sacerdoti Coen. JAR, 44(1-2):25-52, 2010. [doi]
ELPI: Fast, Embeddable, \lambda Prolog InterpreterCvetan Dunchev, Ferruccio Guidi, Claudio Sacerdoti Coen, Enrico Tassi. lpar 2015: 460-468 [doi]
A Term Rewriting System for Kuratowski's Closure-Complement ProblemOsama Al-Hassani, Quratul-ain Mahesar, Claudio Sacerdoti Coen, Volker Sorge. RTA 2012: 38-52 [doi]
Properties of a Computational Lambda Calculus for Higher-Order Relational QueriesClaudio Sacerdoti Coen, Riccardo Treglia. ictcs 2023: 254-267 [doi]
Causal Reversibility Implies Time ReversibilityMarco Bernardo 0001, Ivan Lanese, Andrea Marin, Claudio Antares Mezzina, Sabina Rossi, Claudio Sacerdoti Coen. qest 2023: 270-287 [doi]
Certified ComplexityR. Armadio, Andrea Asperti, Nicholas Ayache, B. Campbell, Dominic P. Mulligan, R. Pollack, Yann Régis-Gianas, Claudio Sacerdoti Coen, I. Stark. procedia, 7:175-177, 2011. [doi]
Formal Metatheory of Programming Languages in the Matita Interactive Theorem ProverAndrea Asperti, Wilmer Ricciotti, Claudio Sacerdoti Coen, Enrico Tassi. JAR, 49(3):427-451, 2012. [doi]
On the Prediction of Smart Contracts' BehavioursCosimo Laneve, Claudio Sacerdoti Coen, Adele Veschetti. BIRTHDAY 2019: 397-415 [doi]
The Coq Library as a Theory GraphDennis Müller 0001, Florian Rabe, Claudio Sacerdoti Coen. mkm 2019: 171-186 [doi]
Relational Data Across Mathematical LibrariesAndrea Condoluci, Michael Kohlhase, Dennis Müller 0001, Florian Rabe, Claudio Sacerdoti Coen, Makarius Wenzel. mkm 2019: 61-76 [doi]
On the Relative Usefulness of FireballsBeniamino Accattoli, Claudio Sacerdoti Coen. lics 2015: 141-155 [doi]
PrefaceDavid Aspinall, Claudio Sacerdoti Coen. ENTCS, 285:1-2, 2012. [doi]
Knowledge management of formal mathematics and interactive theorem provingClaudio Sacerdoti Coen. PhD thesis, University of Bologna, Italy, 2004. [doi]
Natural Deduction Environment for MatitaClaudio Sacerdoti Coen, Enrico Tassi. mkm 2009: 486-491 [doi]
Joint Proceedings of the FMM, FVPS, MathUI,NatFoM, and OpenMath Workshops, Doctoral Program, and Work in Progress at the Conference on Intelligent Computer Mathematics 2021 co-located with the 14th Conference on Intelligent Computer Mathematics (CICM 2021), Virtual Event, Timisoara, Romania, July 26 - 31, 2021Jasmin Blanchette, James H. Davenport, Peter Koepke, Michael Kohlhase, Andrea Kohlhase, Adam Naumowicz, Dennis Müller 0001, Yasmine Sharoda, Claudio Sacerdoti Coen, editors, Volume 3377 of CEUR Workshop Proceedings, CEUR-WS.org, 2023. [doi]
HELM and the Semantic Math-WebAndrea Asperti, Luca Padovani, Claudio Sacerdoti Coen, Irene Schena. tphol 2001: 59-74 [doi]
Implementing HOL in an Higher Order Logic Programming LanguageCvetan Dunchev, Claudio Sacerdoti Coen, Enrico Tassi. lfmtp 2016: [doi]
Formalising Overlap Algebras in MatitaClaudio Sacerdoti Coen, Enrico Tassi. mscs, 21(4):763-793, 2011. [doi]
A Content Based Mathematical Search Engine: WhelpAndrea Asperti, Ferruccio Guidi, Claudio Sacerdoti Coen, Enrico Tassi, Stefano Zacchiroli. TYPES 2006: 17-32 [doi]
Proceedings of the 22nd Italian Conference on Theoretical Computer Science, Bologna, Italy, September 13-15, 2021Claudio Sacerdoti Coen, Ivano Salvo, editors, Volume 3072 of CEUR Workshop Proceedings, CEUR-WS.org, 2022. [doi]
On the Correctness of an Optimising Assembler for the Intel MCS-51 MicroprocessorDominic P. Mulligan, Claudio Sacerdoti Coen. CPP 2012: 43-59 [doi]
A constructive and formal proof of Lebesgue's Dominated Convergence Theorem in the interactive theorem prover MatitaClaudio Sacerdoti Coen, Enrico Tassi. jfrea, 1(1):51-89, 2008. [doi]
On the value of variablesBeniamino Accattoli, Claudio Sacerdoti Coen. iandc, 255:224-242, 2017. [doi]
Formalization of Formal Topology by Means of the Interactive Theorem Prover MatitaAndrea Asperti, Maria Emilia Maietti, Claudio Sacerdoti Coen, Giovanni Sambin, Silvio Valentini. mkm 2011: 278-280 [doi]
Working with Mathematical Structures in Type TheoryClaudio Sacerdoti Coen, Enrico Tassi. TYPES 2008: 157-172 [doi]
On the Correctness of a Branch Displacement AlgorithmJaap Boender, Claudio Sacerdoti Coen. TACAS 2014: 605-619 [doi]
Spurious Disambiguation Error DetectionClaudio Sacerdoti Coen, Stefano Zacchiroli. AISC 2007: 381-392 [doi]
A Survey on Retrieval of Mathematical KnowledgeFerruccio Guidi, Claudio Sacerdoti Coen. mkm 2015: 296-315 [doi]
Spurious Disambiguation Errors and How to Get Rid of ThemClaudio Sacerdoti Coen, Stefano Zacchiroli. mics, 2(2):355-378, 2008. [doi]
Intelligent Computer Mathematics - 14th International Conference, CICM 2021, Timisoara, Romania, July 26-31, 2021, ProceedingsFairouz Kamareddine, Claudio Sacerdoti Coen, editors, Volume 12833 of Lecture Notes in Computer Science, Springer, 2021. [doi]
Reversibility in Erlang: Imperative ConstructsPietro Lami, Ivan Lanese, Jean-Bernard Stefani, Claudio Sacerdoti Coen, Giovanni Fabbretti. RC 2022: 187-203 [doi]
Functional and Constraint Logic Programming - 28th International Workshop, WFLP 2020, Bologna, Italy, September 7, 2020, Revised Selected PapersMichael Hanus, Claudio Sacerdoti Coen, editors, Volume 12560 of Lecture Notes in Computer Science, Springer, 2021. [doi]
Crafting a Proof AssistantAndrea Asperti, Claudio Sacerdoti Coen, Enrico Tassi, Stefano Zacchiroli. TYPES 2007: 18-32 [doi]
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. ProceedingsJacques Carette, Lucas Dixon, Claudio Sacerdoti Coen, Stephen M. Watt, editors, Volume 5625 of Lecture Notes in Computer Science, Springer, 2009. [doi]
Explanation in Natural Language of lamda-µµ-TermsClaudio Sacerdoti Coen. mkm 2005: 234-249 [doi]
Strong Call-by-Value is Reasonable, ImplosivelyBeniamino Accattoli, Andrea Condoluci, Claudio Sacerdoti Coen. lics 2021: 1-14 [doi]
Sharing Equality is LinearAndrea Condoluci, Beniamino Accattoli, Claudio Sacerdoti Coen. ppdp 2019: [doi]
On the Value of VariablesBeniamino Accattoli, Claudio Sacerdoti Coen. wollic 2014: 36-50 [doi]
Mathematical Libraries as Proof Assistant EnvironmentsClaudio Sacerdoti Coen. mkm 2004: 332-346 [doi]
XML, Stylesheets and the Re-mathematization of Formal ContentAndrea Asperti, Luca Padovani, Claudio Sacerdoti Coen, Irene Schena. extreme 2001: [doi]
A Formal Correspondence Between OMDoc with Alternative Proofs and the lambdaµµ-CalculusSerge Autexier, Claudio Sacerdoti Coen. AISC 2006: 67-81 [doi]
Functions as Processes: Termination and the lm[(m)/tilde]/lambda/mu/widetilde{/mu}-CalculusMatteo Cimini, Claudio Sacerdoti Coen, Davide Sangiorgi. tgc 2010: 73-86 [doi]
Mathematical Knowledge Management in HELMAndrea Asperti, Luca Padovani, Claudio Sacerdoti Coen, Ferruccio Guidi, Irene Schena. AMAI, 38(1-3):27-46, 2003.
From Proof-Assistants to Distributed Libraries of Mathematics: Tips and PitfallsClaudio Sacerdoti Coen. mkm 2003: 30-44 [doi]
Schemapath, a minimal extension to xml schema for conditional constraintsClaudio Sacerdoti Coen, Paolo Marinelli, Fabio Vitali. WWW 2004: 164-174 [doi]
A User Interface for a Mathematical System that Allows Ambiguous FormulaeClaudio Sacerdoti Coen. ENTCS, 226:67-87, 2009. [doi]
Crumbling Abstract MachinesBeniamino Accattoli, Andrea Condoluci, Giulio Guerrieri, Claudio Sacerdoti Coen. ppdp 2019: [doi]
An Interactive Algebra Course with Formalised Proofs and DefinitionsAndrea Asperti, Herman Geuvers, Iris Loeb, Lionel Elie Mamane, Claudio Sacerdoti Coen. mkm 2005: 315-329 [doi]
A Survey on Retrieval of Mathematical KnowledgeFerruccio Guidi, Claudio Sacerdoti Coen. mics, 10(4):409-427, 2016. [doi]
Towards an Implementation in LambdaProlog of the Two Level Minimalist Foundation (short paper)Alberto Fiori, Claudio Sacerdoti Coen. mkm 2019: [doi]
Formalizing Functions as ProcessesBeniamino Accattoli, Horace Blanc, Claudio Sacerdoti Coen. itp 2023: [doi]

runs on WebDSL