<--- Back to Details
First PageDocument Content
Logic / Computing / Mathematics / Automated theorem proving / Proof theory / Type theory / Logical truth / Syntax / Matita / Proof assistant / Mathematical proof / CurryHoward correspondence
Date: 2007-05-25 11:04:16
Logic
Computing
Mathematics
Automated theorem proving
Proof theory
Type theory
Logical truth
Syntax
Matita
Proof assistant
Mathematical proof
CurryHoward correspondence

Crafting a Proof Assistant Andrea Asperti, Claudio Sacerdoti Coen, Enrico Tassi, and Stefano Zacchiroli Department of Computer Science, University of Bologna Mura Anteo Zamboni, 7 – 40127 Bologna, ITALY {asperti,sacerd

Add to Reading List

Source URL: matita.cs.unibo.it

Download Document from Source Website

File Size: 423,17 KB

Share Document on Facebook

Similar Documents

Matita Tutorial ANDREA ASPERTI DISI: Dipartimento di Informatica, Universit`a degli Studi di Bologna and WILMER RICCIOTTI IRIT, Universit´e de Toulouse

Matita Tutorial ANDREA ASPERTI DISI: Dipartimento di Informatica, Universit`a degli Studi di Bologna and WILMER RICCIOTTI IRIT, Universit´e de Toulouse

DocID: 1tHPg - View Document

doi:j.entcs

doi:j.entcs

DocID: 1sc75 - View Document

Efficient Ambiguous Parsing of Mathematical Formulae? Claudio Sacerdoti Coen and Stefano Zacchiroli Department of Computer Science University of Bologna Mura Anteo Zamboni 7, 40127 Bologna, ITALY

Efficient Ambiguous Parsing of Mathematical Formulae? Claudio Sacerdoti Coen and Stefano Zacchiroli Department of Computer Science University of Bologna Mura Anteo Zamboni 7, 40127 Bologna, ITALY

DocID: 1rVg4 - View Document

From notation to semantics: there and back again Luca Padovani1 and Stefano Zacchiroli2 1  Information Science and Technology Institute, University of Urbino

From notation to semantics: there and back again Luca Padovani1 and Stefano Zacchiroli2 1 Information Science and Technology Institute, University of Urbino

DocID: 1qY5Z - View Document