カリー＝ハワード同型対応

出典: フリー百科事典『ウィキペディア（Wikipedia）』
移動: 案内、 検索
関数型プログラムとして書かれた証明：自然数の加法に関する交換律のCoqによる証明。

プログラミング言語理論と証明論において、カリー＝ハワード同型対応（カリー＝ハワードどうけいたいおう、「プログラム＝証明」(proofs-as-programs)・「型＝命題」(formulae-as-types)などとしても知られる）とは、計算機プログラムと証明との間の直接的な対応関係のことである。これは形式論理の体系とある種の計算の体系との構文論的なアナロジーを一般化した概念であり、アメリカの数学者ハスケル・カリーと論理学者ウィリアム・アルヴィン・ハワード（英語版）により最初に発見された。


目次

[編集] 脚注

Text document with red question mark.svg
 この記事には参照一覧や外部リンクが含まれていますが、参考文献の列挙に留まり情報量が不十分であるために出典が依然不明確です。適切な参照場所を正確に示すことでこの記事を改良するためにご協力をお願いします。（2010年4月）

[編集] 歴史的文献

  • Curry, Haskell (1934), “Functionality in Combinatory Logic”, Proceedings of the National Academy of Sciences, 20, pp. 584–590 .
  • Curry, Haskell B.; Feys, Robert (1958), Craig, William, ed., Combinatory Logic Vol. I, Amsterdam: North-Holland , with 2 sections by William Craig, see paragraph 9E.
  • De Bruijn, Nicolaas (1968), Automath, a language for mathematics, Department of Mathematics, Eindhoven University of Technology, TH-report 68-WSK-05. Reprinted in revised form, with two pages commentary, in: Automation and Reasoning, vol 2, Classical papers on computational logic 1967–1970, Springer Verlag, 1983, pp. 159–200.
  • Howard, William A. (1980-09) [original paper manuscript from 1969], “The formulae-as-types notion of construction”, in Seldin, Jonathan P.; Hindley, J. Roger, To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, Boston, MA: Academic Press, pp. 479–490, ISBN 978-0-12-349050-6 .

