Beluga: A framework for programming and reasoning with deductive systems (system description)

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

Volumn LNCS 6173, Issue , 2010, Pages 15-21

  Pientka, Brigitte ^a   Dunfield, Jana ^a  

^a MCGILL UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

SYNTACTICS;

CHURCH-ROSSER THEOREM; COMPILER TRANSFORMATIONS; DEDUCTIVE SYSTEMS; FORMAL SYSTEMS; HIGHER-ORDER ABSTRACT SYNTAX; INFERENCE RULES; LOGICAL FRAMEWORKS; ML-LIKE LANGUAGES; REASONING WITH CONTEXTS; SYSTEM DESCRIPTION;

RECURSIVE FUNCTIONS;

EID: 77955254024     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-14203-1_2     Document Type: Conference Paper

References (13)

1. Dunfield, J., Pientka, B.: Case analysis of higher-order data. In: International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP'08), June 2009. Electronic Notes in Theoretical Computer Science (ENTCS), vol. 228, pp. 69-84. Elsevier, Amsterdam (2009)
2. 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)
3. Harper, R., Honsell, F., Plotkin, G.: A framework for defining logics. Journal of the ACM 40(1), 143-184 (1993)
4. Miller, D.: A logic programming language with lambda-abstraction, function variables, and simple unification. Journal of Logic and Computation 1(4), 497-536 (1991)
5. Momigliano, A., Martin, A.J., Felty, A.P.: Two-Level Hybrid: A system for reasoning using higher-order abstract syntax. In: International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP'07). Electronic Notes in Theoretical Computer Science (ENTCS), vol. 196, pp. 85-93. Elsevier, Amsterdam (2008)
6. Necula, G.C.: Proof-carrying code. In: 24th Annual Symposium on Principles of Programming Languages (POPL'97), January 1997, pp. 106-119. ACM Press, New York (1997)
7. 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)
8. Pientka, B.: Tabled higher-order logic programming. PhD thesis, Department of Computer Science, Carnegie Mellon University, CMU-CS-03-185 (2003)
9. Pientka, B.: Verifying termination and reduction properties about higher-order logic programs. Journal of Automated Reasoning 34(2), 179-207 (2005)
10. Pientka, B.: A type-theoretic foundation for programming with higher-order abstract syntax and first-class substitutions. In: 35th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL'08), pp. 371-382. ACM Press, New York (2008)
11. Pientka, B., Dunfield, J.: Programming with proofs and explicit contexts. In: ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming (PPDP'08), July 2008, pp. 163-173. ACM Press, New York (2008)
12. Poswolsky, A., Schürmann, C.: System description: Delphin - a functional programming language for deductive systems. In: International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP'08), June 2009. Electronic Notes in Theoretical Computer Science (ENTCS), vol. 228, pp. 135-141. Elsevier, Amsterdam (2009)
13. Rohwedder, E., Pfenning, F.: Mode and termination checking for higher-order logic programs. In: Nielson, H.R. (ed.) ESOP 1996. LNCS, vol. 1058, pp. 296-310. Springer, Heidelberg (1996)