è¿·è·¯ã®è©¦é¨“å•é¡Œã‚’解ã„ã¦ã¿ãŸ - ã«ã‚ã¨ã‚Šå°å±‹ã§ã®ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°å‚考：人æç²å¾—作戦・４ 試験å•é¡Œã»ã‹: 人生を書ãæ›ãˆã‚‹è€…ã™ã‚‰ã„ãŸã€‚ 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ã®é•·ã•
PKUサãƒãƒ¼ãƒˆã‚¹ã‚¯ãƒªãƒ—ト - nodchipã®æ—¥è¨˜
Twitter / @brnw/baisu-25
{{#tags}}- {{label}}
{{/tags}}