Embedding a logical Theory of Constructions in agda

Proceedings of the 2009 ACM SIGPLAN Workshop on Programming Languages meets Program Verification, PLPV'09

Volumn , Issue , 2009, Pages 59-66

  Bove, Ana ^a   Dybjer, Peter ^a   Sicard Raḿirez, Andrès ^b  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

^b UNIVERSIDAD EAFIT   (Colombia)

Author keywords

General; Logical theory of constructions; Type Theory

Indexed keywords

FUNCTIONAL PROGRAMS; GENERAL; GREATEST COMMON DIVISORS; INTUITIONISTIC PREDICATE LOGIC; LOGICAL THEORIES; LOGICAL THEORY OF CONSTRUCTIONS; PROGRAMMING LANGUAGE; PROGRAMMING LOGIC; TYPE THEORY;

FUNCTIONAL PROGRAMMING; LINGUISTICS; QUERY LANGUAGES; RECURSIVE FUNCTIONS;

COMPUTER SOFTWARE SELECTION AND EVALUATION;

EID: 70149123071     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (29)

1. Andreas Abel, Marcin Benke, Ana Bove, John Hughes, and Ulf Norell. Verifying Haskell programs using constructive type theory. In Proc. of the ACMSIGPLAN 2005 Haskell Workshop, pages 62-73. ACM, 2005a. (Pubitemid 43206661)
2. Andreas Abel, Thierry Coquand, and Ulf Norell. Connecting a logical framework to a first-order logic prover. In B. Gramlich, editor, Proc. of 5th International Workshop on Frontiers of Combining Systems, volume 3717 of LNCS, pages 285-301, 2005b.
3. Peter Aczel. What might the objects of the logical theory of constructions be? In P. Dybjer et al., editors, Proc. of the Worshop on Programming Logic, number 54 in Programming Methodology Group Reports, pages 122-139. Chalmers University of Technology, 1989. 65
4. Peter Aczel. Frege structures and the notion of proposition, truth and set. In J. Barwise, H. J. Keisler, and K. Kunen, editors, The Kleene Symposium, volume 101 of Studies in Logic and the Foundations of Mathematics, pages 31-59. Amsterdan: North-Holland, 1980.
5. Peter Aczel. The strength of Martin-Löf's intuitionistic type theory with one universe. In S. Miettinen and J. Väananen, editors, Proc. of the Symposium on Mathematical Logic (Oulu, 1974), Report No. 2, Department of Philosopy, University of Helsinki, Helsinki, pages 1-32, 1977.
6. Peter Aczel, David P. Carlisle, and Nax Mendler. Two framework of theories and their implementation in Isabelle. In Ǵerard Huet and Gordon Plotkin, editors, Logical Frameworks, pages 3-39. Cambridge University Press, 1991.
7. Agda wiki. Available at appserv.cs.chalmers.se/users/ulfn/ wiki/agda.php, 2008.
8. Gilles Barthe, Julien Forest, David Pichardie, and Vlad Rusu. Defining and reasoning about recursive functions: A practical tool for the Coq proof assistant. In M. Hagiya and P. Wadler, editors, FLOPS, volume 3945 of Lecture Notes in Computer Science, pages 114-129. Springer, 2006. ISBN 3-540-33438-6. (Pubitemid 44029263)
9. Ana Bove and Venanzio Capretta. Modelling general recursion in type theory. Mathematical Structures in Computer Science, 15:671-708, February 2005. Cambridge University Press.
10. Ana Bove and Peter Dybjer. Dependent types at work, 2008. Lecture notes of a graduate course with the same name. Submitted for publication in the post-proceedings of the International Summer School on Language Engineering and Rigorous Software Development.
11. Koen Claessen and John Hughes. Quickcheck: a lightweight tool for random testing of Haskell programs. In Proc. of the ACM SIGPLAN International Conference on Functional Programming, volume 35.9 of ACM SIGPLAN Notices, pages 268-279. ACM, 2000. (Pubitemid 32024728)
12. Maarten de Mol, Marko van Eekelen, and Rinus Plasmeijer. Theorem proving for functional programmers. Sparkle: A functional theorem prover. In T. Arts and M. Mohnen, editors, Implementation of Functional Languages. 13th International Workshop, IFL 2001, volume 2312 of LNCS, pages 55-71, 2002.
13. Peter Dybjer. Inductive sets and families in Martin-Löf's type theory and their set-theoretic semantics. In G. Huet and G. Plotkin, editors, Logical Frameworks, pages 280-306. Cambridge University Press, 1991.
14. Peter Dybjer. Program verification in a logical theory of constructions. In J.-P. Jouannaud, editor, Functional Programming Languages and Computer Architecture, volume 201 of LNCS, pages 334-349, 1985. Appears in revised form as Programming Methodology Group Report 26, University of Gothenburg and Chalmers University of Technology, 1986.
15. Peter Dybjer. Comparing integrated and external logics of functional programs. Science of Computer Programming, 14:59-79, 1990.
16. Peter Dybjer and Herbert Sander. A functional programming approach to the specification and verification of concurrent systems. Formal Aspects of Computing, 1:303-319, 1989.
17. Solomon Feferman and Gerhard Jäger. Systems of explicit mathematics with non-constructive μmu; -operator, part II. Ann. Pure Appl. Logic, 79(1): 37-52, 1996. (Pubitemid 126169055)
18. Jean-Yves Girard. Linear logic and parallelism. InM. Venturini Zilli, editor, Mathematical Models for the Semantics of Parallelism, volume 280 of LNCS, pages 166-182, 1986.
19. Carlos Gonzaĺia. Relations in Dependent Type Theory. PhD thesis, Chalmers University of Technology and University of Gothenburg, Department of Computer Science and Engineering, 2006.
20. Michael J. C. Gordon, Robin Milner, and Christopher P. Wadsworth. Edinburgh LCF, volume 78 of Lecture Notes in Computer Science. Springer- Verlag, 1979.
21. Robert Harper, Furio Honsell, and Gordon Plotkin. A framework for defining logics. JACM, 40(1):143-184, 1993.
22. William L. Harrison and Richard B. Kieburtz. The logic of demand in Haskell. Journal of Functional Programming, 15(6):837-891, 2005. (Pubitemid 41426339)
23. Michael Hedberg. A type-theoretic interpretation of constructive domain theory. J. Autom. Reasoning, 16(3):369-425, 1996. (Pubitemid 126708525)
24. Ulf Norell. Towards a practical programming language based on dependent type theory.PhD thesis, Chalmers University of Technology and University of Gothenburg, Department of Computer Science and Engineering, 2007.
25. Lawrence C. Paulson. Isabelle. A Generic Theorem Prover, volume 828 of LNCS. Springer, 1994. (With a contribution by T. Nipkow).
26. Simon Peyton Jones, editor. Haskell 98 Language and Libraries The Revised Report. Cambridge University Press, April 2003.
27. Gordon Plotkin. LCF considered as a programming language. Theoretical Computer Science, 5(3):223-255, 1997.
28. Dana S. Scott. Data types as lattices. SIAMJ. Comput., 5(3):522-587, 1976.
29. Jan Smith. An interpretation of Martin-Löf's type theory in a type-free theory of propositions. The Journal of Symbolic Logic, 49(3):730-753,1984.