Name
Abstract | ||
|---|---|---|
This paper is a report about the use of Matita, an interactive theorem prover under development at the University of Bologna, for the solution of the POPLmark Challenge, part 1a. We provide three different formalizations, including two direct solutions using pure de Bruijn and locally nameless encodings of bound variables, and a formalization using named variables, obtained by means of a sound translation to the locally nameless encoding. According to this experience, we also discuss some of the proof principles used in our solutions, which have led to the development of a generalized inversion tactic for Matita. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1007/s10817-011-9228-z | J. Autom. Reasoning |
Keywords | Field | DocType |
Matita,Inversion principles,Encoding of variable bindings | Metatheory,Programming language,POPLmark challenge,Computer science,Algorithm,Theoretical computer science,De Bruijn sequence,Encoding (memory),Proof assistant | Journal |
Volume | Issue | ISSN |
49 | 3 | 0168-7433 |
Citations | PageRank | References |
3 | 0.44 | 9 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Andrea Asperti | 1 | 849 | 75.19 |
| Wilmer Ricciotti | 2 | 179 | 13.40 |
| Claudio Sacerdoti Coen | 3 | 384 | 40.66 |
| Enrico Tassi | 4 | 327 | 21.79 |