Certified Programming with Dependent Types
This is the web site for a textbook about practical engineering with the Coq proof assistant. The focus is on building programs with proofs of correctness, using dependent types and scripted proof automation. I'm following an unusual philosophy in this book, so it may be of interest even to long-time Coq users. At the same time, I hope that it provides an easier introduction for newcomers, since s
è¿·è·¯ã®è©¦é¨“å•é¡Œã‚’解ã„ã¦ã¿ãŸ - ã«ã‚ã¨ã‚Šå°å±‹ã§ã®ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°
å‚考：人æç²å¾—作戦・４ 試験å•é¡Œã»ã‹: 人生を書ãæ›ãˆã‚‹è€…ã™ã‚‰ã„ãŸã€‚ Lv4ã«è©•ä¾¡ã•ã‚Œã‚‹ãŸã‚ã«ã¯ã€æœ€çŸæ€§ã®å®Œå…¨ãªãƒã‚§ãƒƒã‚¯ãŒå¿…è¦ã ã£ãŸã®ã§Coqã§è¨¼æ˜Žã—ã¦ã¿ãŸã€‚ ã¾ãšã€accessiblesã¨ã„ã†é–¢æ•°ã‚’定義ã—ã€ä»¥ä¸‹ã®æ€§è³ªã‚’証明ã—ãŸã€‚ ã“ã“ã§plengthã¯ãƒ‘スã®é•·ã•ã‚’計る関数ã§ã€Path x pã¯pãŒxを起点ã¨ã—ãŸãƒ‘スã§ã‚ã‚‹ã¨ã„ã†è¿°èªžã€‚endofã¯ãƒ‘スã®çµ‚点を求ã‚る関数。 Fixpoint accessibles (start : node) (len : nat) : list path := match len with | O => (PUnit start) :: nil | S n' => div_equiv path_equiv_dec @@ (flat_map expand @@ accessibles start n') end. ã“ã®é–¢æ•°ã¯startã‹ã‚‰å§‹ã¾ã£ã¦lenã®é•·ã•
http://stream.edubase.jp/packages/view/57
See related links to what you are looking for.
Coqã§ä¾å˜åž‹ - ã«ã‚ã¨ã‚Šå°å±‹ã§ã®ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°
最近AgdaãŒã¯ã‚„ã£ã¦ã„ã‚‹ã¿ãŸã„ãªã®ã§ã€Coqã§ã‚‚ä¾å˜åž‹ï¼ˆdependent type）を使ã£ã¦ã¿ãŸã€‚ 実装ã—ãŸã®ã¯é•·ã• n ã®ãƒ™ã‚¯ãƒˆãƒ«åž‹ã 。ã“ã®ãƒ™ã‚¯ãƒˆãƒ«åž‹ã‚’使ã†ã¨ã€ç©ºã§ãªã„ã¨ã‹ã€é•·ã•ãŒç‰ã—ã„ã¨ã‹ã‚’åž‹ã®æ®µéšŽã§ä¿è¨¼ã§ãã‚‹ã®ã§ã€ã‚ˆã‚Šå®‰å…¨ãªãƒ—ãƒã‚°ãƒ©ãƒ を書ãã“ã¨ãŒã§ãã‚‹ã®ã 。 Variable A:Set. Inductive Vec : nat -> Set := | VNil : Vec O | VCons : forall n, A -> Vec n -> Vec (S n). ã“ã®ãƒ™ã‚¯ãƒˆãƒ«åž‹ã‚’使ãˆã°ã€ã‚³ãƒ³ãƒ‘イル時ã«é•·ã•ã®æ•´åˆæ€§ã‚‚ãƒã‚§ãƒƒã‚¯ã—ã¦ãã‚Œã¦ã€é–“é•ã„ãŒã‚ã‚‹å ´æ‰€ã‚’æ•™ãˆã¦ãれる。コンパイルã•ãˆé€šã‚Œã°ã€OutOfBoundsExceptionã®ã‚ˆã†ãªå®Ÿè¡Œæ™‚エラーã¯èµ·ã“ã‚Šãˆãªã„ã“ã¨ãŒä¿è¨¼ã•ã‚Œã‚‹ã€‚ 例ãˆã°ã€ä¸€èˆ¬çš„ã«ãƒªã‚¹ãƒˆã®head関数ã¯ã€å¼•æ•°ãŒ1以上ã®é•·ã•ã®ã¨ãã®ã¿å®šç¾©ã§ãã€ç©ºãƒªã‚¹ãƒˆã®å ´åˆã«ã¯å€¤
1
リリースã€éšœå®³æƒ…å ±ãªã©ã®ã‚µãƒ¼ãƒ“スã®ãŠçŸ¥ã‚‰ã›
最新ã®äººæ°—エントリーã®é…ä¿¡
j次ã®ãƒ–ックマーク
kå‰ã®ãƒ–ックマーク
lã‚ã¨ã§èªã‚€
eコメント一覧を開ã
oページを開ã
Amazon.co.jp: Interactive Theorem Proving and Program Development: Coq’Art: The Calculus of Inductive Constructions (Texts in Theoretical Computer Science. An EATCS Series): Bertot, Yves (è‘—), Castéran, Pierre (è‘—), Huet, G. (ã¯ã—ãŒã), Paulin-Mohring, C. (ã¯ã—ãŒã
ソフトウェアã®åŸºç¤Ž
{{#tags}}- {{label}}
{{/tags}}