[編集] 同型対応の拡張

  • Pfenning, Frank; Davies, Rowan (2001), “A Judgmental Reconstruction of Modal Logic”, Mathematical Structures in Computer Science 11: 511–540, doi:10.1017/S0960129501003322, http://www.cs.cmu.edu/~fp/papers/mscs00.pdf 
  • Griffin, Timothy G. (1990), “The Formulae-as-Types Notion of Control”, Conf. Record 17th Annual ACM Symp. on Principles of Programming Languages, POPL '90, San Francisco, CA, USA, 17–19 Jan 1990, pp. 47–57 .
  • Parigot, Michel (1992), “Lambda-mu-calculus: An algorithmic interpretation of classical natural deduction”, Logic Programming and Automated Reasoning: International Conference LPAR '92 Proceedings, St. Petersburg, Russia, Lecture Notes in Computer Science, 624, Berlin; New York: Springer-Verlag, pp. 190–201, ISBN 978-3-540-55727-2 .
  • Herbelin, Hugo (1995), “A Lambda-Calculus Structure Isomorphic to Gentzen-Style Sequent Calculus Structure”, in Pacholski, Leszek; Tiuryn, Jerzy, Computer Science Logic, 8th International Workshop, CSL '94, Kazimierz, Poland, September 25–30, 1994, Selected Papers, Lecture Notes in Computer Science, 933, Berlin; New York: Springer-Verlag, pp. 61–75, ISBN 978-3-540-60017-6 .
  • Gabbay, Dov; de Queiroz, Ruy (1992), “Extending the Curry–Howard interpretation to linear, relevant and other resource logics”, Journal of Symbolic Logic, 57, pp. 1319–1365 . (Full version of the paper presented at Logic Colloquium '90, Helsinki. Abstract in JSL 56(3):1139–1140, 1991.)
  • de Queiroz, Ruy; Gabbay, Dov (1994), “Equality in Labelled Deductive Systems and the Functional Interpretation of Propositional Equality”, in Dekker, Paul; Stokhof, Martin, Proceedings of the Ninth Amsterdam Colloquium, ILLC/Department of Philosophy, University of Amsterdam, pp. 547–565, ISBN 90-74795-07-2 .
  • de Queiroz, Ruy; Gabbay, Dov (1995), “The Functional Interpretation of the Existential Quantifier”, Bulletin of the Interest Group in Pure and Applied Logics, 3(2–3), pp. 243–290 . (Full version of a paper presented at Logic Colloquium '91, Uppsala. Abstract in JSL 58(2):753–754, 1993.)
  • de Queiroz, Ruy; Gabbay, Dov (1997), “The Functional Interpretation of Modal Necessity”, in de Rijke, Maarten, Advances in Intensional Logic, Applied Logic Series, 7, Springer-Verlag, pp. 61–91, ISBN 978-0-7923-4711-8 .
  • de Queiroz, Ruy; Gabbay, Dov (1999), “Labelled Natural Deduction”, in Ohlbach, Hans-Juergen; Reyle, Uwe, Logic, Language and Reasoning. Essays in Honor of Dov Gabbay, Trends in Logic, 7, Kluwer Acad. Pub., pp. 173–250, ISBN 978-0-7923-5687-5, http://www.springer.com/philosophy/logic/book/978-0-7923-5687-5 .
  • de Oliveira, Anjolina; de Queiroz, Ruy (1999), “A Normalization Procedure for the Equational Fragment of Labelled Natural Deduction”, Logic Journal of the Interest Group in Pure and Applied Logics, 7, Oxford Univ Press, pp. 173–215 . (Full version of a paper presented at 2nd WoLLIC'95, Recife. Abstract in Journal of the Interest Group in Pure and Applied Logics 4(2):330–332, 1996.)
  • Poernomo, Iman; Crossley, John; Wirsing; Martin (2005) [2005], Adapting Proofs-as-Programs: The Curry–Howard Protocol, Monographs in Computer Science, Springer, ISBN 978-0-387-23759-6 , concerns the adaptation of proofs-as-programs program synthesis to coarse-grain and imperative program development problems, via a method the authors call the Curry–Howard protocol. Includes a discussion of the Curry–Howard correspondence from a Computer Science perspective.
  • de Queiroz, Ruy J.G.B.; de Oliveira, Anjolina (2011), “The Functional Interpretation of Direct Computations”, Electronic Notes in Theoretical Computer Science, 269, Elsevier, pp. 19–40, doi:10.1016/j.entcs.2011.03.003 . (Full version of a paper presented at LSFA 2010, Natal, Brazil.)

[編集] 哲学的解釈

[編集] 総合的論文

[編集] 書籍

  • edited by Ph. de Groote. (1995), De Groote, Philippe, ed., The Curry–Howard Isomorphism, Cahiers du Centre de Logique (Université catholique de Louvain), 8, Academia-Bruylant, ISBN 978-2-87209-363-2 , reproduces the seminal papers of Curry-Feys and Howard, a paper by de Bruijn and a few other papers.
  • Sørensen, Morten Heine; Urzyczyn, Paweł (2006) [1998], Lectures on the Curry–Howard isomorphism, Studies in Logic and the Foundations of Mathematics, 149, Elsevier Science, ISBN 978-0-444-52077-7, http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.17.7385 , notes on proof theory and type theory, that includes a presentation of the Curry–Howard correspondence, with a focus on the formulae-as-types correspondence
  • Girard, Jean-Yves (1987–90). Proof and Types. Translated by and with appendices by Lafont, Yves and Taylor, Paul. Cambridge University Press (Cambridge Tracts in Theoretical Computer Science, 7), ISBN 0-521-37181-3, notes on proof theory with a presentation of the Curry–Howard correspondence.
  • Thompson, Simon (1991). Type Theory and Functional Programming Addison–Wesley. ISBN 0-201-41667-0.
  • Poernomo, Iman; Crossley, John; Wirsing; Martin (2005) [2005], Adapting Proofs-as-Programs: The Curry–Howard Protocol, Monographs in Computer Science, Springer, ISBN 978-0-387-23759-6 , concerns the adaptation of proofs-as-programs program synthesis to coarse-grain and imperative program development problems, via a method the authors call the Curry–Howard protocol. Includes a discussion of the Curry–Howard correspondence from a Computer Science perspective.
  • F. Binard and A. Felty, "Genetic programming with polymorphic types and higher-order functions." In Proceedings of the 10th annual conference on Genetic and evolutionary computation, pages 1187 1194, 2008.[1]
  • de Queiroz, Ruy J.G.B.; de Oliveira, Anjolina G.; Gabbay, Dov M. (2011) [2011], The Functional Interpretation of Logical Deduction, Advances in Logic, 5, Imperial College Press / World Scientific, ISBN 978-981-4360-95-1 .

[編集] 参考文献

  • P.T. Johnstone, 2002, Sketches of an Elephant, section D4.2 (vol 2) gives a categorical view of "what happens" in the Curry–Howard correspondence.

[編集] 外部リンク

ウィキブックスにThe Curry–Howard isomorphism関連の解説書・教科書があります。
「http://ja.wikipedia.org/w/index.php?title=カリー＝ハワード同型対応&oldid=47614878」から取得