Claudio Sacerdoti Coen Dblp

dblp: Claudio Sacerdoti Coen

https://dblp.org/pid/40/646

Claudio Sacerdoti Coen | DeepAI

https://deepai.org/profile/claudio-sacerdoti-coen

01/08/2021 ∙ by Claudio Sacerdoti Coen, et al. ∙ 0 ∙ share read it Pre-Proceedings of the 28th International Workshop on Functional and Logic Programming (WFLP 2020)

Claudio Sacerdoti Coen's home page - Plone site

http://www.cs.unibo.it/~sacerdot/

Software. Code (in C#) for the paper "Sharing Equivalence is Linear".. Author: Emanuele Sinagra under the supervision of Claudio Sacerdoti Coen. The code implements: An algorithm to enumerate all term forests, i.e. DAGs representing sets of λ-terms via sharing, up to a certain size.; An algorithm to randomly generate a term forests.

[1105.2725] A Foundational View on Integration Problems

https://arxiv.org/abs/1105.2725

CiteSeerX — User Interaction with the Matita Proof …

https://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.96.5469

CiteSeerX

https://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.74.4325

CiteSeerX

https://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.62.9158

CiteSeerX - Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): Most of the state-of-the-art proof assistants are based on procedural proof languages, scripts, and rely on LCF tacticals as the primary tool for tactics composition. In this paper we discuss how these ingredients do not interact well with user interfaces based on the same interaction paradigm of …

DBLP: Andrea Asperti

http://www09.sigmod.org/sigmod/dblp/db/indices/a-tree/a/Asperti:Andrea.html

Andrea Asperti, Claudio Sacerdoti Coen, Enrico Tassi, Stefano Zacchiroli: Crafting a Proof Assistant. TYPES 2006: 18-32: 2005; 45: EE: 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; 44

[1010.2604] Regular Expressions, au point

https://arxiv.org/abs/1010.2604

Authors: Andrea Asperti, Claudio Sacerdoti Coen, Enrico Tassi (Submitted on 13 Oct 2010) Abstract: We introduce a new technique for constructing a finite state deterministic automaton from a regular expression, based on the idea of marking a suitable set of positions inside the expression, intuitively representing the possible points reached ...

CiteSeerX — A content based mathematical search engine: whelp

https://citeseer.ist.psu.edu/viewdoc/summary?doi=10.1.1.108.1388

CiteSeerX - Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): Abstract. The prototype of a content based search engine for mathematical knowledge supporting a small set of queries requiring matching and/or typing operations is described. The prototype — called Whelp — exploits a metadata approach for indexing the information that looks far more flexible than …