메뉴 건너뛰기




Volumn 7213 LNCS, Issue , 2012, Pages 104-118

Combining interactive and automatic reasoning in first order theories of functional programs

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATIC REASONING; COINDUCTION; COMPUTER-ASSISTED VERIFICATION; DEPENDENT TYPE THEORY; FIRST ORDER; FIRST ORDER LOGIC; FIRST ORDER THEORIES; FUNCTIONAL PROGRAMS; INTERACTIVE REASONING; PROOF ASSISTANT; THEOREM PROVERS;

EID: 84859133078     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-28729-9_7     Document Type: Conference Paper
Times cited : (6)

References (30)
  • 1
    • 33646183688 scopus 로고    scopus 로고
    • Connecting a logical framework to a first-order logic prover
    • Gramlich, B. (ed.) LNCS (LNAI) Springer, Heidelberg
    • Abel, A., Coquand, T., Norell, U.: Connecting a Logical Framework to a First-Order Logic Prover. In: Gramlich, B. (ed.) FroCos 2005. LNCS (LNAI), vol. 3717, pp. 285-301. Springer, Heidelberg (2005)
    • (2005) FroCos 2005 , vol.3717 , pp. 285-301
    • Abel, A.1    Coquand, T.2    Norell, U.3
  • 2
    • 77956968984 scopus 로고
    • An introduction to inductive definitions
    • Barwise, J. (ed.) North-Holland Publishing Company
    • Aczel, P.: An introduction to inductive definitions. In: Barwise, J. (ed.) Handbook of Mathematical Logic, pp. 739-782. North-Holland Publishing Company (1977)
    • (1977) Handbook of Mathematical Logic , pp. 739-782
    • Aczel, P.1
  • 3
    • 0010071182 scopus 로고
    • The strength of martin-löf's intuitionistic type theory with one universe
    • Miettinen, S., Väananen, J. (eds.) Report No. 2, Department of Philosopy University of Helsinki, Helsinki
    • Aczel, P.: The strength of Martin-Löf's intuitionistic type theory with one universe. In: Miettinen, S., Väananen, J. (eds.) Proc. of the Symposium on Mathematical Logic (Oulu, 1974). Report No. 2, Department of Philosopy, pp. 1-32. University of Helsinki, Helsinki (1977)
    • (1977) Proc. of the Symposium on Mathematical Logic (Oulu, 1974) , pp. 1-32
    • Aczel, P.1
  • 4
    • 77956968047 scopus 로고
    • Frege structures and the notions of proposition, truth and set
    • Barwise, J., et al. (eds.) North-Holland, Amsterdan
    • Aczel, P.: Frege structures and the notions of proposition, truth and set. In: Barwise, J., et al. (eds.) The Kleene Symposium, pp. 31-59. North-Holland, Amsterdan (1980)
    • (1980) The Kleene Symposium , pp. 31-59
    • Aczel, P.1
  • 5
    • 0004017527 scopus 로고    scopus 로고
    • Proof theory at work: Program development in the minlog system
    • Bibel, W., et al. (eds.) Kluwer Academic Publishers
    • Benl, H., et al.: Proof theory at work: Program development in the Minlog system. In: Bibel, W., et al. (eds.) Automated Deduction, vol. II, pp. 41-71. Kluwer Academic Publishers (1998)
    • (1998) Automated Deduction , vol.2 , pp. 41-71
    • Benl, H.1
  • 6
    • 33646127648 scopus 로고    scopus 로고
    • Modelling general recursion in type theory
    • Bove, A., Capretta, V.: Modelling general recursion in type theory. Math. Struct. in Comp. Science 15, 671-708 (2005)
    • (2005) Math. Struct. in Comp. Science , vol.15 , pp. 671-708
    • Bove, A.1    Capretta, V.2
  • 7
    • 70149123071 scopus 로고    scopus 로고
    • Embedding a logical theory of constructions in agda
    • Bove, A., Dybjer, P., Sicard-Ramírez, A.: Embedding a Logical Theory of Constructions in Agda. In: PLPV 2009, pp. 59-66 (2009)
    • (2009) PLPV 2009 , pp. 59-66
    • Bove, A.1    Dybjer, P.2    Sicard-Ramírez, A.3
  • 9
    • 84858910623 scopus 로고
    • Program verification in a logical theory of constructions
    • Jouannaud, J.-P. (ed.) LNCS Springer, Heidelberg
    • Dybjer, P.: Program Verification in a Logical Theory of Constructions. In: Jouannaud, J.-P. (ed.) FPCA 1985. LNCS, vol. 201, pp. 334-349. Springer, Heidelberg (1985)
    • (1985) FPCA 1985 , vol.201 , pp. 334-349
    • Dybjer, P.1
  • 10
    • 0025447939 scopus 로고
    • Comparing integrated and external logics of functional programs
    • Dybjer, P.: Comparing integrated and external logics of functional programs. Science of Computer Programming 14, 59-79 (1990)
    • (1990) Science of Computer Programming , vol.14 , pp. 59-79
    • Dybjer, P.1
  • 11
    • 3743098189 scopus 로고
    • A functional programming approach to the specification and verification of concurrent systems
    • Dybjer, P., Sander, H.P.: A functional programming approach to the specification and verification of concurrent systems. Formal Aspects of Computing 1, 303-319 (1989)
    • (1989) Formal Aspects of Computing , vol.1 , pp. 303-319
    • Dybjer, P.1    Sander, H.P.2
  • 12
    • 3142714996 scopus 로고
    • Ph.D. thesis. University of Edinburgh, Department of Computer Science
    • Gardner, P.: Representing Logics in Type Theory. Ph.D. thesis. University of Edinburgh, Department of Computer Science (1992)
    • (1992) Representing Logics in Type Theory
    • Gardner, P.1
  • 14
    • 0027353175 scopus 로고
    • A framework for defining logics
    • Harper, R., Honsell, F., Plotkin, G.: A framework for defining logics. JACM 40(1), 143-184 (1993)
    • (1993) JACM , vol.40 , Issue.1 , pp. 143-184
    • Harper, R.1    Honsell, F.2    Plotkin, G.3
  • 16
    • 77951878812 scopus 로고    scopus 로고
    • Partial and nested recursive function definitions in higher-order logic
    • Krauss, A.: Partial and nested recursive function definitions in higher-order logic. Journal of Automated Reasoning 44(4), 303-336 (2010)
    • (2010) Journal of Automated Reasoning , vol.44 , Issue.4 , pp. 303-336
    • Krauss, A.1
  • 17
    • 33745153057 scopus 로고    scopus 로고
    • A tool for automated theorem proving in agda
    • Filliâtre, J.-C., Paulin-Mohring, C., Werner, B. (eds.) LNCS Springer, Heidelberg
    • Lindblad, F., Benke, M.: A Tool for Automated Theorem Proving in Agda. In: Filliâtre, J.-C., Paulin-Mohring, C., Werner, B. (eds.) TYPES 2004. LNCS, vol. 3839, pp. 154-169. Springer, Heidelberg (2006)
    • (2006) TYPES 2004 , vol.3839 , pp. 154-169
    • Lindblad, F.1    Benke, M.2
  • 18
    • 77956973308 scopus 로고
    • Hauptsatz for the intuitionistic theory of iterated inductive definitions
    • Fenstad, J.E. (ed.) North-Holland Publishing Company
    • Martin-Löf, P.: Hauptsatz for the intuitionistic theory of iterated inductive definitions. In: Fenstad, J.E. (ed.) Proceedings of the Second Scandinavian Logic Symposium, pp. 179-216. North-Holland Publishing Company (1971)
    • (1971) Proceedings of the Second Scandinavian Logic Symposium , pp. 179-216
    • Martin-Löf, P.1
  • 19
    • 84855199211 scopus 로고    scopus 로고
    • Automation for interactive proof: First prototype
    • Meng, J., Quigley, C., Paulson, L.C.: Automation for interactive proof: First prototype. Information and Computation 204(10), 1575-1596 (2006)
    • (2006) Information and Computation , vol.204 , Issue.10 , pp. 1575-1596
    • Meng, J.1    Quigley, C.2    Paulson, L.C.3
  • 20
    • 84949446497 scopus 로고    scopus 로고
    • Theorem proving for functional programmers. Sparkle: A functional theorem prover
    • Arts, T., Mohnen, M. (eds.) LNCS Springer, Heidelberg
    • de Mol, M., van Eekelen, M., Plasmeijer, R.: Theorem Proving for Functional Programmers. Sparkle: A Functional Theorem Prover. In: Arts, T., Mohnen, M. (eds.) IFL 2001. LNCS, vol. 2312, pp. 55-71. Springer, Heidelberg (2002)
    • (2002) IFL 2001 , vol.2312 , pp. 55-71
    • De Mol, M.1    Van Eekelen, M.2    Plasmeijer, R.3
  • 21
  • 22
    • 84859131226 scopus 로고
    • Isabelle
    • LNCS Springer, Heidelberg (With a contribution by T. Nipkow)
    • Paulson, L.C.: Isabelle. A Generic Theorem Prover. LNCS, vol. 828. Springer, Heidelberg (1994) (With a contribution by T. Nipkow)
    • (1994) A Generic Theorem Prover , vol.828
    • Paulson, L.C.1
  • 24
    • 0000230630 scopus 로고    scopus 로고
    • LCF considered as a programming language
    • Plotkin, G.: LCF considered as a programming language. Theoretical Computer Science 5(3), 223-255 (1997)
    • (1997) Theoretical Computer Science , vol.5 , Issue.3 , pp. 223-255
    • Plotkin, G.1
  • 25
    • 0348170591 scopus 로고
    • An interpretation of martin-löf's type theory in a type-free theory of propositions
    • Smith, J.: An interpretation of Martin-Löf's type theory in a type-free theory of propositions. The Journal of Symbolic Logic 49(3), 730-753 (1984)
    • (1984) The Journal of Symbolic Logic , vol.49 , Issue.3 , pp. 730-753
    • Smith, J.1
  • 26
    • 70849115250 scopus 로고    scopus 로고
    • The TPTP problem library and associated infrastructure. The FOT and CNF parts, v.3.5.0
    • Sutcliffe, G.: The TPTP problem library and associated infrastructure. The FOT and CNF parts, v.3.5.0. Journal of Automated Reasoning 43(4), 337-362 (2009)
    • (2009) Journal of Automated Reasoning , vol.43 , Issue.4 , pp. 337-362
    • Sutcliffe, G.1
  • 27
    • 84885636838 scopus 로고    scopus 로고
    • Optimized encodings of fragments of type theory in first order logic
    • Berardi, S., Coppo, M. (eds.) LNCS Springer, Heidelberg
    • Tammet, T., Smith, J.M.: Optimized Encodings of Fragments of Type Theory in First Order Logic. In: Berardi, S., Coppo, M. (eds.) TYPES 1995. LNCS, vol. 1158, pp. 265-287. Springer, Heidelberg (1996)
    • (1996) TYPES 1995 , vol.1158 , pp. 265-287
    • Tammet, T.1    Smith, J.M.2
  • 30
    • 84976819957 scopus 로고
    • An overview of Miranda
    • Turner, D.: An overview of Miranda. SIGPLAN Notices 21, 158-166 (1986)
    • (1986) SIGPLAN Notices , vol.21 , pp. 158-166
    • Turner, D.1


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