[B! type-theory] ilyaletreã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯

ilyaletre id:ilyaletre

type-theoryã«é–¢ã™ã‚‹ilyaletreã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ (17)

${{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}}

åž‹æŽ¨è«–ã¨åž‹æ¤œæŸ»ã€é™çš„ãªåž‹ã¤ã‘ã¨å‹•çš„ãªåž‹ã¤ã‘ã€å¼·ã„åž‹ã¤ã‘ã¨å¼±ã„åž‹ã¤ã‘ - sumiiã®ãƒ–ãƒã‚°
ã¤ã„ã§ã«è¿½åŠ ã€‚ åž‹æŽ¨è«–ï¼šå¤‰æ•°ã‚„å¼ã®åž‹ã‚’ãƒ—ãƒã‚°ãƒ©ãƒžãŒå®£è¨€ã—ãªãã¦ã‚‚ã€è¨€èªžå‡¦ç†ç³»ãŒæ–‡è„ˆã‹ã‚‰æŽ¨è«–ã—ã¦ãã‚Œã‚‹æ©Ÿæ§‹ã€‚MLã¨ã‹Haskellã¨ã‹ã€‚ åž‹æ¤œæŸ»ï¼šå¤‰æ•°ã‚„å¼ã®åž‹ãŒåˆã£ã¦ã„ã‚‹ã“ã¨ã‚’è¨€èªžå‡¦ç†ç³»ãŒï¼ˆæ™®é€šã¯é™çš„ã«ï¼‰ãƒã‚§ãƒƒã‚¯ã—ã¦ãã‚Œã‚‹æ©Ÿæ§‹ã€‚Cã¨ã‹Javaã¨ã‹ã€MLã‚„Haskellã‚‚ã€‚ é™çš„ãªåž‹ã¤ã‘ï¼šãƒ—ãƒã‚°ãƒ©ãƒ ã®å®Ÿè¡Œå‰ã«åž‹ã‚’æ¤œæŸ»ã™ã‚‹æ©Ÿæ§‹ã€‚MLã¨ã‹Haskellã¨ã‹Cã¨ã‹Javaã¨ã‹ã€‚ å‹•çš„ãªåž‹ã¤ã‘ï¼šãƒ—ãƒã‚°ãƒ©ãƒ ã®å®Ÿè¡Œä¸ã«åž‹ã‚’æ¤œæŸ»ã™ã‚‹æ©Ÿæ§‹ã€‚Lispã¨ã‹Schemeã¨ã‹Perlã¨ã‹ã€‚ å¼·ã„åž‹ã¤ã‘ï¼šæ¤œæŸ»ã‚’é€šã‚Œã°ã€å®‰å…¨ã•(safety)ãŒä¿è¨¼ã•ã‚Œã‚‹ã€ã¨ã„ã†ï¼ˆæ™®é€šã¯é™çš„ãªï¼‰åž‹ã¤ã‘ã€‚MLã¨ã‹Haskellã¨ã‹Javaã¨ã‹ã€‚Javaã¯ãƒã‚°ãŒã‚ã£ãŸã‚Šã—ãŸã®ã§å°‘ã—æ€ªã—ã„ã§ã™ãŒã€‚ å¼±ã„åž‹ã¤ã‘ï¼šæ¤œæŸ»ã‚’é€šã£ã¦ã‚‚ã€å®‰å…¨ã•(safety)ã¯ä¿è¨¼ã•ã‚Œãªã„ã€ã¨ã„ã†åž‹ã¤ã‘ã€‚Cã¨ã‹Pascalã¨ã‹ã€‚ å®‰å…¨ã•(safety)ï¼šãƒ—ãƒã‚°ãƒ©ãƒ ãŒè¨€èªžä»•
ilyaletre 2019/06/13
compiler

