default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEnrico Tassi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c26]Davide Fissore
, Enrico Tassi:
Higher-Order unification for free!: Reusing the meta-language unification for the object language. PPDP 2024: 3:1-3:13- 2023
- [c25]Benjamin Grégoire, Jean-Christophe Léchenet, Enrico Tassi:
Practical and Sound Equality Tests, Automatically: Deriving eqType Instances for Jasmin's Data Types with Coq-Elpi. CPP 2023: 167-181 - 2022
- [i6]Karl Palmskog, Enrico Tassi, Théo Zimmermann:
Reliably Reproducing Machine-Checked Proofs with the Coq Platform. CoRR abs/2203.09835 (2022) - 2021
- [e1]Elaine Pimentel, Enrico Tassi:
Proceedings of the Sixteenth Workshop on Logical Frameworks and Meta-Languages: Theory and Practice, LFMTP 2021, Pittsburgh, USA, 16th July 2021. EPTCS 337, 2021 [contents] - 2020
- [c24]Cyril Cohen, Kazuhiko Sakaguchi, Enrico Tassi:
Hierarchy Builder: Algebraic hierarchies Made Easy in Coq with Elpi (System Description). FSCD 2020: 34:1-34:21
2010 – 2019
- 2019
- [j7]Ferruccio Guidi, Claudio Sacerdoti Coen, Enrico Tassi:
Implementing type theory in higher order constraint logic programming. Math. Struct. Comput. Sci. 29(8): 1125-1150 (2019) - [c23]Enrico Tassi:
Deriving Proved Equality Tests in Coq-Elpi: Stronger Induction Principles for Containers in Coq. ITP 2019: 29:1-29:18 - 2018
- [j6]Alexander John Faithfull, Jesper Bengtson, Enrico Tassi, Carst Tankink:
Coqoon - An IDE for interactive proof development in Coq. Int. J. Softw. Tools Technol. Transf. 20(2): 125-137 (2018) - 2016
- [c22]Cvetan Dunchev, Claudio Sacerdoti Coen, Enrico Tassi:
Implementing HOL in an Higher Order Logic Programming Language. LFMTP 2016: 4:1-4:10 - [c21]Alexander John Faithfull, Jesper Bengtson, Enrico Tassi, Carst Tankink:
Coqoon - An IDE for Interactive Proof Development in Coq. TACAS 2016: 316-331 - 2015
- [c20]Bruno Barras, Carst Tankink, Enrico Tassi:
Asynchronous Processing of Coq Documents: From the Kernel up to the User Interface. ITP 2015: 51-66 - [c19]Cvetan Dunchev, Ferruccio Guidi, Claudio Sacerdoti Coen, Enrico Tassi:
ELPI: Fast, Embeddable, λProlog Interpreter. LPAR 2015: 460-468 - [i5]Bruno Barras, Carst Tankink, Enrico Tassi:
Asynchronous processing of Coq documents: from the kernel up to the user interface. CoRR abs/1506.05605 (2015) - 2014
- [c18]Frédéric Chyzak, Assia Mahboubi, Thomas Sibut-Pinote, Enrico Tassi:
A Computer-Algebra-Based Formal Proof of the Irrationality of ζ(3). ITP 2014: 160-176 - 2013
- [c17]Assia Mahboubi, Enrico Tassi:
Canonical Structures for the Working Coq User. ITP 2013: 19-34 - [c16]Georges Gonthier, Andrea Asperti, Jeremy Avigad, Yves Bertot, Cyril Cohen, François Garillot, Stéphane Le Roux, Assia Mahboubi, Russell O'Connor, Sidi Ould Biha, Ioana Pasca, Laurence Rideau, Alexey Solovyev, Enrico Tassi, Laurent Théry:
A Machine-Checked Proof of the Odd Order Theorem. ITP 2013: 163-179 - [c15]Bruno Barras, Lourdes Del Carmen González-Huesca, Hugo Herbelin, Yann Régis-Gianas, Enrico Tassi, Makarius Wenzel, Burkhart Wolff:
Pervasive Parallelism in Highly-Trustable Interactive Theorem Proving Systems. MKM/Calculemus/DML 2013: 359-363 - [i4]Bruno Barras, Lourdes Del Carmen González-Huesca, Hugo Herbelin, Yann Régis-Gianas, Enrico Tassi, Makarius Wenzel, Burkhart Wolff:
Pervasive Parallelism in Highly-Trustable Interactive Theorem Proving Systems. CoRR abs/1305.7360 (2013) - 2012
- [j5]Andrea Asperti, Wilmer Ricciotti, Claudio Sacerdoti Coen, Enrico Tassi:
A Bi-Directional Refinement Algorithm for the Calculus of (Co)Inductive Constructions. Log. Methods Comput. Sci. 8(1) (2012) - [j4]Andrea Asperti, Wilmer Ricciotti, Claudio Sacerdoti Coen, Enrico Tassi:
Formal Metatheory of Programming Languages in the Matita Interactive Theorem Prover. J. Autom. Reason. 49(3): 427-451 (2012) - [c14]Georges Gonthier, Enrico Tassi:
A Language of Patterns for Subterm Selection. ITP 2012: 361-376 - 2011
- [j3]Claudio Sacerdoti Coen, Enrico Tassi:
Formalising Overlap Algebras in Matita. Math. Struct. Comput. Sci. 21(4): 763-793 (2011) - [c13]Andrea Asperti, Wilmer Ricciotti, Claudio Sacerdoti Coen, Enrico Tassi:
The Matita Interactive Theorem Prover. CADE 2011: 64-69 - 2010
- [c12]Andrea Asperti, Enrico Tassi:
Smart Matching. AISC/MKM/Calculemus 2010: 263-277 - [i3]Andrea Asperti, Enrico Tassi:
Smart matching. CoRR abs/1005.0349 (2010) - [i2]Andrea Asperti, Claudio Sacerdoti Coen, Enrico Tassi:
Regular Expressions, au point. CoRR abs/1010.2604 (2010)
2000 – 2009
- 2009
- [c11]Claudio Sacerdoti Coen, Enrico Tassi:
Natural Deduction Environment for Matita. Calculemus/MKM 2009: 486-491 - [c10]Andrea Asperti, Wilmer Ricciotti, Claudio Sacerdoti Coen, Enrico Tassi:
Hints in Unification. TPHOLs 2009: 84-98 - [c9]Andrea Asperti, Enrico Tassi:
Superposition as a logical glue. TYPES 2009: 1-15 - [c8]Claudio Sacerdoti Coen, Enrico Tassi:
Nonuniform Coercions via Unification Hints. TYPES 2009: 16-29 - 2008
- [b1]Enrico Tassi:
Interactive theorem provers: issues faced as a user and tackled as a developer. University of Bologna, Italy, 2008 - [j2]Claudio Sacerdoti Coen, Enrico Tassi:
A constructive and formal proof of Lebesgue's Dominated Convergence Theorem in the interactive theorem prover Matita. J. Formaliz. Reason. 1(1): 51-89 (2008) - [c7]Andrea Asperti, Enrico Tassi:
An Interactive Driver for Goal-directed Proof Strategies. UITP@TPHOLs 2008: 89-105 - 2007
- [j1]Andrea Asperti, Claudio Sacerdoti Coen, Enrico Tassi, Stefano Zacchiroli:
User Interaction with the Matita Proof Assistant. J. Autom. Reason. 39(2): 109-139 (2007) - [c6]Andrea Asperti, Enrico Tassi:
Higher order Proof Reconstruction from Paramodulation-Based Refutations: The Unit Equality Case. Calculemus/MKM 2007: 146-160 - [c5]Georges Gonthier, Assia Mahboubi, Laurence Rideau, Enrico Tassi, Laurent Théry:
A Modular Formalisation of Finite Group Theory. TPHOLs 2007: 86-101 - [c4]Claudio Sacerdoti Coen, Enrico Tassi:
Working with Mathematical Structures in Type Theory. TYPES 2007: 157-172 - 2006
- [c3]Andrea Asperti, Claudio Sacerdoti Coen, Enrico Tassi, Stefano Zacchiroli:
Crafting a Proof Assistant. TYPES 2006: 18-32 - [c2]Claudio Sacerdoti Coen, Enrico Tassi, Stefano Zacchiroli:
Tinycals: Step by Step Tacticals. UITP@FLoC 2006: 125-142 - 2004
- [c1]Andrea Asperti, Ferruccio Guidi, Claudio Sacerdoti Coen, Enrico Tassi, Stefano Zacchiroli:
A Content Based Mathematical Search Engine: Whelp. TYPES 2004: 17-32 - 2001
- [i1]L. A. T. Bauerdick, Adrian Fox-Murphy, Tobias Haas, Stefan Stonjek, Enrico Tassi:
Event Indexing Systems for Efficient Selection and Analysis of HERA Data. CoRR cs.DB/0104008 (2001)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 22:58 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
