IVOR, a proof engine

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

Volumn 4449 LNCS, Issue , 2007, Pages 145-162

  Brady, Edwin ^a  

^a UNIVERSITY OF ST ANDREWS   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED DESIGN; COMPUTER PROGRAMMING LANGUAGES; FUNCTIONAL PROGRAMMING; VERIFICATION;

FUNCTIONAL PROGRAMMING LANGUAGE; HASKELL APPLICATION; HASKELL LIBRARY; PROGRAM VERIFICATION;

THEOREM PROVING;

EID: 38049132390     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74130-5_9     Document Type: Conference Paper

References (36)

1. Cover translator. http://coverproject.org/CoverTranslator/
2. Barras, B., Werner, B.: Coq in Coq (1997)
3. Brady, E.: Practical Implementation of a Dependently Typed Functional Programming Language. PhD thesis, University of Durham (2005)
4. Brady, E., Hammond, K.: A dependently typed framework for static analysis of program execution costs. In: Butterfield, A., Grelck, C., Huch, F. (eds.) IFL 2005. LNCS, vol. 4015, pp. 74-90. Springer, Heidelberg (2006)
5. Brady, E., Hammond, K.: A verified staged interpreter is a verified compiler. In: Proc. Conf. Generative Programming and Component Engineering (GPCE '06) (2006)
6. Chapman, J., Altenkirch, T., McBride, C.: Epigram reloaded: A standalone typechecker for ETT. In: Trends in Functional Programming, 2005. To appear (2006)
7. Coq Development Team. The Coq proof assistant -reference manual. (2001) http://coq.inria.fr/
8. Coquand, C.: Agda. (2005) http://agda.sourceforge.net/
9. Coquand, T.: Pattern matching with dependent types. Available from (1992) http://www.cs.Chalmers.se/∼ coquand/type.html
10. Curry, H.B., Feys, R.: Combinatory Logic, vol. 1. North Holland, Amsterdam (1958)
11. de Mol, M., van Eekelen, M., Plasmeijer, R.: Theorem proving for functional programmers. In: Arts, T., Mohnen, M. (eds.) IFL 2002. LNCS, vol. 2312, Springer, Heidelberg (2002)
12. Dybjer, P.: Inductive families. Formal Aspects Of. Computing 6, 440-465 (1994)
13. Filliâtre, J.-C.: Why: a multi-language multi-prover verification tool. Research Report 1366, LRI, Université Paris Sud (March 2003)
14. Geuvers, H., Wiedijk, F., Zwanenburg, J.: A constructive proof of the fundamental theorem of algebra without using the rationals. In: TYPES 2000, pp. 96-111 (2000)
15. Giménez, E.: An application of co-inductive types in coq: Verification of the alternating bit protocol. In: Berardi, S., Coppo, M. (eds.) TYPES 1995. LNCS, vol. 1158, pp. 135-152. Springer, Heidelberg (1996)
16. Gonthier, G.: A computer-checked proof of the Four Colour Theorem. (2005) http://research.microsoft.com/∼ gonthier/4colproof.pdf
17. Hammond, K., Michaelson, G.: Hume: a Domain-Specific Language for Real-Time Embedded Systems. In: Proc. Conf. Generative Programming and Component Engineering (GPCE '03), Springer, Heidelberg (2003)
18. Howard, W.A.: The formulae-as-types notion of construction, A reprint of an unpublished manuscript from 1969. In: Seldin, J.P., Hindley, J.R. (eds.) To H.B.Curry: Essays on combinatory logic, lambda calculus and formalism, Academic Press, San Diego (1980)
19. Hudak, P.: Building domain-specific embedded languages. ACM Computing Surveys, 28A(4) (December 1996)
20. Leroy, X.: Formal certification of a compiler back-end. In: Principles of Programming Languages 2006, pp. 42-54. ACM Press, New York (2006)
21. Letouzey, P.: A new extraction for Coq. In: Geuvers, H., Wiedijk, F. (eds.) TYPES 2002. LNCS, vol. 2646, pp. 200-219. Springer, Heidelberg (2003)
22. Luo, Z.: Computation and Reasoning - A Type Theory for Computer Science. Intl. Series of Monographs on Comp. Sci. OUP (1994)
23. Luo, Z., Pollack, R.: Lego proof development system: User's manual. Technical report, Department of Computer Science, University of Edinburgh (1992)
24. McBride, C.: Dependently Typed Functional Programs and their proofs. PhD thesis, University of Edinburgh (May 2000)
25. McBride, C., Goguen, H., McKinna, J.: Some constructions on constructors. In: Filliâtre, J.-C., Paulin-Mohring, C., Werner, B. (eds.) TYPES 2004. LNCS, vol. 3839, Springer, Heidelberg (2006)
26. McBride, C., McKinna, J.: I am not a number, I am a free variable. In: Proceedings of the ACM SIGPLAN Haskell Workshop (2004)
27. McBride, C., McKinna, J.: The view from the left. Journal of Functional Programming 14(1), 69-111 (2004)
28. McKinna, J., Wright, J.: A type-correct, stack-safe, provably correct, expression compiler in Epigram. Journal of Functional Programming. To appear (2007)
29. Milner, R.: LCF: A way of doing proofs with a machine. In: Winkowski, J. (ed.) Mathematical Foundations of Computer Science 1978. LNCS, vol. 64, pp. 146-159. Springer, Heidelberg (1978)
30. Nipkow, T., Paulson, L.C., Wenzel, M.: Isabelle/HOL - A proof assistant for higher order logic. In: Nipkow, T., Paulson, L.C., Wenzel, M. (eds.) Isabelle/HOL. LNCS, vol. 2283, Springer, Heidelberg (2002)
31. Jones, S.P., Vytiniotis, D., Weirich, S., Washburn, G.: Simple unification-based type inference for GADTs. In: Proc. 2006 International Conf. on Functional Programming (ICFP 2006) (2006)
32. Plasmeijer, R., van Eekelen, M.: The Concurrent CLEAN language report (draft). Available from http://www.cs.kun.nl/-clean/ (2003)
33. Pollack, R.: Implicit syntax. Informal Proceedings of First Workshop on Logical Frameworks, Antibes (May 1990)
34. Pugh, W.: The Omega Test: a fast and practical integer programming algorithm for dependence analysis. Communication of the ACM, pp. 102-114 (1992)
35. Sheard, T.: Languages of the future. In: ACM Conference on Object Orientated Programming Systems, Languages and Applications (OOPSLA'04) (2004)
36. Taha, W.: A gentle introduction to multi-stage programming. Available from (2003) http://www.cs.rice.edu/∼taha/publications/journal/dspg04a.pdf