A tool for automated theorem proving in Agda

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3839 LNCS, Issue , 2006, Pages 154-169

  Lindblad, Fredrik ^a   Benke, Marcin ^a  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED SOFTWARE ENGINEERING; FUNCTIONAL ELECTRIC STIMULATION; PROGRAM COMPILERS; THEOREM PROVING;

AGDA COMMUNITY; AUTOMATED THEOREM PROVING; PROGRAM VERIFICATION; READABLE RESULTS;

AUTOMATA THEORY;

EID: 33745153057     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11617990_10     Document Type: Conference Paper

References (12)

1. Andreas Abel, Thierry Coquand, and Ulf Norell. Connecting a logical framework to a first-order logic prover. Submitted, 2005.
2. Peter B. Andrews. Classical type theory. In Alan Robinson and Andrei Voronkov, editors, Handbook of Automated Reasoning, volume 2, chapter 15, pages 965-1007. Elsevier Science, 2001.
3. Catharina Coquand. The AGDA Proof System Homepage. http://www.cs. chalmers.se/catarina/agda/, 1998.
4. Christina Cornes. Conception d'un langage de haut niveau de représentation de preuves: Récurrence par filtrage de motifs, Unification en présence de types inductifs primitifs, Synthèse de lemmes d'inversion, PhD thesis, Université Paris 7, 1997.
5. Gilles Dowek. A complete proof synthesis method for the cube of type systems. J. Logic and Computation, 3(3):287-315, 1993.
6. Gilles Dowek. Higher-order unification and matching. In Alan Robinson and Andrei Voronkov, editors, Handbook of automated reasoning, volume 2, chapter 16, pages 1009-1062. Elsevier Science, 2001.
7. Peter Dybjer. Inductive sets and families in martin-löf's type theory and their settheoretic semantics. In Logical frameworks, pages 280-306. Cambridge University Press, New York, NY, USA, 1991.
8. Fredrik Lindblad. Agsy problem examples. http://www.es.chalmers.se/ ~frelindb/Agsy_examples.tgz, 2004.
9. Lena Magnusson. The Implementation of ALF - a Proof Editor based on MartinLöf's Monomorphic Type Theory with Explicit Substitution. PhD thesis, Department of Computing Science, Chalmers University of Technology and University of Göteborg, 1994.
10. P. Martin-Löf. Intuitionistic Type Theory. Bibliopolis, Napoli, 1984.
11. Carsten Schürmann and Frank Pfenning. Automated theorem proving in a simple meta-logic for If. In Claude Kirchner and Hélène Kirchner, editors, Proceedings of the 15th International Conference on Automated Deduction (CADE-15), pages 286-300. Springer-Verlag LNCS, July 1998.
12. Tannel Tammet and Jan Smith. Optimized encodings of fragments of type theory in first-order logic. Journal of Logic and Computation, 8, 1998.