Why Dependent Haskell is the Future of Software Development
Hi, I’m Vladislav Zavialov. For the last couple of months, my job at Serokell has been to lead our efforts to improve our primary tool – the Glasgow Haskell Compiler (GHC). I’m focusing on making the type system more powerful, inspired by Richard Eisenberg’s thesis that introduces Dependent Haskell. Dependent types are a feature I’d love to see in Haskell the most. Let’s talk why. There’s a tensio
ç§ã¨åž‹ã‚·ã‚¹ãƒ†ãƒ ã¨ãƒã‚¨ãƒ
最近巷ã§ã¯ä¿„ã«åž‹ã‚·ã‚¹ãƒ†ãƒ ã«ã¤ã„ã¦ã®è¨€åŠãŒå¢—ãˆã€åž‹ã‚·ã‚¹ãƒ†ãƒ ãƒã‚¨ãƒžãƒ¼ãŒå¢—ãˆã¦ã‚‹æ°—ãŒã™ã‚‹ã®ã§è‡ªåˆ†ã‚‚ãã®æ™‚æµã«ä¹—ã‚ŠãŸã„。 完全ã«ãƒã‚¨ãƒ ã ã‘ã©ãªã‚“ã‹ã‚ã£ãŸã‚‰éšæ™‚指摘ãã ã•ã„。直ã—ã¾ã™ã€‚ TL;DR 言ã„ãŸã„ã“ã¨ã¯ã¾ã¨ã‚ã‚‹ã¨æ¬¡ 型システムã¯ç¨‹åº¦å•é¡Œãªã®ã§ã¡ã‚‡ã†ã©ã„ã„ã¨ã“ã‚を探ã™ã¹ã åž‹ã¯ä¸‡èƒ½ã§ã‚‚å¼·ã•ãŒæ£ç¾©ã§ã‚‚ãªã„(ã ã‹ã‚‰æœªã ã«ç ”究ã•ã‚Œã¦ã‚‹) よã知りもã—ãªã„ãã›ã«è¨ˆç®—機科å¦ã‚’侮辱ã™ã‚‹ã®ã¯ã‚„ã‚゠予防線 ã‚ãã¾ã§ãƒã‚¨ãƒ ã§ã™ã®ã§ä¸èº«ã¯ãªã„ã§ã™ ç§ã¯åž‹ç†è«–å°‚æ”»ã§å¦ä½ã¯ã¨ã£ãŸã‚‚ã®ã®ç ”究者ã§ã¯ãªã„ã®ã§ã‚ã¾ã‚Šä¿¡ç”¨ã—ã™ãŽãªã„よã†ã« 型システムã®éŽåŽ» 型システムã¯å¤§ã¾ã‹ã«æ¬¡ã®ã‚ˆã†ãªåˆ©ç‚¹ãŒã‚ã‚‹ã¨ã•ã‚Œã¦ããŸ(個人的主観) 「異常ã€ãªãƒ—ãƒã‚°ãƒ©ãƒ を検出ã™ã‚‹ä»•çµ„ã¿ é™çš„解æžã«ã‚ˆã‚‹åˆ†ã‹ã‚Šã‚„ã™ã„エラーメッセージ åž‹ãã®ã‚‚ã®ã®ãƒ‰ã‚ュメント性 IDEã§ã®completionã«è²¢çŒ® 最é©åŒ–ã«è²¢çŒ® (æ•°å¦ã«æ£ã—ãè£æ‰“ã¡ã•ã‚ŒãŸsemanti
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
å•é¡Œã‚’解決ã™ã‚‹ã¤ã‚‚ã‚Šã§ã‚ッãƒãƒªåž‹ã‚’付ã‘ãŸå…ˆã«ã‚る高ã„å£ - ã¼ãã®ã¬ã¾ã¡ 出張版
null安全ãŠã˜ã•ã‚“ã«ãªã‚Šã‹ã‚ã‚Šãã‚ŒãŒã—ãŒãŠè¦‹ã›ã¤ã‹ã¾ã¤ã‚‹ 機械ãŒç†è§£ã§ãる複雑ãªå¥‘ç´„ã®åž‹è¡¨ç¾ãŒã‚‚ãŸã‚‰ã™ã‚‚ã®ã¯ ã¤ã¾ã‚‹ã¨ã“ã‚ã“ã®ã‚ˆã†ãªã‚‚ã® ãšã¶ã¶(切ã£ãŸè…¹ã‹ã‚‰è¨¼æ˜Žã‚ªãƒ–ジェクトを引ã摺り出ã™)— Noriyuki OHKAWA (@notogawa) 2016å¹´11月18æ—¥ éŽãŽãŸã‚‹ã¯çŒ¶åŠã°ã–ã‚‹ãŒã”ã¨ã—． 最近null安全？ã ã‹ã®è©±ã®ã‹ã‚‰ã¿ã§ï¼Œ(é™çš„ãª)åž‹ã§å¥‘約云々を表ç¾ã—ã¦ã‚·ã‚¢ãƒ¯ã‚»ã«ãªã‚Œã‚‹ã‚“ã ãœãƒ¼ã¨è¨€ã†ã®ã‚’ãƒãƒ©ãƒ›ãƒ©è¦‹èžãã™ã‚‹ï¼ŽãŸã¨ãˆã°ï¼Œpythonã§çµ±è¨ˆãªã‚Šæ©Ÿæ¢°å¦ç¿’ãªã‚Šã‚„ã£ã¦ã¦numpy弄るよã†ãªäººãŒï¼Œndarray(多次元é…列)ã®shape(多次元é…列ã®å½¢)ãŒåˆã‚ãšã‚¨ãƒ©ãƒ¼ã§è½ã¡ãŸã‚Šã¨ã‹ãã†ã„ã†ã‚¢ãƒ¬ã«ã¤ã„ã¦äº‘々ã¨ã„ã†ï¼Žãªã‚‹ã»ã©åž‹ãŒã‚ã‚Œã°å®Ÿè¡Œå‰ã«æ¢ã‚ã‚‹ã“ã¨ãŒã§ã，実行時，エラー*1ã«ãªã£ã¦ãƒ•ã‚¡ãƒ¼ã¿ãŸã„ãªã“ã¨ã¯é¿ã‘られるã ã‚ã†ï¼Ž ã—ã‹ã—，ã“ã‚ŒãŒå¤©å›½ã¸ç¶šãé“ã‹ã©ã†ã‹ã¯ã¾ãŸåˆ¥ã®è©±ï¼Ž(ä¾å˜)åž‹ã§èˆ—
ã“ã‚ããªã„ Idris (1) - Ryusei’s Notes (a.k.a. M59ã®ãƒ–ãƒã‚°)
ã¯ã˜ã‚ã« Idrisã¨ã„ã†ã€Haskellã«ä¼¼ã¦ã„ã¦ã€ä¾å˜åž‹ dependent type ã‚’æŒã£ã¦ã„る言語ãŒã‚る。ä¾å˜åž‹ã‚’æŒã£ãŸè¨€èªžãªã‚“ã¦ä»–ã«ã‚‚ã‚ã‚‹ã®ã ã‘ã‚Œã©ã‚‚ã€Idris㯠general purpose を謳ã£ã¦ã„る。ã‚ã–ã‚ã–汎用ã£ã¦è¬³ã£ã¦ã„ã‚‹ã‚ãŸã‚Šã€ä¾å˜åž‹ã£ã¦ã®ã¯ã‚‚ã£ã¨è‰²ã€…ã«ä½¿ãˆã‚‹ã‚‚ã®ãªã‚“ã ãžã£ã¦ä¸»å¼µãŒã‚るよã†ã«æ€ã†ã€‚ ãã‚“ãªIdrisãªã‚“ã ã‘ã©ã€æ—¥æœ¬èªžã«ã‚ˆã‚‹æ–‡çŒ®ã¯ã¨ã¦ã‚‚å°‘ãªã„。今ã®ã¨ã“ã‚ã€Idrisã‚’ã‚„ã‚ã†ã£ã¦äººã¯ã¾ãšè‹±èªžã®ãƒãƒ¥ãƒ¼ãƒˆãƒªã‚¢ãƒ«èªã¾ãªãゃã„ã‘ãªã„。僕ã¯Idrisåˆå¿ƒè€…ã§ã¾ã Idrisらã—ã„プãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ãŒã©ã‚“ãªã‚‚ã®ã‹åˆ†ã‹ã‚‰ãªã„ã®ã ã‘ã‚Œã©ã‚‚ã€æ—¥æœ¬èªžã«ã‚ˆã‚‹å¦ç¿’ノートを残ã—ã¦ãŠã“ã†ã¨æ€ã†ã€‚ã‚‚ã—ã‹ã—ãŸã‚‰ãƒ‡ã‚¿ãƒ©ãƒ¡æ›¸ã„ã¦ã‚‹ã‹ã‚‚ã—ã‚Œãªã„ã®ã§ã€ã¯ã¦ãƒ–ã‹Twitter @mandel59ã§æ•™ãˆã¦ä¸‹ã•ã„。 Idris Idris ãƒãƒ¥ãƒ¼ãƒˆãƒªã‚¢ãƒ« (英文) Programming in Id
実世界を扱ã†ä¾å˜åž‹ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã®ãŸã¶ã‚“基本～外界ã‹ã‚‰å®‰å…¨ãªä¸–ç•Œã¾ã§ã®é“ - ã¼ãã®ã¬ã¾ã¡ 出張版
ä¾å˜åž‹ãªã‚‰ã•ã‚‰ã«å®‰å…¨ã«ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã§ãã¡ã¾ã†ã‚“ã ï¼ã¨è¨€ã£ãŸã¨ã“ã‚ã§ï¼Œã€Œç„¡æ–™ã§éŠã¹ã¡ã¾ã†ã‚“ã ï¼ã€ã¨ã‹ã€Œ3000円払ãˆã°ç„¡æ–™ã§10連ã¾ã‚ã›ã‚‹ã€ã¿ãŸã„ãªæ„ŸãŒã‚り， ä¾å˜åž‹ä½¿ã‚ãªã„å ´åˆã¨ã©ã†é•ã£ã¦ãã‚‹ã®ã‹ 入出力ã‹ã‚‰æ‰±ã„始ã‚ã‚‹ã¨ã©ã†ã„ã£ãŸå½¢ã®ãƒ—ãƒã‚°ãƒ©ãƒ ã«ãªã‚‹ã®ã‹ 大概ã©ã†ã„ã†æµã‚Œã§ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã™ã‚‹ã“ã¨ã«ãªã‚‹ã®ã‹ ã¨ã‹ï¼Œãã†ã„ã£ãŸè©±ã‚’通ã—ã§ã¯ãã‚“ãªã«è¦‹ãªã„ã‹ãªãƒ¼ã¨ã„ã†æ°—ãŒã—ãŸã®ã§ï¼Œã”ã基本的ãªã‚‚ã®ã‚’一通りã¾ã¨ã‚ã¦ãŠã“ã†ã¨æ€ã£ã¦ï¼Ž ã¾ãšï¼Œèª¬æ˜Žã«ä½¿ã†å•é¡Œè¨å®šã«ã¤ã„ã¦ï¼Žè¡Œåˆ—演算，特ã«è¡Œåˆ—ç©ã‚’考ãˆã¦ã¿ã‚‹ï¼ŽãŸã ã—，行列ã®å½¢(è¡Œã¯ã„ãã¤ï¼Œåˆ—ã¯ã„ãã¤)ã«ã¤ã„ã¦ã¯ãƒ—ãƒã‚°ãƒ©ãƒ ã®å¤–ã‹ã‚‰å…¥åŠ›ã«ã‚ˆã£ã¦æ±ºå®šã™ã‚‹ã‚ˆã†ãªçŠ¶æ³ã¨ã™ã‚‹ï¼Žã“れ自体ã¯æ™®é€šã®å•é¡Œè¨å®šã ã¨æ€ã‚れる． ä¾å˜åž‹ã‚’使ã‚ãªã‘ã‚Œã°ç‰¹ã«ã©ã†ã¨ã„ã†ã“ã¨ã‚‚ç„¡ã„．æらã行列ã®åž‹ã‚’次ã®ã‚ˆã†ã«å®šç¾©ã—， -- å½¢ã®ã¿æŒã£ã¦ãŠã，ä¸èº«ã®æ•°å€¤ã«ã¤ã„ã¦ã¯ç°¡å˜ã®ãŸã‚çœç•¥ data Ma
Part I: Dependent Types in Haskell - School of Haskell | School of Haskell
In this series, we will see how to write dependently-typed programs and prove their correctness within haskell. At first, let's start with the standard example of Vector to understand how to write the dependently-typed programs in Haskell. The topic of this series is already implemented in type-natural and sized-vector. Feel free to use and read these packages. Vectors - Avoiding Boundary Error us
phase1 · Wiki · Glasgow Haskell Compiler / GHC · GitLab
The Glorious Glasgow Haskell Compiler.
Dependently typed servers in Servant
Suppose we have a webserver that can perform different kinds of operations on different kinds of values. Perhaps it can reverse or capitalize strings, and increment or negate integers: # curl http://localhost:8081/example/reverse elpmaxe # curl http://localhost:8081/example/caps EXAMPLE # curl http://localhost:8081/1234/inc 1235 # curl http://localhost:8081/1234/neg -1234 Moreover, it can echo bac
Designing Dependently-Typed Programming Languages - Lecture 1 - Stephanie Weirich
Oregon Programming Languages Summer School — June 16-28, 2014
Lightweight Static Guarantees
We have identified (more than a decade ago, in fact) a disciplined programming style that uses existing type systems in practical, mature languages (such as OCaml, Scala, Haskell, etc., and to an extent, Java and C++) to statically assure a wide range of safety properties: never dereferencing a null pointer or taking the head of an empty list; always sanitizing user input; using only in-bounds ind
1
リリースã€éšœå®³æƒ…å ±ãªã©ã®ã‚µãƒ¼ãƒ“スã®ãŠçŸ¥ã‚‰ã›
最新ã®äººæ°—エントリーã®é…ä¿¡
j次ã®ãƒ–ックマーク
kå‰ã®ãƒ–ックマーク
lã‚ã¨ã§èªã‚€
eコメント一覧を開ã
oページを開ã
幽霊型ã§ã€Œãƒ•ã‚¡ã‚¤ãƒ«ã‹ã‚‰èªã¿è¾¼ã‚“ã リストã®é•·ã•ã€ã‚’コンパイル時ã«å–り扱ã†
https://www.seas.upenn.edu/~sweirich/papers/fckinds.pdf
{{#tags}}- {{label}}
{{/tags}}