Domain Modeling with Functions - an algebraic approach
The document discusses domain modeling using an algebraic approach with functions. It explains that a domain model describes entities, attributes, roles, relationships and constraints in a problem domain. It advocates modeling the domain as an algebra of types and functions, with types representing entities and functions representing behaviors. This approach uses algebraic data types to define imm
関数ã®è©± - ( ꒪⌓꒪) ゆるよã‚日記
ã“ã‚“ã«ã¡ã¯ã€ã—ã„ãŸã‘ã§ã™ã€‚ æŸæ‰€ã§é–¢æ•°åž‹ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã¨ã¯ãƒªã‚¹ãƒˆå‡¦ç†ã®ã“ã¨ãªã®ã‹ã€ã¨ç‡ƒãˆã¦ã„ã‚‹ã®ã‚’見ã¦ã€é–¢æ•°åž‹ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã¨ã¯ä½•ã‹ã€ã¨ã„ã†ã“ã¨ã‚’自分ãªã‚Šã®è€ƒãˆã‚’è¿°ã¹ãŸã„ã¨æ€ã„ã¾ã—ãŸã€‚春ãªã®ã§ã€‚ ã“ã®è³‡æ–™ã¯2å¹´ã»ã©å‰ã«Supershipã®ç¤¾å†…勉強会ã§ä½¿ã£ãŸã‚‚ã®ã§ã™ãŒã€ã“ã®ä¸ã§é–¢æ•°ã¨ã‚ªãƒ–ジェクトを対比ã—ã¦ã„る箇所ãŒã‚ã‚Šã¾ã™ã€‚ 関数もオブジェクトもã€å¤‰æ•°ã‚„関数ã®å¼•æ•°æˆ»ã‚Šå€¤ã¨ã—ã¦æ‰±ãˆã‚‹ç¬¬1ç´šã®å€¤ã§ã‚ã‚Šã€çŠ¶æ…‹ã‚’æŒã¡(メンãƒãƒ¼å¤‰æ•°/クãƒãƒ¼ã‚¸ãƒ£)ã€çµ„ã¿åˆã‚ã›ãŒå¯èƒ½(delegate, composition/関数åˆæˆ)ã€ã§ã‚ã‚‹ã€ã¨ã€‚ ã§ã¯ã‚ªãƒ–ジェクト指å‘ã¨é–¢æ•°åž‹ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã§ä½•ãŒæ±ºå®šçš„ã«ç•°ãªã‚‹ã‹ã¨ã„ã†ã¨ã€è¨è¨ˆãƒ»å®Ÿè£…ã®ã‚¢ãƒ—ãƒãƒ¼ãƒã«ä½•ã‚’ä¸å¿ƒã«æ®ãˆã‚‹ã‹ã€ã¨ã„ã†ã“ã¨ã ã¨æ€ã„ã¾ã™ã€‚ オブジェクト指å‘ã§ã¯ã€ã‚¯ãƒ©ã‚¹ãƒ»ã‚ªãƒ–ジェクトをモデリングã—ã€å„種ã®ã‚ªãƒ–ジェクト指å‘的デザインパターンを用ã„ã¦ã‚ªãƒ–ジェクトåŒå£«ã‚’組ã¿
Tangible Functional Programming
Tangible Functional Programming ICFP '07 Conal Elliott Abstract We present a user-friendly approach to unifying program creation and execution, based on a notion of “tangible values†(TVs), which are visual and interactive manifestations of pure values, including functions. Programming happens by gestural composition of TVs. Our goal is to give end-users the ability to create parameterized, compos
Functional go
2. Functional Go Functional Programming by Wikipidia: “Functional programming is a programming paradigm that treats computation as the evaluation of mathematical functions and avoids state and mutable data". In other words, functional programming promotes code with no side effects, no change of value in variables. It oposes to imperative programming, which enfatizes change of stateâ€. 3. What this
ãªãœé–¢æ•°ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã¯é‡è¦ã‹
John Hughes, Institutionen för Datavetenskap, Chalmers Tekniska Högskola, 41296 Göteborg, SWEDEN. [email protected] ã“ã®æ—¥æœ¬èªžè¨³ã¯åŽŸè‘—者ã®æ‰¿è«¾ã‚’å¾—ã¦å±±ä¸‹ãŒã“ã“ã«å…¬é–‹ã™ã‚‹ã‚‚ã®ã§ã™ã€‚ ã“ã®è¨³æ–‡ã«ã¤ã„ã¦ã®ã€å¾¡æŒ‡æ‘˜ãªã©ã¯å±±ä¸‹ä¼¸å¤«(nobsun .at. sampou.org)ã¾ã§ãŠããŒã„ ã„ãŸã—ã¾ã™ã€‚ 翻訳最終更新日 : 2011-09-17 原文 "Why Functional Programming Matters" 日本語訳PostScript ã“ã®è«–æ–‡ã¯1984年以æ¥ä½•å¹´ã‚‚ã®ã‚ã„ã Chalmers大å¦ã®ãƒ¡ãƒ¢ã¨ã—ã¦å›žè¦§ã•ã‚ŒãŸã€‚ 1989å¹´ã¨1990å¹´ã«å¹¾åˆ†ã‹æ”¹è¨‚ã‚’ã—ãŸã®ãŒ[Hug89]㨠[Hug90]ã§ã‚る。ã“ã®ç‰ˆã¯ã‚‚ã¨ã®Chalmer大å¦ã®ãƒ¡ãƒ¢ ã®nroff原稿をもã¨ã«
Q. （関数型）リアクティブプãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã¨ã¯ä½•ã§ã™ã‹ï¼Ÿ | POSTD
Wikipedia㧠リアクティブプãƒã‚°ãƒ©ãƒŸãƒ³ã‚° (reactive programming)を調ã¹ã¦ã¿ã¾ã—ãŸã€‚ã¾ãŸã€ 関数型リアクティブプãƒã‚°ãƒ©ãƒŸãƒ³ã‚° (functional reactive programming, FRP)ã«ã¤ã„ã¦ã‚‚å°‘ã—説明ãŒã‚ã£ãŸã®ã§ç¢ºèªã—ã¦ã¿ã¾ã—ãŸãŒã€ã©ã¡ã‚‰ã‚‚説明ãŒå¤§é›‘把ã§ã™ã€‚ 実際ã®ã¨ã“ã‚関数型リアクティブプãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã¨ã¯ã©ã†ã„ã†æ„味ãªã®ã§ã—ょã†ã‹ï¼Ÿãƒªã‚¢ã‚¯ãƒ†ã‚£ãƒ–プãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã¯ï¼ˆéžãƒªã‚¢ã‚¯ãƒ†ã‚£ãƒ–プãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã¨æ¯”ã¹ã¦ï¼‰ä½•ã§æ§‹æˆã•ã‚Œã¦ã„ã‚‹ã®ã§ã™ã‹ï¼Ÿç§ã¯å‘½ä»¤åž‹ã®ã‚ªãƒ–ジェクト指å‘言語を使ã£ã¦ã„ã‚‹ã®ã§ã€ãã®ãƒ‘ラダイムã«é–¢é€£ã•ã›ã¦èª¬æ˜Žã—ã¦é ‚ã‘ã‚‹ã¨å¤§å¤‰æœ‰é›£ã„ã§ã™ã€‚ asked by JtR Answer(s) FRPã®æ„Ÿè§¦ã‚’ã¾ãšè©¦ã—ã¦ã¿ãŸã„ã®ã§ã‚ã‚Œã°ã€ 1998å¹´ã«ç™ºè¡¨ã•ã‚ŒãŸå¤å…¸ã®Fran tutorialã«ç›®ã‚’通ã—ã¦ã¿ã‚‹ã¨è‰¯ã„ã§ã—ょã†ã€‚ ã“ã‚Œã¯å‹•ç”»ã§èª¬æ˜Žã•ã‚Œã¦ã„ã¾ã™ã€‚
Catamorphisms - HaskellWiki
Folding data structures[edit] An overview and derivation of the category-theoretic notion of a catamorphism as a recursion scheme, and an exploration of common variations on the theme. Description[edit] Catamorphisms are generalizations of the concept of a fold in functional programming. A catamorphism deconstructs a data structure with an F-algebra for its underlying functor. History[edit] The na
ApplicativeDo æ‹¡å¼µã«ã¤ã„㦠- Qiita
ICFP2016 ã®ä½µè¨ãƒ¯ãƒ¼ã‚¯ã‚·ãƒ§ãƒƒãƒ— Haskell 2016 ã§ã® ApplicativeDo ã®ãƒˆãƒ¼ã‚¯ Simon Marlow, et. al. ``Desugaring Haskell's do-Notation into Applicative Operations'' ãŒãŠã‚‚ã—ã‚ã‹ã£ãŸã®ã§ã€ã–ã£ãり紹介ã—ã¦ã¿ãŸã„ã¨æ€ã„ã¾ã™ã€‚ Applicative 㨠Monad 㨠do 記法 Monad 㯠do 記法ãŒç”¨æ„ã•ã‚Œã¦ã„ã¦ç°¡å˜ã«æ›¸ã‘ã‚‹ã®ã§è‰¯ã使ã‚れる一方ã§ã€Applicative ã«ã¯å°‚用ã®è¨˜æ³•ãŒãªã„ãŸã‚ã€Applicative ã§å分ãªå ´åˆã§ã‚‚プãƒã‚°ãƒ©ãƒžã¯ do 記法ã«ã‚ˆã‚‹ Monad を使ã†ã“ã¨ãŒå¤šã„よã†ã§ã™ã€‚ Applicative ã§ã¯é€æ¬¡å®Ÿè¡Œã®èƒ½åŠ›ã—ã‹ãªã„ãŸã‚ã€ãã‚Šè¿”ã—ã‚„æ¡ä»¶åˆ†å²ãŒã§ããªã„一方ã§ã€(<*>) ã®ä¸¡è¾ºã¯ç›´æŽ¥ä¾å˜é–¢ä¿‚ãŒç„¡ã„ãŸã‚ã€Monad ã®å ´åˆã¨æ¯”ã¹ã¦
Thunk - HaskellWiki
A thunk is a value that is yet to be evaluated. It is used in Haskell systems that implement non-strict semantics by lazy evaluation. A lazy run-time system does not evaluate a thunk unless it has to. Expressions are translated into a graph (not a tree, as you might have expected, this enables sharing, and infinite lists!) and a Spineless Tagless G-machine (STG, G-machine is short for graph reduct
What does composability mean in context of functional programming?
Marcelo Cantos gave a pretty good explanation, but I think it can be made slightly more precise. A type of thing is composable when several instances can be combined in a certain way to produce the same type of thing. Control structure composability. Languages like C make a distinction between expressions, which can be composed using operators to produce new expressions, and statements, which can
「関数型プãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã£ã¦ä½•ï¼Ÿã€æ—¥æœ¬èªžè¨³ - Okapies' Archive
ã“ã®è¨˜äº‹ã¯ã€æŠ€è¡“翻訳 Advent Calendar 2016 ã®15日目ã§ã™ï¼ˆæž ãŒç©ºã„ã¦ãŸã®ã§å‹æ‰‹ã«ãŠé‚ªé”ã—ã¦ã¾ã™ï¼‰ã€‚å‰å›žï¼ˆ6日目）ã¯ã€id:msyksphinz ã•ã‚“ã®ã€Œå€‹äººãŒè¶£å‘³ã§æŠ€è¡“書を翻訳ã™ã‚‹ã¨ã„ã†æ„義ã«ã¤ã„ã¦ã€ã§ã—ãŸã€‚ 今回ã”紹介ã™ã‚‹ã®ã¯ã€æ˜¨å¹´æœ«ã«å…¬é–‹ã•ã‚ŒãŸ Kris Jenkins ã•ã‚“ (@krisajenkins) ã® "What Is Functional Programming?" ã§ã™ã€‚日本語訳ã®å…¬é–‹ã«ã¤ã„ã¦ã¯è‘—者ã‹ã‚‰æ‰¿è«¾æ¸ˆã¿ã§ã™ã€‚ã¾ãŸã€London Functional Programmers meetup ã§ã®åŒã‚¿ã‚¤ãƒˆãƒ«ã®è¬›æ¼”å‹•ç”»ãŒå…¬é–‹ã•ã‚Œã¦ã„ã¾ã™ã€‚ 関数型プãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã®è€ƒãˆæ–¹ã¯ã€ä¸–é–“ã§ã¯ã©ã†ã‚‚å°é›£ã—ã„話ã ã¨æ€ã‚ã‚Œã¦ã„る節ãŒã‚ã‚Šã¾ã™ã€‚ãã®ç†ç”±ã®ä¸€ã¤ã«ã€è°è«–ã®æŠ½è±¡åº¦ãŒï¼ˆæ¯”較的）高ã„ã“ã¨ãŒæŒ™ã’られるã§ã—ょã†ã€‚例ãˆã°ã€ä»¥å‰ã“ã®ãƒ–ãƒã‚°ã§ç´¹ä»‹ã—ãŸã€Œãªãœé–¢æ•°ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°
anopara
終了ã®ãŠã—ら㛠ブãƒã‚° anopara 㯠2022å¹´12月29æ—¥ ã”ã‚ã«é–‰éŽ–ã—ã¾ã—ãŸã€‚ 先生ã®æ¬¡å›žä½œã«ã”期待ãã ã•ã„。 次ã®ãƒ–ãƒã‚°ã¯å¤šåˆ†åŒã˜URLã§å†é–‹ã—ã¾ã™ã€‚ 詳ã—ã„ã“ã¨ãŒæ±ºã¾ã£ãŸã‚‰ã“ã¡ã‚‰ã«æ›¸ãã¾ã™ → https://twitter.com/anoparanominal 創作関連ã®æ´»å‹•ã¯ã“ã¡ã‚‰ → https://y9ks.jp çµµã¨ã‹ → https://twitter.com/yuri9000series
1
リリースã€éšœå®³æƒ…å ±ãªã©ã®ã‚µãƒ¼ãƒ“スã®ãŠçŸ¥ã‚‰ã›
最新ã®äººæ°—エントリーã®é…ä¿¡
j次ã®ãƒ–ックマーク
kå‰ã®ãƒ–ックマーク
lã‚ã¨ã§èªã‚€
eコメント一覧を開ã
oページを開ã
{{#tags}}- {{label}}
{{/tags}}