메뉴 건너뛰기




Volumn 5195 LNAI, Issue , 2008, Pages 154-161

The abella interactive theorem prover (system description)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; DIFFERENTIATION (CALCULUS); FORMAL LOGIC; INFORMATION THEORY; LINGUISTICS; MATHEMATICAL TECHNIQUES; SPECIFICATIONS; SYNTACTICS; THEOREM PROVING;

EID: 53049108308     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-71070-7_13     Document Type: Conference Paper
Times cited : (67)

References (17)
  • 1
    • 26844460326 scopus 로고    scopus 로고
    • Aydemir, B.E., Bohannon, A., Fairbairn, M., Foster, J.N., Pierce, B.C., Sewell, P., Vytiniotis, D., Washburn, G., Weirich, S., Zdancewic, S.: Mechanized metatheory for the masses: The PoplMark challenge. In: Hurd, J., Melham, T. (eds.) TPHOLs 2005. LNCS, 3603, pp. 50-65. Springer, Heidelberg (2005)
    • Aydemir, B.E., Bohannon, A., Fairbairn, M., Foster, J.N., Pierce, B.C., Sewell, P., Vytiniotis, D., Washburn, G., Weirich, S., Zdancewic, S.: Mechanized metatheory for the masses: The PoplMark challenge. In: Hurd, J., Melham, T. (eds.) TPHOLs 2005. LNCS, vol. 3603, pp. 50-65. Springer, Heidelberg (2005)
  • 2
    • 38149040853 scopus 로고    scopus 로고
    • Baelde, D., Miller, D.: Least and greatest fixed points in linear logic. In: Dershowitz, N., Voronkov, A. (eds.) LPAR, 2007. LNCS (LNAI), 4790, pp. 92-106. Springer, Heidelberg (2007)
    • Baelde, D., Miller, D.: Least and greatest fixed points in linear logic. In: Dershowitz, N., Voronkov, A. (eds.) LPAR, 2007. LNCS (LNAI), vol. 4790, pp. 92-106. Springer, Heidelberg (2007)
  • 4
    • 51549092079 scopus 로고    scopus 로고
    • Combining generic judgments with recursive definitions
    • Pfenning, F, ed, IEEE Computer Society Press, Los Alamitos to appear
    • Gacek, A., Miller, D., Nadathur, G.: Combining generic judgments with recursive definitions. In: Pfenning, F. (ed.) 23th Symp. on Logic in Computer Science. IEEE Computer Society Press, Los Alamitos (to appear, 2008)
    • (2008) 23th Symp. on Logic in Computer Science
    • Gacek, A.1    Miller, D.2    Nadathur, G.3
  • 5
    • 53049101264 scopus 로고    scopus 로고
    • Gacek, A., Miller, D., Nadathur, G.: Reasoning in Abella about structural operational semantics specifications. In: LFMTP 2008 (to appear, 2008), http://arxiv.org/abs/0804.3914
    • Gacek, A., Miller, D., Nadathur, G.: Reasoning in Abella about structural operational semantics specifications. In: LFMTP 2008 (to appear, 2008), http://arxiv.org/abs/0804.3914
  • 6
    • 0041524803 scopus 로고    scopus 로고
    • Reasoning with higher-order abstract syntax in a logical framework
    • McDowell, R., Miller, D.: Reasoning with higher-order abstract syntax in a logical framework. ACM Trans. on Computational Logic 3(1), 80-136 (2002)
    • (2002) ACM Trans. on Computational Logic , vol.3 , Issue.1 , pp. 80-136
    • McDowell, R.1    Miller, D.2
  • 7
    • 84867771131 scopus 로고    scopus 로고
    • Miller, D.: Abstract syntax for variable binders: An overview. In: Palamidessi, C., Moniz Pereira, L., Lloyd, J.W., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Sagiv, Y., Stuckey, P.J. (eds.) CL 2000. LNCS (LNAI), 1861, pp. 239-253. Springer, Heidelberg (2000)
    • Miller, D.: Abstract syntax for variable binders: An overview. In: Palamidessi, C., Moniz Pereira, L., Lloyd, J.W., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Sagiv, Y., Stuckey, P.J. (eds.) CL 2000. LNCS (LNAI), vol. 1861, pp. 239-253. Springer, Heidelberg (2000)
  • 9
  • 10
    • 27144518443 scopus 로고    scopus 로고
    • Nadathur, G., Linnell, N.: Practical higher-order pattern unification with on-thefly raising. In: Gabbrielli, M., Gupta, G. (eds.) ICLP 2005. LNCS, 3668, pp. 371-386. Springer, Heidelberg (2005)
    • Nadathur, G., Linnell, N.: Practical higher-order pattern unification with on-thefly raising. In: Gabbrielli, M., Gupta, G. (eds.) ICLP 2005. LNCS, vol. 3668, pp. 371-386. Springer, Heidelberg (2005)
  • 12
    • 84957611918 scopus 로고    scopus 로고
    • System description: Teyjus-A compiler and abstract machine based implementation of Lambda Prolog
    • Ganzinger, H, ed, Trento, Italy, July, Springer, Heidelberg
    • Nadathur, G., Mitchell, D.J.: System description: Teyjus-A compiler and abstract machine based implementation of Lambda Prolog. In: Ganzinger, H. (ed.) Proceedings of the 16th International Conference on Automated Deduction, Trento, Italy, July 1999, pp. 287-291. Springer, Heidelberg (1999)
    • (1999) Proceedings of the 16th International Conference on Automated Deduction , pp. 287-291
    • Nadathur, G.1    Mitchell, D.J.2
  • 13
    • 35448990873 scopus 로고    scopus 로고
    • System description: Twelf- A meta-logical framework for deductive systems
    • Ganzinger, H, ed, 16th Conference on Automated Deduction, Springer, Heidelberg
    • Pfenning, F., Schürmann, C.: System description: Twelf- A meta-logical framework for deductive systems. In: Ganzinger, H. (ed.) 16th Conference on Automated Deduction. LNCS (LNAI), pp. 202-206. Springer, Heidelberg (1999)
    • (1999) LNCS (LNAI , pp. 202-206
    • Pfenning, F.1    Schürmann, C.2
  • 14
    • 0001748856 scopus 로고
    • Intensional interpretations of functional of finite type I
    • Tait, W.W.: Intensional interpretations of functional of finite type I. J. of Symbolic Logic 32(2), 198-212 (1967)
    • (1967) J. of Symbolic Logic , vol.32 , Issue.2 , pp. 198-212
    • Tait, W.W.1
  • 17
    • 26944459618 scopus 로고    scopus 로고
    • Urban, C., Tasson, C.: Nominal techniques in Isabelle/HOL. In: Nieuwenhuis, R. (ed.) CADE 2005. LNCS (LNAI), 3632, pp. 38-53. Springer, Heidelberg (2005)
    • Urban, C., Tasson, C.: Nominal techniques in Isabelle/HOL. In: Nieuwenhuis, R. (ed.) CADE 2005. LNCS (LNAI), vol. 3632, pp. 38-53. Springer, Heidelberg (2005)


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.