First Page | Document Content | |
---|---|---|
Date: 2007-05-25 11:04:16Logic 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,sacerdAdd to Reading ListSource URL: matita.cs.unibo.itDownload Document from Source WebsiteFile Size: 423,17 KBShare Document on Facebook |
Matita Tutorial ANDREA ASPERTI DISI: Dipartimento di Informatica, Universit`a degli Studi di Bologna and WILMER RICCIOTTI IRIT, Universit´e de ToulouseDocID: 1tHPg - View Document | |
doi:j.entcsDocID: 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, ITALYDocID: 1rVg4 - View Document | |
From notation to semantics: there and back again Luca Padovani1 and Stefano Zacchiroli2 1 Information Science and Technology Institute, University of UrbinoDocID: 1qY5Z - View Document |