type-theory
ãƒªãƒ³ã‚¯
ç§ã¨åž‹ã‚·ã‚¹ãƒ†ãƒ ã¨ãƒã‚¨ãƒ
æœ€è¿‘å··ã§ã¯ä¿„ã«åž‹ã‚·ã‚¹ãƒ†ãƒ ã«ã¤ã„ã¦ã®è¨€åŠãŒå¢—ãˆã€åž‹ã‚·ã‚¹ãƒ†ãƒ ãƒã‚¨ãƒžãƒ¼ãŒå¢—ãˆã¦ã‚‹æ°—ãŒã™ã‚‹ã®ã§è‡ªåˆ†ã‚‚ãã®æ™‚æµã«ä¹—ã‚ŠãŸã„ã€‚ å®Œå…¨ã«ãƒã‚¨ãƒ ã ã‘ã©ãªã‚“ã‹ã‚ã£ãŸã‚‰éšæ™‚æŒ‡æ‘˜ãã ã•ã„ã€‚ç›´ã—ã¾ã™ã€‚ TL;DR è¨€ã„ãŸã„ã“ã¨ã¯ã¾ã¨ã‚ã‚‹ã¨æ¬¡ åž‹ã‚·ã‚¹ãƒ†ãƒ ã¯ç¨‹åº¦å•é¡Œãªã®ã§ã¡ã‚‡ã†ã©ã„ã„ã¨ã“ã‚ã‚’æŽ¢ã™ã¹ã åž‹ã¯ä¸‡èƒ½ã§ã‚‚å¼·ã•ãŒæ£ç¾©ã§ã‚‚ãªã„(ã ã‹ã‚‰æœªã ã«ç ”ç©¶ã•ã‚Œã¦ã‚‹) ã‚ˆãçŸ¥ã‚Šã‚‚ã—ãªã„ãã›ã«è¨ˆç®—æ©Ÿç§‘å¦ã‚’ä¾®è¾±ã™ã‚‹ã®ã¯ã‚„ã‚ã‚ äºˆé˜²ç·š ã‚ãã¾ã§ãƒã‚¨ãƒ ã§ã™ã®ã§ä¸èº«ã¯ãªã„ã§ã™ ç§ã¯åž‹ç†è«–å°‚æ”»ã§å¦ä½ã¯ã¨ã£ãŸã‚‚ã®ã®ç ”ç©¶è€…ã§ã¯ãªã„ã®ã§ã‚ã¾ã‚Šä¿¡ç”¨ã—ã™ãŽãªã„ã‚ˆã†ã« åž‹ã‚·ã‚¹ãƒ†ãƒ ã®éŽåŽ» åž‹ã‚·ã‚¹ãƒ†ãƒ ã¯å¤§ã¾ã‹ã«æ¬¡ã®ã‚ˆã†ãªåˆ©ç‚¹ãŒã‚ã‚‹ã¨ã•ã‚Œã¦ããŸ(å€‹äººçš„ä¸»è¦³) ã€Œç•°å¸¸ã€ãªãƒ—ãƒã‚°ãƒ©ãƒ ã‚’æ¤œå‡ºã™ã‚‹ä»•çµ„ã¿ é™çš„è§£æžã«ã‚ˆã‚‹åˆ†ã‹ã‚Šã‚„ã™ã„ã‚¨ãƒ©ãƒ¼ãƒ¡ãƒƒã‚»ãƒ¼ã‚¸ åž‹ãã®ã‚‚ã®ã®ãƒ‰ã‚ãƒ¥ãƒ¡ãƒ³ãƒˆæ€§ IDEã§ã®completionã«è²¢çŒ® æœ€é©åŒ–ã«è²¢çŒ® (æ•°å¦ã«æ£ã—ãè£æ‰“ã¡ã•ã‚ŒãŸsemanti
ilyaletre 2018/06/03
ãŠã¾ã‘ã®ã¨ã“ã®Javaã¸ã®è¨€åŠéƒ¨åˆ†ãŒãªã‚“ã‹ãƒ¯ã‚¯ãƒ¯ã‚¯ã—ãŸã€‚

type-theory
ãƒªãƒ³ã‚¯
System F with type equality coercions - Microsoft Research
ilyaletre 2018/06/02
haskell

type-theory

ã‚ã¨ã§èªã‚€
ãƒªãƒ³ã‚¯
What is a nominal type?
The slide for the talk on: try! Swift Tokyo 2017 RejectCon - connpass https://rmp-quipper.connpass.com/event/49316/ Swiftã§ã€Anyãªã©ã®ä¸€éƒ¨ã®åž‹ã«extensionã‚’æ›¸ã“ã†â€¦
ilyaletre 2018/06/01
nominal typeã£ã¦ä½•ã ã‚ã¨æ€ã£ã¦è¦‹ã¦ã¿ãŸã‚‰å†’é ã®ãƒ†ãƒ³ã‚·ãƒ§ãƒ³ã®é«˜ã•ã«ç¬‘ã£ãŸã€‚

type-theory
ãƒªãƒ³ã‚¯
å¤šç›¸ãƒãƒªã‚¢ãƒ³ãƒˆã‚’ä½¿ã„ã“ãªãã†(4) - osiireâ€™s blog
å‰å›žã¾ã§ã§å¤šç›¸ãƒãƒªã‚¢ãƒ³ãƒˆã®åŸºæœ¬çš„ãªæ©Ÿèƒ½ã¯èª¬æ˜Žã—ã¦ãã¾ã—ãŸã€‚ãã“ã§ä»Šå›žã¯ã€å¤šç›¸ãƒãƒªã‚¢ãƒ³ãƒˆã®ã¨ã¦ã‚‚é‡è¦ãªå¿œç”¨ã«ã¤ã„ã¦ãŠè©±ã—ãŸã„ã¨æ€ã„ã¾ã™ã€‚ãã‚Œã¯ã€å ´åˆåˆ†ã‘æ§‹é€ ã®æ‹¡å¼µå•é¡Œã§ã™ã€‚ å ´åˆåˆ†ã‘æ§‹é€ ã®æ‹¡å¼µã¯é›£ã—ã„ ä¾‹ãˆã°ã€æ¬¡ã®ã‚ˆã†ãªã‚³ãƒ¼ãƒ‰ãŒã‚ã£ãŸã¨ã—ã¾ã™ã€‚ module Card = struct type t = Num of int | Jack | Queen | King let num = function Num i -> i | Jack -> 11 | Queen -> 12 | King -> 13 end Card.tã«ã¯4ç¨®é¡žã®å ´åˆåˆ†ã‘ãŒã‚ã‚Šã€ãã‚Œã‚‰ã«å¯¾ã—ã¦numã¨ã„ã†æ“ä½œãŒå®šç¾©ã•ã‚Œã¦ã„ã¾ã™ã€‚ã“ã®ã‚ˆã†ãªå ´åˆåˆ†ã‘æ§‹é€ +æ“ä½œã«å¯¾ã—ã¦ã€ é™çš„ã§å®‰å…¨ã«(ã‚ãƒ£ã‚¹ãƒˆã›ãš)ã€ å…ƒã®ã‚³ãƒ¼ãƒ‰ã‚’ä¸€åˆ‡å¤‰æ›´ã›ãšã€ æ–°ã—ã„å ´åˆåˆ†ã‘ã‚’åŠ ãˆã€ æ–°ã—ã„æ“ä½œã‚‚åŠ ãˆãŸ æ–°ã—ã„å ´åˆåˆ†ã‘æ§‹é€ ã‚’å®šç¾©ã™ã‚‹ ã«ã¯ã©ã†ã™ã‚Œã°ã„ã„
ilyaletre 2018/03/18
ocaml

type-theory
ãƒªãƒ³ã‚¯
Racket 6.11ã§ç¯©åž‹(refinement type)ã¨ä¾å˜é–¢æ•°åž‹(dependent function type)ãŒå®‰å®šæ©Ÿèƒ½ã«
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ãŒæœ€è¿‘ãƒªãƒªãƒ¼ã‚¹ã•ã‚Œã€é‡è¦ãªå¤‰...
ilyaletre 2018/01/16
racket

lisp

type-theory
ãƒªãƒ³ã‚¯
æ¼¸é€²çš„åž‹ä»˜ã‘ã®æœªæ¥ã‚’è€ƒãˆã‚‹ - -
ã“ã®è¨˜äº‹ã¯CAMPHOR- Advent Calendar 2017 11æ—¥ç›®ã®è¨˜äº‹ã§ã™ï¼Ž ã‚¢ãƒ–ã‚¹ãƒˆãƒ©ã‚¯ãƒˆ æ¼¸é€²çš„åž‹ä»˜ã‘ã¯ï¼Œã²ã¨ã¤ã®è¨€èªžã®ä¸ã§é™çš„åž‹ä»˜ã‘ã¨å‹•çš„åž‹ä»˜ã‘ã‚’ã‚¹ãƒ ãƒ¼ã‚ºã«çµ„ã¿åˆã‚ã›ã‚‹ãŸã‚ã®æŠ€è¡“ã§ã™ï¼Ž ã‚ˆãçŸ¥ã‚‰ã‚ŒãŸç‰¹å¾´ã¯ any åž‹ã‚’ä½¿ã£ãŸé™çš„åž‹ä»˜ã‘ã§ï¼Œ TypeScript ã‚„ Python ã¨ã„ã£ãŸãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°è¨€èªžã«ã¯æ—¢ã«å®Ÿè£…ã•ã‚Œã¦ã„ã¾ã™ï¼Ž ã—ã‹ã—ï¼Œç†è«–ã¨å®Ÿéš›ã®ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°è¨€èªžã®é–“ã«ã¯å¤§ããªã‚®ãƒ£ãƒƒãƒ—ãŒå˜åœ¨ã—ã¾ã™ï¼Ž ç‰¹ã«ï¼Œæ¼¸é€²çš„åž‹ä»˜ã‘ã®ç†è«–ã§ææ¡ˆã•ã‚Œã¦ã„ã‚‹ã‚ãƒ£ã‚¹ãƒˆã‚’ç”¨ã„ãŸå‹•çš„åž‹æ¤œæŸ»ãŒå®Ÿè£…ã•ã‚Œã¦ã„ãªã„ãŸã‚ã«ï¼Œ é™çš„åž‹ä»˜ã‘ã®æ©æµã‚’ååˆ†ã«å¾—ã‚‰ã‚Œã¦ã„ãªã„ã¨ã„ã†å•é¡ŒãŒã‚ã‚Šã¾ã™ï¼Ž ã“ã®è¨˜äº‹ã§ã¯ï¼Œã¾ãšæ¼¸é€²çš„åž‹ä»˜ã‘ã®ç†è«–ã‚’ã‚³ãƒ¼ãƒ‰ä¾‹ã‚’ç”¨ã„ã¦ç´¹ä»‹ã—ï¼Œ ç¾çŠ¶ã®æ¼¸é€²çš„åž‹ä»˜ãè¨€èªžãŒæŠ±ãˆã‚‹å•é¡Œã‚’è§£èª¬ã—ã¾ã™ï¼Ž ãã®ã‚ã¨ã§ï¼Œæ¼¸é€²çš„åž‹ä»˜ãè¨€èªžãŒç›®æŒ‡ã™ã¹ãç›®æ¨™ã‚’ç†è«–çš„è¦–ç‚¹ã‹ã‚‰è«–ã˜ã¾ã™ï¼Ž ãã‚Œã‚‰ã®ç›®æ¨™ã¯ï¼Œé™çš„åž‹ä»˜ã‘ã‚’
ilyaletre 2017/12/11
ã‚ã¨ã§èªã‚€

TypeScript

type-theory
ãƒªãƒ³ã‚¯
WTF is F-Bounded Polymorphism
ilyaletre 2017/12/03
F-Bounded Polymorphism ã«ã¤ã„ã¦

type-theory
ãƒªãƒ³ã‚¯
Reddit - Dive into anything
I am reading Oleg Kiselyov's tutorial on tagless final interpreters. When implementing a DSL, what is the advantage of tagless final style over plain old datatypes (or say, GADTs)? I know when using normal datatypes, when you add new variants, you need to modify existing functions that operate on these types, and then you lose separate compilation. But does that really pose a huge probl em in pract
ilyaletre 2017/11/30
ãªã‚“ã‹ã‚„ãŸã‚‰æµæš¢ã«èªžã£ã¦ã‚‹äººãŠã‚‹ãªã€ã¨æ€ã£ãŸã‚‰Edward Kmettã ã£ãŸã€‚(ã‚ã‚‹ã‚ã‚‹

haskell

type-theory
ãƒªãƒ³ã‚¯
https://okmij.org/ftp/tagless-final/course/lecture.pdf
ilyaletre 2017/11/30
tagless finalã®è¬›ç¾©ãƒŽãƒ¼ãƒˆã€‚å°åˆ·ã—ãªã„ã¨èªã‚ãªã„ã‚ã“ã‚Œã€‚

haskell

type-theory
ãƒªãƒ³ã‚¯
tiger.dvi
Java 2 Standard Edition 5.0 Tiger Java 3 7 2013 10 25 Copyright 2004, 2005, 2009, 2010, 2013 Yoshiki Shibata. All rights reserved. iii Tiger, Tiger burning bright Like a geek who works all night What new-fangled bit or byte Could ease the hackerâ€™s weary plight? â€“ Joshua Bloch Tiger Java 2 Standard Edition 5.0 Java Java 1.1 1.4 assert 5.0 Java 5.0 1.4 Java 5.0 Java 1.4 1.4 5.0 5.0 5.0 Java type par
ilyaletre 2017/08/29
Javaã®ã‚¸ã‚§ãƒãƒªãƒƒã‚¯ã«ã¤ã„ã¦çŸ¥ã‚ŠãŸã„ãªã‚‰ã“ã‚Œã€ã‚‰ã—ã„ã€‚

java

generic

type-theory
ãƒªãƒ³ã‚¯
The DOT Calculus - (Dependent Object Types)
The DOT Calculus (Dependent Object Types) Nada Amin Scala Days June 18, 2014 1 DOT: Dependent Object Types I DOT is a core calculus for path-dependent types. I Goals I simplify Scalaâ€™s type system by desugaring to DOT I simplify Scalaâ€™s type inference by relying on DOT I prove that DOT is type-safe 2 Types in Scala and DOT 3 Types in Scala modular named type scala.collection.BitSet compound type C
ilyaletre 2016/12/11
DOTè¨ˆç®—ã£ã¦ãªã‚“ã ãƒ¼ã£ã¦æ€ã£ã¦ã¿ã¤ã‘ãŸè³‡æ–™ã€‚

scala

type-theory
ãƒªãƒ³ã‚¯
Tagless-Final Style
The so-called ``tagless-final'' style is a method of embedding domain-specific languages (DSLs) in a typed functional host language such as Haskell, OCaml, Scala or Coq. It is an alternative to the more familiar embedding as a (generalized) algebraic data type. It is centered around interpreters: Evaluator, compiler, partial evaluator, pretty-printer, analyzer, multi-pass optimizer are all interpr
ilyaletre 2016/12/02
ã¾ãŸè¬Žã®ã‚ãƒ¼ãƒ¯ãƒ¼ãƒ‰ã‚’ç™ºè¦‹ã—ã¦ã—ã¾ã£ãŸã€‚ã€‚ã€‚

Haskell

type-theory
ãƒªãƒ³ã‚¯
é™çš„åž‹ãƒã‚§ãƒƒã‚¯ãŒã‚ã£ãŸã‚‰ãƒ†ã‚¹ãƒˆã¯ã‚ã¾ã‚Šæ›¸ã‹ãªãã¦è‰¯ã„ã®ã‹ - $shibayu36->blog;
æ˜”ã«å‹•çš„è¨€èªžã ã¨ã²ãŸã™ã‚‰ãƒ†ã‚¹ãƒˆã‚’æ›¸ã‹ãªã„ã¨ã„ã‘ãªã„ã‘ã©ã€é™çš„åž‹ãƒã‚§ãƒƒã‚¯ã®ä»•çµ„ã¿ãŒã‚ã‚Œã°ãã‚“ãªã«ãƒ†ã‚¹ãƒˆã‚’æ›¸ã‹ãªãã¦ã‚‚ã„ã„ã‚ˆãã¿ãŸã„ãªè©±ãŒã‚ã£ãŸè¨˜æ†¶ãŒã‚ã‚‹ã€‚æ˜”ã¯çµå±€ã©ã†ãªã‚“ã ã‚ã†ã¨æ€ã£ã¦ãŸã®ã ã‘ã©ã€æœ€è¿‘ã‚‚ãã†ã„ã†è©±ã‚’è€³ã«ã—ã¦ã€ã‚„ã£ã±ã‚Šãã‚“ãªã“ã¨ãªã„ã ã‚ã†ã¨ã„ã†æ°—æŒã¡ã«ãªã£ãŸã®ã§ãƒ¡ãƒ¢ã€‚ãµã¨æ€ã„ã¤ã„ãŸã ã‘ãªã®ã§æ£å½“æ€§ã¯åˆ†ã‹ã‚‰ãªã„ã€‚ ã¾ãšãªãœãã®ã‚ˆã†ãªè©±ã«ãªã‚‹ã®ã‹è€ƒãˆãŸã®ã ã‘ã©ã€ã€Œé™çš„è¨€èªžãªã‚‰ã‚³ãƒ³ãƒ‘ã‚¤ãƒ«æ™‚ã«åž‹ãƒã‚§ãƒƒã‚¯ã‚’ã™ã‚‹ã“ã¨ãŒã§ãã‚‹ãŸã‚å®‰å…¨æ€§ã‚’é«˜ã‚ã‚‰ã‚Œã‚‹ã€ã¨ã„ã†ç‚¹ã‹ã‚‰ã“ã†ã„ã†è©±ãŒä¸ŠãŒã£ã¦ãã¦ã„ã‚‹ã‚ˆã†ã«æ€ã†ã€‚ã—ã‹ã—ã‚ˆãè€ƒãˆã¦ã¿ã‚‹ã¨ã€é™çš„åž‹ãƒã‚§ãƒƒã‚¯ã¨ã„ã†ä»•çµ„ã¿ã¯ã€ãƒ—ãƒã‚°ãƒ©ãƒ ãƒ†ã‚ã‚¹ãƒˆã¨ã—ã¦æ£å½“ã§ã‚ã‚‹ã‹ã¨ã„ã†ç‚¹ã—ã‹ä¿è¨¼ã—ã¦ã„ãªã„ã€‚ã¤ã¾ã‚Šã€ç‰¹å®šã®å¤‰æ•°ãŒå¿…ãšãã®åž‹ã§ã‚ã‚‹ã¨ã‹ã€ç‰¹å®šã®ã‚¨ãƒ³ãƒ†ã‚£ãƒ†ã‚£ã‹ã‚‰ã®ãƒ¡ã‚½ãƒƒãƒ‰å‘¼ã³å‡ºã—ãŒæ£ã—ã„ã‹(ãƒ¡ã‚½ãƒƒãƒ‰åã‚„å¼•æ•°ãªã©)ã¨ã‹ã€é–¢æ•°ãŒè¿”ã™åž‹ãŒã‹ãªã‚‰ãšæŒ‡å®šã—ãŸåž‹ã«ãªã‚‹ã‹ã¨ã‹ã€ãã®ã‚ˆã†ãª
ilyaletre 2016/10/20
"ã€Œæ±ºã‚ã‚‰ã‚ŒãŸä»•æ§˜ã©ãŠã‚Šã«å®Ÿè£…ã§ãã¦ã„ã‚‹ã‹ã€ã¨ã„ã†ç‚¹ã‚’ç¢ºèªã™ã‚‹ã“ã¨ã¯å‡ºæ¥ãªã„ã€‚" åž‹ã§ä»•æ§˜ã‚’è¡¨ç¾ã§ãã‚‹ãªã‚‰ã€åž‹ã‚’å……è¶³ã™ã‚‹å®Ÿè£…ã«ã¯ãƒ†ã‚¹ãƒˆãŒã„ã‚‰ãªã„ã ã‚ã†ã€‚å®Ÿéš›ã«ã¯åž‹ã§ä»•æ§˜ã‚’è¡¨ç¾ã™ã‚‹ã®ãŒé›£ã—ã„ã‚ã‘ã ã‘ã©ã€‚

programming

type-theory
ãƒªãƒ³ã‚¯
Write You a Haskell ( Stephen Diehl )
There is nothing more practical than a good theory. â€” James C. Maxwell Hindley-Milner Inference The Hindley-Milner type system ( also referred to as Damas-Hindley-Milner or HM ) is a family of type systems that admit the serendipitous property of having a tractable algorithm for determining types from untyped syntax. This is achieved by a process known as unification, whereby the types for a well-
ilyaletre 2016/10/06
type-theory
ãƒªãƒ³ã‚¯
Instances and Dictionaries - School of Haskell | School of Haskell
An Idealized Operational View of Type Class Dictionary PassingWhen you make a class class Foo a where quux :: a -> Int muux :: a -> Booland then an instance. data Bar = Bar instance Foo Bar where quux = \Bar -> 1 muux = \Bar -> TrueThere is a desugaring processes that occurs, removing type classes. For each class there is an associated record, data FooD a = FooD -- class Foo a where { quuxD :: a -
ilyaletre 2016/09/30
Elmã«ã¯åž‹ã‚¯ãƒ©ã‚¹ãŒç„¡ãã¦â€¦â€¦ã¨è¨€ã‚ã‚ŒãŸã‚Šã™ã‚‹ã‘ã©ã€ã‚³ãƒ³ãƒ‘ã‚¤ãƒ©ã«è¾žæ›¸ã‚’æ±ºå®šã•ã›ã‚‹ãƒ—ãƒã‚»ã‚¹ã•ãˆè«¦ã‚ã‚Œã°ã€è‡ªåˆ†ã§è¾žæ›¸ä½œã£ã¦æ¸¡ã™ã‚ˆã†ãªã‚¨ãƒŸãƒ¥ãƒ¬ãƒ¼ãƒˆã¯ã§ãã‚‹ã€‚ã¤ã¾ã‚Šå¿è€ã¨æ ¹æ€§ãŒå¿…è¦ã ã€‚

haskell

type-theory
ãƒªãƒ³ã‚¯
Haskellã¨OCamlã®åž‹ã®é•ã„
Hideyuki Tanaka @tanakh å®Œå…¨ãªåž‹æŽ¨è«–ã‚ˆã‚Šã‚‚ã€åž‹ã‚·ã‚¹ãƒ†ãƒ ã®è¡¨ç¾åŠ›ãŒé‡è¦ã§ã‚ã‚‹ã€ã¨ã„ã†è€ƒãˆã¯å¤šåˆ†OCamlã¨ã¯ç›¸å®¹ã‚Œãªã„ã€‚ãã“ãŒOCamlã¨Haskellã®æ±ºå®šçš„ãªå·®ã§ã‚ã£ã¦ã€Pureã¨ã‹Lazyã¨ã‹ã®é•ã„ã¯ãã‚Œã«æ¯”ã¹ã‚Œã°å‰²ã‚Šã¨ã©ã†ã§ã‚‚ã„ã„ã€‚ 2012-03-26 14:24:35 Jun Furuse ðŸ«ðŸŒ´ @camloeba RT @tanakh å®Œå…¨ãªåž‹æŽ¨è«–ã‚ˆã‚Šã‚‚ã€åž‹ã‚·ã‚¹ãƒ†ãƒ ã®è¡¨ç¾åŠ›ãŒé‡è¦ã§ã‚ã‚‹ã€ã¨ã„ã†è€ƒãˆã¯å¤šåˆ†OCamlã¨ã¯ç›¸å®¹ã‚Œãªã„ã€‚ãã“ãŒOCamlã¨Haskellã®æ±ºå®šçš„ãªå·®ã§ã‚ã£ã¦ã€Pureã¨ã‹Lazyã¨ã‹ã®é•ã„ã¯ãã‚Œã«æ¯”ã¹ã‚Œã°å‰²ã‚Šã¨ã©ã†ã§ã‚‚ã„ã„ã€‚ 2012-03-26 14:36:35
ilyaletre 2016/09/16
haskell

ocaml

type-theory
ãƒªãƒ³ã‚¯
1