Rubyistã®ãŸã‚ã®åž‹å…¥é–€æµœæ¾Ruby会è°01 http://regional.rubykaigi.org/hamamatsu01/ ã®ç™ºè¡¨è³‡æ–™ã§ã™ã€‚ http://mzp.hatenablog.com/entry/2015/03/29/213909 ã‚‚ã‚ã‚ã›ã¦ã”覧ãã ã•ã„。
What is Gradual Typing: 漸進的型付ã‘ã¨ã¯ä½•ã‹ - Qiita
本稿㯠Python ã«åž‹ã‚¢ãƒŽãƒ†ãƒ¼ã‚·ãƒ§ãƒ³ã‚’è¿½åŠ ã™ã‚‹ã¨ã„ㆠPEP 483 - The Theory of Type Hinting ã®æ案ã§å‚ç…§ã•ã‚Œã¦ã„ã‚‹ Jeremy Siek (@jeremysiek) æ°ã¨ Walid Taha æ°ãŒé–‹ç™ºã—ãŸæ¼¸é€²çš„型付ã‘ã«ã¤ã„ã¦ã®å…¥é–€è¨˜äº‹ã®ç¿»è¨³ã§ã™ã€‚ What is Gradual Typing Python 3.5 ã§å°Žå…¥ã•ã‚ŒãŸåž‹ã‚¢ãƒŽãƒ†ãƒ¼ã‚·ãƒ§ãƒ³ã«ã¤ã„ã¦èˆˆå‘³ãŒã‚ã‚‹æ–¹ã¯ä»¥ä¸‹ã‚’å‚考ã«ã—ã¦ãã ã•ã„。 Python ã¨åž‹ãƒ’ント (Type Hints) 㨠#pyconjp [翻訳] PEP 0484 -- 型ヒント (Type Hints) Revenge of the Types: åž‹ã®å¾©è® ç§è‡ªèº«ã€åž‹ã‚·ã‚¹ãƒ†ãƒ ã«æ˜Žã‚‹ããªã„ãŸã‚ã€ä¸€éƒ¨æœªè¨³ã®éƒ¨åˆ†ãŒã‚ã£ãŸã‚Šã€å‹˜é•ã„や誤訳もã‚ã‚‹ã¨æ€ã„ã¾ã™ã€‚ãã†ã„ã£ãŸèª¤ã‚Šã‚’見ã¤ã‘ãŸã‚‰ç·¨é›†ãƒªã‚¯ã‚¨ã‚¹ãƒˆã‚’é€ã£ã¦ã‚‚らãˆã‚‹ã¨åŠ©ã‹ã‚Šã¾ã™ã€‚
Nim Programming Language
Nim is a statically typed compiled systems programming language. It combines successful concepts from mature languages like Python, Ada and Modula. Efficient Nim generates native dependency-free executables, not dependent on a virtual machine, which are small and allow easy redistribution. The Nim compiler and the generated executables support all major platforms like Windows, Linux, BSD and macOS
Typing Haskell in Haskell
Haskell benefits from one of the most sophisticated type systems of any widely used programming language. Unfortunately, it also suffers because there is no formal specification of what the type system should be. As a result: It is hard for Haskell implementors to be sure that their systems accept the same programs as other implementations. The informal specification in the Haskell report Peyton J
Scala - The Simple Parts, SFScala presentation
Scala - The Simple Parts, SFScala presentationAI-enhanced description Scala has a large and growing user community, with significant adoption and successful deployments, despite some controversies regarding its complexity and academic nature. The language is designed for scalability and growth, allowing for flexible syntax and powerful features, including object-oriented and functional paradigms.
Haskell ã®åž‹ã‚·ã‚¹ãƒ†ãƒ - x76789ã®ç ”究メモ
Haskell/Polymorphism - Wikibooks, open books for an open world 型システムã¯ãã®è¡¨ç¾åŠ›ã«é–¢ã—ã¦ã€rank-1, rank-2, rank-n ã¨ã—ã¦åˆ†é¡žã•ã‚Œã‚‹ã®ã ãã†ã 。一般㫠rank-n type ã¨ã¯ã€å°‘ãªãã¨ã‚‚ã²ã¨ã¤ã®rank-(n-1ã®å¼•æ•°ã‚’æŒã¡ã‹ã¤ãã®ãƒ©ãƒ³ã‚¯ã‚ˆã‚Šé«˜ã„引数ã¯æŒãŸãªã„「函数ã€ã®ã“ã¨ã§ã‚る。 高階型ã®ç†è«–基礎ã¯ã¯System Fã§ã‚ã‚Šã€ã“ã‚Œã¯äºŒéšŽã®ãƒ©ãƒ ダ計算（The second-order lambda calculus）ã¨ã—ã¦ã‚‚知られã¦ã„る。 Haskell98ã¯ã€Hindley-Miler 型システムã«åŸºã¥ã„ã¦ã„る。Hindley-Miler 型システムã¯System Fã®åˆ¶é™ç³»ã§ã‚ã‚Šã€é‡å記å·ï¼ˆForall）ã¨rank-2 types 以上ã®é«˜éšŽåž‹ã¯ã‚µãƒãƒ¼ãƒˆã—ã¦ã„ãªã„。System Fã®ãƒ•ãƒ«ãƒ‘ワーã®
Haskell/Polymorphism - Wikibooks
訳註 ã“ã®ã‚¦ã‚£ã‚ブックスã®ãƒšãƒ¼ã‚¸ã§ã¯ã€Haskellã«ãŠã‘ã‚‹ãƒãƒªãƒ¢ãƒ¼ãƒ•ã‚£ã‚ºãƒ ã«ã¤ã„ã¦èª¬æ˜Žã•ã‚Œã¦ã„ã¾ã™ã€‚ãƒãƒªãƒ¢ãƒ¼ãƒ•ã‚£ã‚ºãƒ ã¯ã€ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°è¨€èªžã«ãŠã„ã¦åŒã˜ã‚³ãƒ¼ãƒ‰ã‚’複数ã®åž‹ã«å¯¾ã—ã¦å†åˆ©ç”¨ã™ã‚‹ãŸã‚ã®æŠ€è¡“ã§ã™ã€‚ Haskellã§ã¯ã€ãƒãƒªãƒ¢ãƒ¼ãƒ•ã‚£ãƒƒã‚¯ãªé–¢æ•°ã‚’定義ã™ã‚‹æ–¹æ³•ãŒã„ãã¤ã‹ã‚ã‚Šã¾ã™ã€‚ジェãƒãƒªãƒƒã‚¯é–¢æ•°ã¯ã€ä»»æ„ã®åž‹ã«å¯¾ã—ã¦æ©Ÿèƒ½ã™ã‚‹é–¢æ•°ã§ã‚ã‚Šã€åž‹å¤‰æ•°ã‚’使用ã—ã¦å®£è¨€ã•ã‚Œã¾ã™ã€‚ã¾ãŸã€åž‹ã‚¯ãƒ©ã‚¹ã¯ã€ç‰¹å®šã®æ“作をサãƒãƒ¼ãƒˆã™ã‚‹åž‹ã®ã‚°ãƒ«ãƒ¼ãƒ—を定義ã™ã‚‹æ–¹æ³•ã§ã™ã€‚ ã“ã®ãƒšãƒ¼ã‚¸ã§ã¯ã€ãƒãƒªãƒ¢ãƒ¼ãƒ•ã‚£ã‚ºãƒ ã®æ¦‚念を詳ã—ã説明ã—ã€Haskellã§ã®ãƒãƒªãƒ¢ãƒ¼ãƒ•ã‚£ã‚ºãƒ ã®å®Ÿè£…ã«ã¤ã„ã¦èª¬æ˜Žã—ã¦ã„ã¾ã™ã€‚ã•ã‚‰ã«ã€Haskellã®åž‹ã‚¯ãƒ©ã‚¹ã‚·ã‚¹ãƒ†ãƒ ã«ã¤ã„ã¦ã‚‚解説ã—ã¦ã„ã¾ã™ã€‚ Section goal = short, enables reader to read code (ParseP) with ∀ and use libraries (S
åž‹ç†è«–　ãªã‚“ã¦è‡ªåˆ†ã«ã¯é–¢ä¿‚ãªã„ã¨æ€ã£ã¦ã„ã‚‹ã‚ãªãŸã¸
This document contains definitions and proofs about natural numbers, functions, and theorems in Coq. It defines natural numbers as inductive types, defines addition as a recursive function, and proves theorems like 1+1=2. It also contains definitions for monads and proofs about monad bind being associative in Coq.
How wonderful to be (statically) typed 〜型ãŒä»˜ãã£ã¦ã‚¹ãƒãƒ©ã‚·ã‚¤ã€œ
PFI社内セミナーã§å¼·åŠ›ãªåž‹ã‚·ã‚¹ãƒ†ãƒ ãŒã‚‚ãŸã‚‰ã™æ§˜ã€…ãªæ©æµã«ã¤ã„ã¦ç™ºè¡¨ã—ãŸéš›ã®è³‡æ–™ã§ã™ã€‚ 補足的ãªè¨˜äº‹ã¯ã“ã¡ã‚‰ã‚’ã©ã†ãžï¼š http://blog.konn-san.com/article/20120412/how-wonderful-to-be-typed ã¾ãŸã€ç™ºè¡¨ã®æ¨¡æ§˜ã¯ä»¥ä¸‹ã® ustream ã‹ã‚‰ã”覧ã«ãªã‚Œã¾ã™ã€‚ http://www.ustream.tv/recorded/21781769
Interpreting Haskell Inside PostgreSQL With Singleton Types
I am currently in the early stages of a new project, plhaskell. plhaskell is a language handler for PostgreSQL that will allow you to write PostgreSQL functions in Haskell. The project has already taught me a lot, but recently I’ve had a somewhat mind bending encounter with what is almost dependently typed programming in Haskell - and I’ve just got to share it with you. Here’s the problem. At runt
Proofs and Types
Based on a short graduate course on typed lambda-calculus given at the Université Paris VII in the autumn term of 1986-7. Published by Cambridge University Press (Cambridge Tracts in Theoretical Computer Science, 7), ISBN 0 521 37181 3; first published 1989, reprinted with corrections 1990. Here is the story of how the translation came about: Jean-Yves had mentioned the notes to Paul at a conferen
リリースã€éšœå®³æƒ…å ±ãªã©ã®ã‚µãƒ¼ãƒ“スã®ãŠçŸ¥ã‚‰ã›
最新ã®äººæ°—エントリーã®é…ä¿¡
j次ã®ãƒ–ックマーク
kå‰ã®ãƒ–ックマーク
lã‚ã¨ã§èªã‚€
eコメント一覧を開ã
oページを開ã
GitHub - ympbyc/Carrot: Purely functional lisp featuring: default currying, left-associative s-expression, lazy evaluation, static type system, and statically determined multimethods.
https://ryoasai.hatenadiary.org/entry/20110329/1301414299
GitHub - mizchi/TypedCoffeeScript: rewrite of the CoffeeScript compiler with proper compiler design principles and a focus on robustness and extensibility
Home - Microsoft Research
Sign in - Google Accounts
https://kwangyulseo.com/2014/02/03/data-typeable-and-data-dynamic-in-haskell/
GitHub - pi8027/lambda-calculus: A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2
GitHub - kmarekspartz/TaPL: Implementations of languages referred to in TaPL
What are type projections useful for?
{{#tags}}- {{label}}
{{/tags}}