• Publications
  • Influence
The Matita Interactive Theorem Prover
TLDR
Matita is an interactive theorem prover being developed by the Helm team at the University of Bologna. Expand
User Interaction with the Matita Proof Assistant
TLDR
This paper focuses on some of the distinctive features of the user interaction with Matita, characterized mostly by the organization of the library as a searchable knowledge base. Expand
Mathematical Knowledge Management in HELM
TLDR
The paper describes the general philosophy and the main architectural and technological solutions adopted in the HELM Project for the management of large repositories of mathematical knowledge. Expand
A Bi-Directional Refinement Algorithm for the Calculus of (Co)Inductive Constructions
TLDR
The paper describes the renement algorithm for the Calculus of (Co)Inductive Constructions (CIC) implemented in the interactive theorem prover Matita. Expand
Schemapath, a minimal extension to xml schema for conditional constraints
TLDR
We propose SchemaPath, a light extension of XML Schema to handle conditional constraints on XML documents. Expand
ELPI: fast, Embeddable, λProlog Interpreter
TLDR
We present a new interpreter for λProlog that runs consistently faster than the byte code compiled by Teyjus, that is believed to be the best available implementation of the language. Expand
A Content Based Mathematical Search Engine: Whelp
TLDR
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. Expand
Crafting a Proof Assistant
TLDR
We analyze the architecture of Matita: a new interactive theorem prover based--as Coq--on the Calculus of Inductive Constructions. Expand
Tinycals: Step by Step Tacticals
TLDR
We propose Tinycals as an alternative to a subset of LCF tacticals, showing that the user does not experience the same problem if tacticals are evaluated in a fine-grained manner. Expand
ELPI: Fast, Embeddable, \lambda Prolog Interpreter
TLDR
We present a new interpreter for $$\lambda $$Prolog that runs consistently faster than the byte code compiled by Teyjus, that is considered the best available implementation of the language, that admits constant time reduction and unification rules. Expand
...
1
2
3
4
5
...