[B! lambda] nsyeeã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯

nsyee id:nsyee

lambdaã«é–¢ã™ã‚‹nsyeeã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ (38)

${{author_name}}$

{{{comment_expanded}}}

{{label}}

{{#is_bookmark}}ãƒªã‚¹ãƒˆ{{/is_bookmark}}{{^is_bookmark}}ãƒªãƒ³ã‚¯{{/is_bookmark}}

${{author_name}}$
{{author_name}}{{created}}
{{ #comment }}{{ comment }}{{ /comment }}
- {{ label }}

${{author_name}}$

{{{comment_expanded}}}

{{label}}

{{#is_bookmark}}ãƒªã‚¹ãƒˆ{{/is_bookmark}}{{^is_bookmark}}ãƒªãƒ³ã‚¯{{/is_bookmark}}

Androidã§ãƒ©ãƒ ãƒ€å¼ã‚’ä½¿ã„ãŸã„ - Qiita
Java 8ãŒæ£å¼ãƒªãƒªãƒ¼ã‚¹ã•ã‚Œæ—©2ã‹æœˆã€‚ ã‚„ã£ã¨Javaã§ãƒ©ãƒ ãƒ€å¼ãŒæ£å¼ã«ä½¿ãˆã‚‹ã‚ˆã†ã«ãªã£ã¦å¬‰ã—ã„é™ã‚Šã€‚ ã¨ã¯ã„ãˆã€Androidã¯API 19ã§Java 7ãŒã‚„ã£ã¨ã‚µãƒãƒ¼ãƒˆã•ã‚ŒãŸã°ã‹ã‚Šã€‚ ã§ã‚‚è«¦ã‚ã‚‹ã®ã¯æ—©ã„ã€‚RetrolambdaãŒã‚ã‚‹ï¼ Retrolabmdaã¨ã¯ ãƒ©ãƒ ãƒ€å¼ã‚’Java 7, 6, 5ã§ä½¿ãˆã‚‹ã‚ˆã†ã«ã—ãŸãƒãƒƒã‚¯ãƒãƒ¼ãƒˆãƒ„ãƒ¼ãƒ« Java 8ã§ã‚³ãƒ³ãƒ‘ã‚¤ãƒ«ã•ã‚ŒãŸãƒã‚¤ãƒˆã‚³ãƒ¼ãƒ‰ã‚’Java 7ä»¥ä¸‹ã®ç’°å¢ƒã§å‹•ä½œã™ã‚‹ã‚ˆã†ã«å¤‰æ› ãƒãƒƒã‚¯ãƒãƒ¼ãƒˆã™ã‚‹ã®ã¯ãƒ©ãƒ ãƒ€å¼ã ã‘ã€‚ã»ã‹ã®Java 8ã®æ©Ÿèƒ½ã¯ãªã—ã€‚ gradle-retrolambdaã¨ã„ã†gradleã®ãƒ—ãƒ©ã‚°ã‚¤ãƒ³ãŒã‚ã‚‹ã€‚ Retrolambdaã‚’ä½¿ã†ãŸã‚ã®è¨å®š JDK 8ã‚’ã‚¤ãƒ³ã‚¹ãƒˆãƒ¼ãƒ«ã™ã‚‹ Oracleã®ã‚µã‚¤ãƒˆã‹ã‚‰JDK 8ã‚’ãƒ€ã‚¦ãƒ³ãƒãƒ¼ãƒ‰ã™ã‚‹ã€‚ ç’°å¢ƒå¤‰æ•°JAVA8_HOMEã‚’è¨å®šã™ã‚‹ã€‚ Macã®å ´åˆ/usr/libexec/java_homeã§
nsyee 2015/06/08
Java

android

lambda
ãƒªãƒ³ã‚¯
Botkit Starter Kit
nsyee 2014/05/02
lambda

haskell

scotty

äº‹ä¾‹

æ•™è‚²
ãƒªãƒ³ã‚¯
slot-lambda
nsyee 2014/04/08
haskell

lambda

QuasiQuoter

neta
ãƒªãƒ³ã‚¯
GitHub - pi8027/lambda-calculus: A Formalization of Typed and Untyped Î»-Calculi in Coq and Agda2
nsyee 2014/02/27
Coq

lambda

SKI

Agda

type-system
ãƒªãƒ³ã‚¯
Alligator Eggs!
ãƒ¯ãƒ‹ã®ã‚¿ãƒžã‚´ ãƒ‘ã‚ºãƒ«ã‚²ãƒ¼ãƒ (ä½œè€…: ãƒ–ãƒ¬ãƒƒãƒˆãƒ»ãƒ“ã‚¯ã‚¿ãƒ¼) / 2007å¹´5æœˆ1æ—¥ åŽŸæ–‡: http://worrydream.com/AlligatorEggs/ ç¿»è¨³: å‘äº• æ·³ æº–å‚™ ã‚¹ãƒ†ãƒƒãƒ—1: ã“ã®PDFã‚’6ã¤ã‹ãã‚Œã‚ˆã‚ŠãŸãã•ã‚“ã®è‰²ã®ç´™ã§å°åˆ·ã—ã‚ˆã†ã€‚ (ãƒã‚¬ã‚ã¨ã‹ã«å°åˆ·ã™ã‚‹ã¨ã„ã„ã‚ˆ) ã‚¹ãƒ†ãƒƒãƒ—2: ã“ã®PDFã‚’ç™½ã„ç´™ã«å°åˆ·ã—ã‚ˆã†ã€‚ ã‚¹ãƒ†ãƒƒãƒ—3: ãƒ”ãƒ¼ã‚¹ã«åˆ‡ã‚Šã‚ã‘ã‚ˆã†ï¼ ãƒ”ãƒ¼ã‚¹ ã“ã‚ŒãŒè…¹ãºã“ãƒ¯ãƒ‹ã ã€‚ è…¹ãºã“ãƒ¯ãƒ‹ã¯ãŠãªã‹ãŒã™ã„ã¦ã„ã‚‹ã€‚è‡ªåˆ†ã®ã¾ãˆã«ã‚ã‚‹ã‚‚ã®ã¯ä½•ã§ã‚‚é£Ÿã¹ã¡ã‚ƒã†ï¼ã€€ã§ã‚‚è²¬ä»»æ„Ÿã®ã‚ã‚‹ãƒ¯ãƒ‹ã§ã‚‚ã‚ã‚‹ã‹ã‚‰ã€è‡ªåˆ†ã®å®¶æ—ã‚‚å®ˆã£ã¦ã‚‹ã‚“ã ã€‚ ã“ã‚ŒãŒãŠã˜ã„ã•ã‚“ãƒ¯ãƒ‹ã ã€‚ ãŠã˜ã„ã•ã‚“ãƒ¯ãƒ‹ã¯ãŠãªã‹ãŒã™ã„ã¦ã„ãªã„ã€‚ã‚‚ã†ãŸã£ã·ã‚Šé£Ÿã¹ãŸã‚“ã ã€‚è‡ªåˆ†ã®å®¶æ—ã¯å®ˆã‚‹ã‚ˆã€‚ ã“ã‚ŒãŒã‚¿ãƒžã‚´ã ã€‚ ã‚¿ãƒžã‚´ãŒã‹ãˆã‚‹ã¨ã€æ–°ã—ã„ãƒ¯ãƒ‹ã®å®¶æ—ãŒã§ãã‚‹ã‚ˆï¼ å®¶æ— ã“ã‚ŒãŒå°ã•ãªå®¶æ—ã ã€‚ ã¿ã©ã‚Šã®ãƒ¯ãƒ‹ãŒã€ã¿ã©ã‚Šã®ã‚¿ãƒžã‚´ã‚’å®ˆã£ã¦ã„ã‚‹ã€‚ ã‚‚ã†
nsyee 2014/02/18
math

lambda

game
ãƒªãƒ³ã‚¯
http://pasberth.github.io/blog/entry/2013-11-30/index.html
nsyee 2014/01/08
LLVM

OCaml

compiler

lambda
ãƒªãƒ³ã‚¯
B,C,K,Wã‚·ã‚¹ãƒ†ãƒ - Wikipedia
B, C, K, Wã‚·ã‚¹ãƒ†ãƒ ã¯ã€åŸºæœ¬çš„ãª4ã¤ã®å®šæ•°è¨˜å· B, C, K, W ã‹ã‚‰ãªã‚‹ã‚³ãƒ³ãƒ“ãƒãƒ¼ã‚¿è«–ç†ã®å¤‰ç¨®ã§ã‚ã‚‹ã€‚ã“ã®ä½“ç³»ã¯ãƒã‚¹ã‚±ãƒ«ãƒ»ã‚«ãƒªãƒ¼ã®åšå£«è«–æ–‡Grundlagen der kombinatorischen Logikã«ã‚ˆã‚‹ã‚‚ã®ã§ã€ãã®çµè«–éƒ¨åˆ†ã¯Curry 1930ã«ãŠã„ã¦ç¤ºã•ã‚ŒãŸã€‚ å®šæ•°è¨˜å· B, C, K, W ã®ç°¡ç´„åŸºã®ç°¡ç´„è¦å‰‡ã¯æ¬¡ã®ã‚ˆã†ã«å®šç¾©ã•ã‚Œã‚‹ï¼š B x y z â†’ x (y z) C x y z â†’ x z y K x y â†’ x W x y â†’ x y y ã“ã‚Œã‚‰ã®ã‚³ãƒ³ãƒ“ãƒãƒ¼ã‚¿ã¯ã€ç›´æ„Ÿçš„ã«æ¬¡ã®ã‚ˆã†ãªåƒãã‚’ã™ã‚‹ã‚‚ã®ã¨è€ƒãˆã‚‰ã‚Œã‚‹ï¼š B x y ã¯é–¢æ•°åˆæˆã€‚ C x y z ã¯å¼•æ•°äº¤æ›ã€‚ K x y ã¯ç ´æ£„ï¼› W x y ã¯è¤‡è£½ã€‚ 2ã¤ã®åŸºæœ¬çš„ãªå®šæ•°è¨˜å· S, Kï¼ˆåŠã³ SKK ã¨å¤–å»¶çš„ã«åŒå€¤ãªé–‰é … Iï¼‰ã‹ã‚‰ãªã‚‹SKIã‚³ãƒ³ãƒ“ãƒãƒ¼ã‚¿è¨ˆç®—ãŒã‚ã‚Šã€ã“ã“ã§ã¯ B, C, W ã¯
nsyee 2013/09/07
lambda

combinator

logic

BCKW
ãƒªãƒ³ã‚¯
ã‚³ãƒ³ãƒ“ãƒãƒ¼ã‚¿è«–ç† - Wikipedia
ã‚³ãƒ³ãƒ“ãƒãƒ¼ã‚¿è«–ç†ï¼ˆè‹±: combinatory logicã€çµ„ã¿åˆã‚ã›è«–ç†ï¼‰ã¯ã€ãƒ¢ã‚¤ã‚»ã‚¤ãƒ»ã‚·ã‚§ã‚¤ãƒ³ãƒ•ã‚£ãƒ³ã‚±ãƒªï¼ˆãƒã‚·ã‚¢èªžç‰ˆã€è‹±èªžç‰ˆï¼‰ï¼ˆéœ²: ÐœÐ¾Ð¸ÑÐµÐ¹ ÐÐ»ÑŒÐµÐ²Ð¸Ñ‡ Ð¨ÐµÐ¹Ð½Ñ„Ð¸Ð½ÐºÐµÐ»ÑŒã€è‹±: Moses Ilyich SchÃ¶nfinkelï¼‰ã¨ãƒã‚¹ã‚±ãƒ«ãƒ»ã‚«ãƒªãƒ¼ï¼ˆè‹±: Haskell Brooks Curryï¼‰ã«ã‚ˆã£ã¦ã€è¨˜å·è«–ç†ã§ã®å¤‰æ•°ã‚’æ¶ˆåŽ»ã™ã‚‹ãŸã‚ã«å°Žå…¥ã•ã‚ŒãŸè¨˜æ³•ã§ã‚ã‚‹ã€‚æœ€è¿‘ã§ã¯ã€è¨ˆç®—æ©Ÿç§‘å¦ã«ãŠã„ã¦è¨ˆç®—ã®ç†è«–çš„ãƒ¢ãƒ‡ãƒ«ã§åˆ©ç”¨ã•ã‚Œã¦ãã¦ã„ã‚‹ã€‚ã¾ãŸã€é–¢æ•°åž‹ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°è¨€èªžã®ç†è«–ï¼ˆæ„å‘³è«–ãªã©ï¼‰ã‚„å®Ÿè£…ã«ã‚‚å¿œç”¨ãŒã‚ã‚‹ã€‚ ã‚³ãƒ³ãƒ“ãƒãƒ¼ã‚¿è«–ç†ã¯ã€ã‚³ãƒ³ãƒ“ãƒãƒ¼ã‚¿ã¾ãŸã¯å¼•æ•°ã®ã¿ã‹ã‚‰ãªã‚‹é–¢æ•°é©ç”¨ã«ã‚ˆã£ã¦çµæžœãŒå®šç¾©ã•ã‚Œã¦ã„ã‚‹é«˜éšŽé–¢æ•°ã€ã‚³ãƒ³ãƒ“ãƒãƒ¼ã‚¿ã«åŸºã¥ã„ã¦ã„ã‚‹ã€‚ ã‚³ãƒ³ãƒ“ãƒãƒ¼ã‚¿è«–ç†ã¯å…ƒæ¥ã€æœ¬è³ªçš„ã«é‡åŒ–å¤‰æ•°ã‚’æ¶ˆåŽ»ã™ã‚‹ã“ã¨ã«ã‚ˆã£ã¦é‡åŒ–å¤‰æ•°ã®å½¹å‰²ã‚’æ˜Žç¢ºã«ã™ã‚‹ã‚ˆã†ãªã€Œpre-logicã€ã‚’æ„å›³ã—ã¦ã„ãŸã€‚é‡åŒ–å¤‰æ•°ã‚’æ¶ˆåŽ»ã™
nsyee 2013/09/07
lambda

combinator

logic
ãƒªãƒ³ã‚¯
ã¯ã¦ãªãƒ–ãƒã‚° | ç„¡æ–™ãƒ–ãƒã‚°ã‚’ä½œæˆã—ã‚ˆã†
ã¬ã‹ã„ã‚ã—ã€ã‚¿ãƒ¬ã‚«ãƒ„ã€é¶ã®åŠèº«æšã’ã€ãã—ã¦ç¬¹å›£åã€‚æ–°æ½Ÿã‚’å¹³ã‚‰ã’ã‚‹ï¼’æ³Šï¼“æ—¥ ä»Šå›žã®æ—…ã®ç›®çš„åœ°ã¯æ–°æ½Ÿã€‚æ–°æ½Ÿã«ã¯ç”³ã—è¨³ãªã„ã®ã ãŒã€è‡ªç™ºçš„ã«æ±ºã‚ãŸç›®çš„åœ°ã§ã¯ãªã„ã€‚ï¼ªï¼²æ±æ—¥æœ¬ã®ã€Œã©ã“ã‹ã«ãƒ“ãƒ¥ãƒ¼ãƒ¼ãƒ³ï¼ã€ã¨ã„ã†è¡Œãå…ˆã‚¬ãƒãƒ£ã‚µãƒ¼ãƒ“ã‚¹ã«ã‚ˆã‚Šæ±ºå®šã•ã‚ŒãŸã®ã ã€‚æ–°æ½Ÿã¨ã„ãˆã°é…’ã©ã“ã‚ç±³ã©ã“ã‚ã€‚ã¡ã‚‡ã†ã©æ–°ç±³ã®å£ç¯€ã ã€‚ã©ã‚“ã¨ã“ã„ã€‚å¤ç”ºã‚¨ãƒªã‚¢ã«å®¿ã‚’å–ã£â€¦
nsyee 2013/09/07
lambda

haskell

LazyK

compiler

SKI

combinator
ãƒªãƒ³ã‚¯
.NETåŸºç¤Žå‹‰å¼·ä¼šã§ãƒ©ãƒ ãƒ€è¨ˆç®—ã®ç™ºè¡¨ã‚’ã—ã¦ããŸ - ãã‚‹ãã‚‹ï½ž
ã‚‚ã†ä¸€ã‹æœˆä»¥ä¸Šã‚‚å‰ã®è©±ã§ã™ãŒã€.NETåŸºç¤Žå‹‰å¼·ä¼šã§(åž‹ç„¡ã—)ãƒ©ãƒ ãƒ€è¨ˆç®—ã®è©±ã‚’ã—ã¦ãã¾ã—ãŸã€‚ .NETã¨è¨€ãˆã°F#ã€F#ã®åŸºç¤Žã¨è¨€ãˆã°ãƒ©ãƒ ãƒ€è¨ˆç®—ï¼ã§ã™ã‚ˆãï¼ ç™ºè¡¨è³‡æ–™ã¯ã“ã¡ã‚‰ã§ã™ã€‚ ãƒ©ãƒ ãƒ€ã§ã‚¦ã‚£ã‚¶ãƒ¼ãƒ‰ æ»…ã›ã‚ˆæ‰‹ç¶šãã€ã¨ãƒãƒ£ãƒ¼ãƒã¯è¨€ã£ãŸ (â€»è¨€ã£ã¦ã¾ã›ã‚“) from bleis tift å½“æ—¥ã¯2 + 3ãŒåˆ†ã‹ã‚‰ãªã„ã¨å¥½è©•(?)ã§ã—ãŸã€‚ å½“æ™‚ã®æ§˜åã¯ã“ã‚“ãªæ„Ÿã˜ã§ã™ã€‚ 2+3ã®è¨ˆç®—ãŒé›£ã—ã„ @ãƒ©ãƒ ãƒ€è¨ˆç®— #dotNetbase 2013-07-20 14:53:47 via Twitter for Android ã¶ã‚Œã„ã™ã•ã‚“ãŒäººé–“ç°¡ç´„å™¨ã«ãªã‚Šä¸‹ãŒã£ã¦ã„ã‚‹ #dotNetBase 2013-07-20 14:55:49 via Janetter for Mac bleisè¿·åä¸ #dotnetbase 2013-07-20 14:58:10 via Twitter for Android äººé–“ç°¡
nsyee 2013/08/28
lambda

tutorial
ãƒªãƒ³ã‚¯
Do ExtraterrestrialsÂ Use Functional Programming?
Opening Keynote at YOW! Lambda Jam, Brisbane, 2013. Is functional programming just the result of clever language design? Are there deeper reasons for the effectiveness of the paradigm? Why has functional programming not caught on earlier? In this talk, we will have a look at the roots of functional programming, at their contribution to the success of the paradigm, and at the lessons we can draw to
nsyee 2013/08/18
haskell

functional

lambda

tutorial
ãƒªãƒ³ã‚¯
Coqã§ãƒ©ãƒ ãƒ€è¨ˆç®—ã‚’è¨¼æ˜Žã—ã¦ã¿ãŸ - ã¿ãšã´ãƒ¼æ—¥è¨˜
å‰ã‹ã‚‰ãšã£ã¨å–ã‚Šçµ„ã‚“ã§ã„ãŸã€ŒCoqã§å˜ç´”åž‹ä»˜ããƒ©ãƒ ãƒ€è¨ˆç®—ã‚’è¨¼æ˜Žã—ã¦ã¿ã‚ˆã†ã€ãŒä¸€æ®µè½ã—ã¾ã—ãŸã€‚ å‹•æ©Ÿ letå¤šç›¸ã®å®Ÿè£…ã¯ã—ãŸã‹ã‚‰ã€æ¬¡ã¯è¨¼æ˜Žã ã‚ æœ€è¿‘ã€æµè¡Œã£ã¦ã„ã‚‹Coqã‚’è¦šãˆãŸã„ æ‰±ãˆã‚‹ãƒ©ãƒ ãƒ€å¼ åž‹ã¯ã€Boolåž‹ã¨é–¢æ•°åž‹ã®ã¿ã€‚ Inductive type : Set := | BoolT : type | FunT : type -> type -> type. å¼ã¯ã€å¤‰æ•°å‚ç…§ã€çœŸå½å€¤ã€ãƒ©ãƒ ãƒ€(é–¢æ•°æŠ½è±¡)ã€é–¢æ•°é©ç”¨ã€ifå¼ã€‚ Inductive term : Set := Var : string -> term | Bool : bool -> term | Lambda : string -> type -> term -> term | Apply : term -> term -> term | If : term -> term -> term -> term. è¨¼æ˜Žã—ãŸå®šç† åž‹
nsyee 2013/08/12
Coq

lambda
ãƒªãƒ³ã‚¯
Agda by Example: Î»-calculus
and so on. de Bruijn notation is a terrible device for humans to use directly, but it is often more convenient when dealing with terms mechanically. When parsing a language it is easy to go from names to nameless, so that we can have the best of both worlds. Thus we will have: infixl 80 _Â·_ data Syntax : Set where -- A variable, the â„• being a de Bruijn index. var : â„• â†’ Syntax -- A number literal.
nsyee 2013/08/11
Agda

lambda
ãƒªãƒ³ã‚¯
Lambda to pi
I gave a talk a while back which included an interpreter for the pi-calculus, and a compiler from the lambda-calculus to it. I didn't really do justice to the material in a few slides, so here's a proper blog post. This article is available as a Literate Haskell file, which you can load into GHCi directly. The Ï€-calculus If the Î»-calculus is a minimal functional language, then the Ï€-calculus is a
nsyee 2013/08/06
haskell

lambda

pi-calculus
ãƒªãƒ³ã‚¯
ãƒ©ãƒ ãƒ€è¨ˆç®—å…¥é–€
18. å¬‰ã—ã„ã§ã™ â€¢ f(x, y) = x â€¢ â€¦ x ã¨ y ã®ä¸¡æ–¹ã‚’æ¸¡ã™å¿…è¦ãŒã‚ã‚‹ â€¢ f(x)(y) = x â€¢ â€¦ x ã ã‘æ¸¡ã™ã€ã¨ã„ã†æ“ä½œãŒå¯èƒ½ â€¢ ã“ã®æ“ä½œã‚’éƒ¨åˆ†é©ç”¨ã¨è¨€ã† 19. ã¤ã„ã§ã« â€¢ Î»x. (Î»y. x) ã¯ Î»x. Î»y. x ã¨è¡¨ã›ã‚‹ â€¢ ã©ã“ãŒã©ã®é–¢æ•°ã‹è‡ªæ˜Ž â€¢ Î»x. Î»y. x ã¯ Î»xy. x ã¨è¡¨ã›ã‚‹ â€¢ ãŸã ã®çœç•¥è¨˜æ³•
nsyee 2013/07/26
lambda
ãƒªãƒ³ã‚¯
Java8ã®lambdaæ§‹æ–‡ãŒã©ã®ã‚ˆã†ã«ã‚¯ãƒãƒ¼ã‚¸ãƒ£ãƒ¼ã§ã¯ãªã„ã‹ - ãã—ã ã®Hatena
Java8ã«lambdaæ§‹æ–‡ãŒå…¥ã‚Šã¾ã—ãŸãŒã€ã“ã‚Œã¯ã‚¯ãƒãƒ¼ã‚¸ãƒ£ãƒ¼ã§ã¯ãªã„ã€ã¨ã•ã‚Œã¦ã„ã¾ã™ã€‚ ã§ã¯ã€ã©ã®ã‚ˆã†ã«ã€Œã‚¯ãƒãƒ¼ã‚¸ãƒ£ãƒ¼ã§ã¯ãªã„ã€ã®ã‹ã€ã¡ã‚‡ã£ã¨è¦‹ã¦ã¿ã¾ã™ã€‚ ã¾ãšã€lambdaã‚’è¿”ã™ãƒ¡ã‚½ãƒƒãƒ‰ã‚’å®šç¾©ã—ã¾ã™ã€‚ public static Supplier<String> createMessenger(String name, String address){ return () -> { return String.format("ç§ã¯%sã€%sã«ä½ã‚“ã§ã‚‹", name, address); }; } å‘¼ã³å‡ºã™ã¨ã€ã“ã‚“ãªæ„Ÿã˜ã§Supplierã‚’å—ã‘å–ã‚Šã¾ã™ã€‚ Supplier<String> messenger = createMessenger("ãã—ã ", "ãµããŠã‹"); ã“ã®Supplierã‚’å®Ÿè¡Œã™ã‚‹ã¨ã€æ¬¡ã®ã‚ˆã†ã«ãªã‚Šã¾ã™ã€‚ System.out.println(messenger.
nsyee 2013/05/29
Java

closure

lambda
ãƒªãƒ³ã‚¯
Java 8ã®ãƒªãƒªãƒ¼ã‚¹ãŒå»¶æœŸï¼Œã„ã¾ã ç¶šãã‚»ã‚ãƒ¥ãƒªãƒ†ã‚£å•é¡Œã®ãŸã‚ã«2014å¹´ã¾ã§
Spring Bootã«ã‚ˆã‚‹APIãƒãƒƒã‚¯ã‚¨ãƒ³ãƒ‰æ§‹ç¯‰å®Ÿè·µã‚¬ã‚¤ãƒ‰ ç¬¬2ç‰ˆ ä½•åƒäººã‚‚ã®é–‹ç™ºè€…ãŒã€InfoQã®ãƒŸãƒ‹ãƒ–ãƒƒã‚¯ã€ŒPractical Guide to Building an API Back End with Spring Bootã€ã‹ã‚‰ã€Spring Bootã‚’ä½¿ã£ãŸREST APIæ§‹ç¯‰ã®åŸºç¤Žã‚’å¦ã‚“ã ã€‚ã“ã®æœ¬ã§ã¯ã€å‡ºç‰ˆæ™‚ã«æ–°ã—ããƒªãƒªãƒ¼ã‚¹ã•ã‚ŒãŸãƒãƒ¼ã‚¸ãƒ§ãƒ³ã§ã‚ã‚‹ Spring Boot 2 ã‚’ä½¿ç”¨ã—ã¦ã„ã‚‹ã€‚ã—ã‹ã—ã€Spring Boot3ãŒæœ€è¿‘ãƒªãƒªãƒ¼ã‚¹ã•ã‚Œã€é‡è¦ãªå¤‰...
nsyee 2013/05/09
Java

lambda
ãƒªãƒ³ã‚¯
é«˜éšŽã“ã¨ã‚Šã¡ã‚ƒã‚“ã¨å¦ã¶SKIã‚³ãƒ³ãƒ“ãƒãƒ¼ã‚¿
ã“ã¨ã‚Š: ãã‡ã€ã“ã®å‰ãã€Î»å¼ã¯ã¿ã‚“ãªã“ã‚“ãªæ„Ÿã˜ã®é–¢æ•°â€œSâ€ã¨â€œKâ€ã ã‘ã§è¡¨ç¾ã§ãã‚‹ã£ã¦èžã„ãŸã‚“ã ã‘ã©ã€æœ¬å½“?
nsyee 2013/05/04
lambda

functional

tutorial
ãƒªãƒ³ã‚¯
Java 8ã‚’é–¢æ•°åž‹ã£ã½ãä½¿ã†ãŸã‚ã®ãŠã¾ã˜ãªã„ - ãã—ã ã®Hatena
ã‚„ã‚ã€ï¼“æœˆã«å»¶æœŸã«ãªã£ãŸã¨ã¯ã„ãˆã€Java 8ãƒªãƒªãƒ¼ã‚¹ãŒå…·ä½“åŒ–ã—ã¦ãã¾ã—ãŸãã€‚ ã‚‚ã†ã“ã‚Œã§ã€LambdaãŒã¯ãšã‚Œã‚‹ã¨ã‹ã„ã†ã“ã¨ã¯ãªã•ãã†ã§ã™ã€‚ ã¨ã“ã‚ã§ã€Java 8ã§é–¢æ•°åž‹ã£ã½ã„ã“ã¨ãŒã§ãã‚‹ã‚ˆã†ã«ãªã£ã¦ã†ã‚Œã—ã„ã®ã§ã™ãŒã€ã¡ã‚‡ã£ã¨è¨˜è¿°ãŒå†—é•·ã§ã™ã€‚ã¨ã„ã†ã“ã¨ã§ã€çŸãæ›¸ã‘ã‚‹ãŠã¾ã˜ãªã„è€ƒãˆã¦ã¿ã¾ã—ãŸã€‚ Functionåž‹ ã•ã¦ã€ã¾ãšã¯Java 8ã§æ¨™æº–ã§å…¥ã£ãŸFunctionåž‹ã‚’ã¿ã¦ã¿ã¾ã—ã‚‡ã†ã€‚ãƒ‘ãƒƒã‚±ãƒ¼ã‚¸åã¾ã§å«ã‚ã‚‹ã¨java.util.funciton.Functionã§ã™ã€‚ ã“ã‚“ãªæ„Ÿã˜ã§ä½¿ã„ã¾ã™ã€‚ Function<String, String> enclose = s -> "[" + s + "]"; Genericsã§ã®åž‹æŒ‡å®šã®æœ€åˆãŒå¼•æ•°ã€ã‚ã¨ãŒæˆ»ã‚Šå€¤ã®åž‹ã§ã™ã€‚ã“ã“ã§ã¯Stringã‚’ã¨ã£ã¦Stringã‚’è¿”ã™é–¢æ•°ã¨ã—ã¦encloseã‚’å®šç¾©ã—ã¦ã„ã¾ã™ã€‚ ã“ã‚Œã‚’å‘¼ã³å‡ºãã†ã¨ã™ã‚‹ã¨ã€ã“ã‚“ãªæ„Ÿã˜
nsyee 2013/05/01
Java

functional

lambda
ãƒªãƒ³ã‚¯
ãƒ©ãƒ ãƒ€è¨ˆç®—ã§ä»£æ•°çš„ãƒ‡ãƒ¼ã‚¿åž‹ã‚’è¡¨ç¾ã™ã‚‹æ–¹æ³• - @syamino ã¯ã¦ãªãƒ€ã‚¤ã‚¢ãƒªãƒ¼
ãƒ©ãƒ ãƒ€è¨ˆç®—ã§Either Eitheråž‹ã®å€¤ã‚’ãƒ‘ã‚¿ãƒ¼ãƒ³ãƒžãƒƒãƒã™ã‚‹çŠ¶æ³ã‚’è€ƒãˆã¾ã™ã€‚ ã€Œãƒ‡ãƒ¼ã‚¿ã‚³ãƒ³ã‚¹ãƒˆãƒ©ã‚¯ã‚¿ã®ãƒ‘ã‚¿ãƒ¼ãƒ³ãƒžãƒƒãƒã€ã¯ï¼Œä¸‹å›³ã®ã‚ˆã†ã«ã—ã¦ãƒ©ãƒ ãƒ€è¨ˆç®—ã§è¡¨ç¾ã§ãã¾ã™ã€‚ ãƒ©ãƒ ãƒ€è¨ˆç®—ã§Bool ä»Šåº¦ã¯ï¼ŒBoolåž‹ã®å€¤ã‚’ãƒ‘ã‚¿ãƒ¼ãƒ³ãƒžãƒƒãƒã™ã‚‹çŠ¶æ³ã‚’è€ƒãˆã¾ã™ã€‚ Trueã‚„Falseã«ã¯å¼•æ•°ãŒç„¡ã„ã®ã§ï¼Œ(3)ã‚„(4)ã¯Î»ã§å›²ã¿ã¾ã›ã‚“ã€‚ ãƒ‘ã‚¿ãƒ¼ãƒ³ãƒžãƒƒãƒ = ã€Œãƒ‡ãƒ¼ã‚¿ã‚³ãƒ³ã‚¹ãƒˆãƒ©ã‚¯ã‚¿ã‚’ä»–ã®é–¢æ•°ã«ç½®ãæ›ãˆã‚‹ã“ã¨ã€ ãƒ‘ã‚¿ãƒ¼ãƒ³ãƒžãƒƒãƒã«ã‚ˆã£ã¦ï¼ŒLeftãŒlã«ç½®ãæ›ã‚ã‚Šã¾ã™ã€‚ä»¥ä¸‹åŒæ§˜ã§ã™ã€‚ ã€Œãƒ‡ãƒ¼ã‚¿ã‚³ãƒ³ã‚¹ãƒˆãƒ©ã‚¯ã‚¿ã‚’ç½®ãæ›ãˆã‚‹ã€ã¨ã„ã†æ¦‚å¿µã«ã¤ã„ã¦ï¼Œã‚‚ã†å°‘ã—è©³ã—ãè€ƒãˆã¦ã„ãã¾ã™ã€‚ ãƒ‡ãƒ¼ã‚¿ã‚³ãƒ³ã‚¹ãƒˆãƒ©ã‚¯ã‚¿ã®ç½®ãæ›ãˆæ–¹ã¯2ç¨®é¡žã‚ã‚‹ ãƒªã‚¹ãƒˆã®ã‚ˆã†ãªå†å¸°çš„ãªãƒ‡ãƒ¼ã‚¿åž‹ã§ã¯ï¼Œãƒ‡ãƒ¼ã‚¿ã‚³ãƒ³ã‚¹ãƒˆãƒ©ã‚¯ã‚¿ã®ç½®ãæ›ãˆæ–¹ãŒ2ç¨®é¡žã‚ã‚Šã¾ã™ã€‚ data List a = Cons a (List a) | Nil (1) å…¨ã¦ã®ãƒ‡ãƒ¼ã‚¿ã‚³ãƒ³ã‚¹ãƒˆãƒ©ã‚¯ã‚¿ã‚’ç½®
nsyee 2013/04/13
functional

lambda

pattern-matching

church-encoding
ãƒªãƒ³ã‚¯
1 2 æ¬¡ã®ãƒšãƒ¼ã‚¸