Logic for Programming, Artificial Intelligence, and Reasoning

Logic for Programming, Artificial Intelligence, and Reasoning pp 402-417 | Cite as

A Contextual Logical Framework

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9450)

Abstract

A new logical framework with explicit linear contexts and names is presented with the purpose of enabling direct and flexible manipulation of contexts, both for representing systems and meta-properties. The framework is a conservative extension of the logical framework LF, and builds on linear logic and contextual modal type theory. We prove that the framework admits canonical forms, and that it possesses all desirable meta-theoretic properties, in particular hereditary substitutions.

As proof of concept, we give an encoding of the one-sided sequent calculus for classical linear logic and the corresponding cut-admissibility proof, as well as an encoding of parallel reduction of lambda terms with the corresponding value-soundness proof.

References

  1. 1.
    Gacek, A.: The abella interactive theorem prover (system description). In: Armando, A., Baumgartner, P., Dowek, G. (eds.) IJCAR 2008. LNCS (LNAI), vol. 5195, pp. 154–161. Springer, Heidelberg (2008) CrossRefGoogle Scholar
  2. 2.
    Girard, J.-Y.: Linear Logic: Its Syntax and Semantics. London Mathematical Society Lecture Note Series, pp. 1–42. Cambridge University Press, New York (1995) CrossRefGoogle Scholar
  3. 3.
    Harper, R., Honsell, F., Plotkin, G.: A framework for defining logics. J. ACM (JACM) 40(1), 143–184 (1993)MATHMathSciNetCrossRefGoogle Scholar
  4. 4.
    Nanevski, A., Pfenning, F., Pientka, B.: Contextual modal type theory. ACM Trans. Comput. Logic (TOCL) 9(3), 23 (2008)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Pfenning, F., Cervesato, I.: A linear logical framework. In: Clarke, E. (ed.) 11th Annual Symposium on Logic in Computer Science – LICS 1996, pp. 264–275. IEEE Computer Society Press, New Brunswick, 27–30 July 1996. This work appeared as Preprint 1834 of the Department of Mathematics of Technical University of Darmstadt, GermanyGoogle Scholar
  6. 6.
    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
  7. 7.
    Pientka, B.: A type-theoretic foundation for programming with higher-order abstract syntax and first-class substitutions. In: 35th Annual ACM Symposium on Principles of Programming Languages (POPL 2008), pp. 371–382. ACM (2008)Google Scholar
  8. 8.
    Pientka, B., Dunfield, J.: Beluga: a framework for programming and reasoning with deductive systems (system description). In: Giesl, J., Hähnle, R. (eds.) IJCAR 2010. LNCS, vol. 6173, pp. 15–21. Springer, Heidelberg (2010) CrossRefGoogle Scholar
  9. 9.
    Pitts, A.M.: Nominal logic, a first order theory of names and binding. Inf. Comput. 186(2), 165–193 (2003)MATHMathSciNetCrossRefGoogle Scholar
  10. 10.
    Poswolsky, A.: Functional Programming with Logical Frameworks: The Delphin Project. Ph.D. thesis, Yale University (2008)Google Scholar
  11. 11.
    Reed, J.: A hybrid logical framework. Ph.D. thesis, School of Computer Science, Carnegie Mellon University (2009)Google Scholar
  12. 12.
    Watkins, K., Cervesato, I., Pfenning, F., Walker, D.: A concurrent logical framework i: Judgments and properties. Technical report CMU-CS-02-101, Department of Computer Science, Carnegie Mellon University (2002)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2015

Authors and Affiliations

  1. 1.IT University of CopenhagenCopenhagenDenmark

Personalised recommendations