A module system for a programming language based on the LF logical framework

Journal of Logic and Computation

Volumn 8, Issue 1, 1998, Pages 5-31

  Harper, Robert ^a   Pfenning, Frank ^a  

^a Carnegie Mellon University ^*  (United States)

Author keywords

Dependent types; Logic programming; Logical frameworks; Modularity; Structured theories; Typed calculus

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; FORMAL LANGUAGES; FORMAL LOGIC;

DEDUCTIVE SYSTEMS; SEARCH SPACE MANAGEMENT;

LOGIC PROGRAMMING;

EID: 0032001503     PISSN: 0955792X     EISSN: None     Source Type: Journal    
DOI: 10.1093/logcom/8.1.5     Document Type: Article

References (31)

1. J. Cartmell. Generalized algebraic theories and contextual categories. Annals of Pure and Applied Logic, 32, 209-243, 1986.
2. T. Coquand. An algorithm for testing conversion in type theory. In Logical Frameworks, G. Huet and G. Plotkin, eds. pp. 255-279. Cambridge University Press, Cambridge, 1991.
3. T. Coquand and G. Huet. The Calculus of Constructions, information and Computation, 76, 95-120, 1988.
4. N. G. de Bruijn. Telescopic mappings in typed lambda calculus. Information and Computation, 91, 189-204, 1991.
5. P. deGroote. Nederpelt's calculus extended with a notion of context as a logical framework. In Logical Frameworks, G. Huet and G. Plotkin, eds. pp. 69-86. Cambridge University Press, Cambridge, 1991.
6. C. M. Elliott. Extensions and Applications of Higher-Order Unification. PhD thesis, School of Computer Science, Carnegie Mellon University, May 1990. Available as Technical Report CMU-CS-90-134.
7. W. M. Farmer, J. D. Guttman and F. J. Thayer. IMPS: An interactive mathematical proof system. In 10th International Conference on Automated Deduction, M. E. Stickel, ed. pp. 653-654. Vol. 449 of Lecture Notes in Artificial Intelligence, Springer Verlag, Berlin, 1990.
8. P. Gardner. Representing Logics in Type Theory. PhD thesis, University of Edinburgh, July 1992. Available as Technical Report CST-93-92.
9. H. Geuvers. The Church-Rosser property for βη-reduction in typed λ-calculi, in Seventh Annual IEEE Symposium on Logic in Computer Science, Santa Cruz, CA, A. Scedrov, ed. pp. 453-460. IEEE Computer Society Press, Los Alamitos,CA, 1992.
10. J. Hannan and F. Pfenning. Compiler verification in LF. In Seventh Annual IEEE Symposium on Logic in Computer Science, Santa Cruz, CA, A. Scedrov, ed. pp. 407-418. IEEE. Computer Society Press, Los Alamitos, CA, 1992.
11. R. Harper, F. Honsell and G. Plotkin. A framework for defining logics. Journal of the Associationfor Computing Machinery, 40, 143-184, 1993.
12. R. Harper, D. Sannella and A. Tarlecki. Logic representation. In Proceedings of the Workshop on Category Theory and Computer Science, Manchester, UK, D. H. Pitt, D. E. Rydeheard, P. Dybjer, A. M. Pitts and A. Poigneé, eds. Vol. 389 of Lecture Notes in Computer Science, pp. 250-272. Springer Verlag, Berlin, 1989.
13. R. Harper, D. Sannella and A. Tarlecki. Structure and representation in LF. In Fourth Annual Symposium on Logic in Computer Science, Pacific Grove, CA, R. Parikh, ed. pp. 226-237. IEEE, Computer Society Press, Los Alamitos, CA, 1989.
14. Z. Luo. ECC, an extended Calculus of Constructions. In Fourth Annual Symposium on Logic in Computer Science, Pacific Grove, CA, R. Parikh, ed. pp. 386-395. IEEE Computer Society Press, Los Alamitos, CA, 1989.
15. Z. Luo, R. Pollack and P. Taylor. How to use LEGO. Technical Report LFCS-TN-27, Laboratory for Foundations of Computer Science, University of Edinburgh, 1989.
16. D. MacQueen. Using dependent types to express modular structure. In Proceedings of the 13th ACM Symposium on Principles of Programming Languages, St Petersburg Beach, FL, C. N. Fischer, ed. pp. 277-286. ACM SIGPLAN/SIGACT, 1986.
17. S. Michaylov and F. Pfenning. Natural semantics and some of its meta-theory in Elf. In Proceedings of the Second International Workshop on Extensions of Logic Programming, Stockholm, Sweden, L.-H. Eriksson, L. Hallnäs and P. Schroeder-Heister, eds. Vol. 596 of Lecture Notes in Artificial Intelligence, pp. 299-344. Springer Verlag, Berlin, 1991.
18. D. Miller. A logical analysis of modules in logic programming. Journal of Logic Programming, 6, 57-77, 1989.
19. R. Milner, M. Tofte and R. Harper. The Definition of Standard ML. The MIT Press, Cambridge, MA, 1990.
20. G. Nadathur and D. Miller. An overview of λProlog. In Logic Programming: Proceedings of the Fifth International Conference and Symposium, Vol. I, Cambridge, MA, R. A. Kowalski and K. A. Bowen, eds. pp. 810-827. The MIT Press, Cambridge, MA, 1988.
21. L. C. Paulson and T. Nipkow. Isabelle tutorial and user's manual. Technical Report 189, Computer Laboratory, University of Cambridge, January 1990.
22. F. Pfenning. Elf: A language for logic definition and verified meta-programming. In Fourth Annual Symposium on Logic in Computer Science, Pacific Grove, CA, R. Parikh. ed. pp. 313-322. IEEE Computer Society Press, Los Alamitos, CA, 1989.
23. F. Pfenning. Logic programming in the LF logical framework. In Logical Frameworks, G. Huet and G. Plotkin, eds. pp. 149-181. Cambridge University Press, Cambridge, 1991.
24. F. Pfenning and E. Rohwedder. Implementing the meta-theory of deductive systems. In Proceedings of the 11th International Conference on Automated Deduction, Saratoga Springs, NY, D. Kapur, ed. Vol. 607 of Lecture Notes in Artificial Intelligence, pp. 537-551. Springer Verlag, Berlin, 1992.
25. R. Pollack. Implicit syntax. In Proceedings of the First Workshop on Logical Frameworks, Antibes, G. Huet and G. Plotkin, eds. pp. 421-434. Preliminary version, May 1990.
26. D. Pym. Proofs, Search and Computation in General Logic. PhD thesis, University of Edinburgh, 1990. Available as CST-69-90, also published as ECS-LFCS-90-125.
27. A. Salvesen. The Church-Rosser theorem for LF with βη-reduction. Unpublished notes to a talk given at the First Workshop on Logical Frameworks in Antibes, May 1990.
28. D. Sannella and R. Burstall. Structured theories in LCF. Technical Report CSR-129-83, University of Edinburgh, 1983.
29. D. T. Sannella and L. A. Wallen. A calculus for the construction of modular Prolog programs. Journal of Logic Programming, 12, 147-177, 1992. A preliminary version appears in Proceedings of the 4th Symposium on Logic Programming, San Francisco, CA, September 1987. IEEE Computer Society Press, Los Alamitos, CA.
30. D. T. Sannella and L. A. Wallen. A calculus for the construction of modular Prolog programs. Journal of Logic Programming, 12, 147-177, 1992. A preliminary version appears in Proceedings of the 4th Symposium on Logic Programming, San Francisco, CA, September 1987. IEEE Computer Society Press, Los Alamitos, CA.
31. M. Weber. A Meta-Calculus for Formal System Development. R. Oldenbourg Verlag, München/Wien, 1991.