Advertisement

Abstract

Logical framework research is based on the philosophical point of view that it should be possible to capture mathematical concepts such as proofs, logics, and meaning in a formal system — directly, adequately (in the sense that there are no spurious or exotic witnesses), and without having to commit to a particular logical theory. Instead of working with one general purpose representation language, we design special purpose logical frameworks for capturing reoccurring concepts for special domains, such as, for example, variable renaming, substitution application, and resource management for programming language theory. Most logical frameworks are based on constructive type theories, such as Isabelle (on the simply-typed λ-calculus), LF [HHP93] (on the dependently typed λ-calculus), and LLF (on a linearly typed λ-calculus). The representational strength of the logical framework stems from the choice of definitional equality on terms. For example, α-conversion models the tacit renaming of variables, β-contraction models substitution application, and η-expansion guarantees the adequacy of encodings.

Keywords

Classical Logic Deductive System Intuitionistic Logic Logical Framework Proof Assistant 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Cra03]
    Crary, K.: Toward a foundational typed assembly language. In: Morrisett, G. (ed.) Proceedings of the 30th ACM Symposium on Principles of Programming Languages, New Orleans, Louisiana. SIGPLAN Notices, vol. 38(1), pp. 198–212. ACM Press, New York (2003)Google Scholar
  2. [HHP93]
    Harper, R., Honsell, F., Plotkin, G.: A framework for defining logics. Journal of the Association for Computing Machinery 40(1), 143–184 (1993)MathSciNetCrossRefMATHGoogle Scholar
  3. [LCH07]
    Lee, D.K., Crary, K., Harper, R.: Towards a mechanized metatheory of standard ML. In: Proceedings of the 34th Annual Symposium on Principles of Programming Languages, pp. 173–184. ACM Press, New York (2007)Google Scholar
  4. [Pfe95]
    Pfenning, F.: Structural cut elimination. In: Kozen, D. (ed.) Proceedings of the Tenth Annual Symposium on Logic in Computer Science, San Diego, California, pp. 156–166. IEEE Computer Society Press, Los Alamitos (1995)CrossRefGoogle Scholar
  5. [PS99]
    Pfenning, F., Schürmann, C.: System description: Twelf — a meta-logical framework for deductive systems. In: Ganzinger, H. (ed.) CADE 1999. LNCS (LNAI), vol. 1632, pp. 202–206. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  6. [SS06]
    Schürmann, C., Stehr, M.O.: An executable formalization of the HOL/Nuprl connection in the meta-logical framework Twelf. In: Hermann, M., Voronkov, A. (eds.) LPAR 2006. LNCS, vol. 4246, pp. 150–166. Springer, Heidelberg (2006)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Carsten Schürmann
    • 1
  1. 1.IT University of CopenhagenDenmark

Personalised recommendations