Simon Gay's Bibliography on Quantum Programming Languages
This bibliography was originally compiled in association with my article Quantum Programming Languages: Survey and Bibliography (Mathematical Structures in Computer Science 16(4), 2006). Its original topic was quantum programming languages, but this has widened to include semantics of quantum computation and structural approaches to quantum computing. The complete bibliography as a BibTeX file is
Fable · JavaScript you can be proud of!
Fable is a compiler that brings F# into the JavaScript ecosystem Functional programming and more Immutable by default. Powerful pattern matching. Lightweight syntax. Units of measure. Type providers. Enjoy. Type safety without the hassle Type inference provides robustness and correctness, but without the cost of additional code. Let the compiler catch bugs for you.
Lecture Notes in Computing Model
〒101-8430 æ±äº¬éƒ½ åƒä»£ç”°åŒº 一ツ橋 2-1-2 å›½ç«‹æƒ…å ±å¦ç ”究所 副所長 / æƒ…å ±ç¤¾ä¼šç›¸é–¢ç ”ç©¶ç³» 教授 ä½è—¤ä¸€éƒŽ
Researchers in Programming Languages and Compilers
Below are links to home pages of researchers working on programming language theory, design, implementation, and related areas. Disclaimer: this list is not exhaustive! Please let me know if you would like to be added to this list, or if you would like an existing entry modified or deleted. Back to the language research page Related Pages The SEL-HPC list of home pages of functional language resea
Closure Conversion as CoYoneda
2017-08-28 :: Yoneda, coYoneda, category theory, compilers, closure conversion, math By: Max New The continuation-passing style transform (cps) and closure conversion (cc) are two techniques widely employed by compilers for functional languages, and have been studied extensively in the compiler correctness literature. Interestingly, typed versions of each can be proven to be equivalence preserving
25日目: 自作コンパイラã€è‡ªä½œã‚¨ãƒŸãƒ¥ã€è‡ªä½œCPUã®çµåˆ - ã—ã‹ãã„ã•ã‚“ã‹ã
ã“ã®è¨˜äº‹ã¯ã²ã¨ã‚Šã§CPUã¨ã‚¨ãƒŸãƒ¥ãƒ¬ãƒ¼ã‚¿ã¨ã‚³ãƒ³ãƒ‘イラを作る Advent Calendar 2017ã®25日目ã®è¨˜äº‹ã§ã™ã€‚ ã„よã„よ最終日。 ã¾ãšå¾©ç¿’ã‚’å…¼ãã¦ã€ä»Šã¾ã§ã®è¨˜äº‹ã‚’振り返りãªãŒã‚‰ã€C言語ã‹ã‚‰åŠå°Žä½“ã¾ã§CPUã®ä¸ã‚’æ©ã。 最後ã«è‡ªä½œã‚³ãƒ³ãƒ‘イラã€è‡ªä½œã‚¨ãƒŸãƒ¥ãƒ¬ãƒ¼ã‚¿ã€è‡ªä½œCPUã‚’çµåˆã—ã€å†å¸°é–¢æ•°ã§ãƒ•ã‚£ãƒœãƒŠãƒƒãƒæ•°ã‚’計算ã™ã‚‹ã€‚ 25日間ã®å¾©ç¿’ アドベントカレンダー㮠åˆæ—¥ã®è¨˜äº‹ 㫠「普段目ã«ã™ã‚‹æŠ½è±¡çš„ãªãƒ—ãƒã‚°ãƒ©ãƒ コードã‹ã‚‰ã€CPU内ã®é›»åœ§å¤‰å‹•ãŒæƒ³åƒã§ãるよã†ã«ãªã‚ŠãŸã„。〠ã¨æ›¸ã„ãŸã®ã§ã€ä»Šã¾ã§ã®è¨˜äº‹ã‚’見返ã—ã¤ã¤ã€C言語ã‹ã‚‰åŠå°Žä½“ã¾ã§ãƒ¬ã‚¤ãƒ¤ãƒ¼ã‚’é™ã‚Šã¦ã¿ã‚‹ã€‚ C言語ã‹ã‚‰ã‚¢ã‚»ãƒ³ãƒ–ラã¾ã§ (18日目-24日目) C言語ã®ã‚µãƒ³ãƒ—ルコード int main () { int a ; a = 3 ; return 0 ; } ã“れを1週間ã‹ã‘ã¦ã‚¢ã‚»ãƒ³ãƒ–ラã«å¤‰æ›ã—ãŸã€‚ 作ã£ãŸã‚³ãƒ³ãƒ‘イラã®ãƒªãƒã‚¸ãƒˆãƒªã¯ã“れ。
A Lambda Calculus for Quantum Computation
View PDF Abstract: The classical lambda calculus may be regarded both as a programming language and as a formal algebraic system for reasoning about computation. It provides a computational model equivalent to the Turing machine, and continues to be of enormous benefit in the classical theory of computation. We propose that quantum computation, like its classical counterpart, may benefit from a ve
qlambdabook.dvi
1 Quantum Lambda Calculus Peter Selinger Dalhousie University, Canada Benoı̂t Valiron INRIA and EÌcole Polytechnique, LIX, Palaiseau, France. Abstract We discuss the design of a typed lambda calculus for quantum compu- tation. After a brief discussion of the role of higher-order functions in quantum information theory, we define the quantum lambda calculus and its operational semantics. Safety inv
CPU実験：マルãƒã‚³ã‚¢ã§ä¸¦åˆ—実行ã™ã‚‹ã¾ã§ï¼ˆã‚³ãƒ³ãƒ‘イラ係目線） - eguchishi
CPU実験ãŒçµ‚ã‚ã£ã¦åŠå¹´ã§ã™ãŒã€å¿˜ã‚Œã‚‹å‰ã«ã‚„ã£ãŸã“ã¨ã‚’書ã残ã—ã¦ãŠã“ã†ã¨æ€ã„ã¾ã™ã€‚ 並列化ーー CPU実験 全体 4人程ã®ãƒãƒ¼ãƒ ã§ã€è‡ªä½œCPUã€ã‚³ãƒ³ãƒ‘イラã€ã‚¢ã‚»ãƒ³ãƒ–ラã€ã‚·ãƒ¥ãƒŸãƒ¬ãƒ¼ã‚¿ç‰ã‚’作りã€æœ€çµ‚çš„ã«ã¯é«˜ç´šè¨€èªž(mincamlã¨ã„ã†Ocamlã®ã‚µãƒ–セット)ã§æ›¸ã‹ã‚ŒãŸãƒ—ãƒã‚°ãƒ©ãƒ （レイトレーシング）を実行速度を競ã„ã¾ã™ã€‚CPU実験ã®è©³ç´°ã¯æ¤œç´¢ã™ã‚‹ã¨çµæ§‹å‡ºã¦ãã‚‹ã‹ã¨æ€ã„ã¾ã™ã€‚ レイトレプãƒã‚°ãƒ©ãƒ ã®å‡ºåŠ›çµæžœ 自çã®æœ€çµ‚æˆæžœ 『レイトレプãƒã‚°ãƒ©ãƒ をマルãƒã‚³ã‚¢ã§ä¸¦åˆ—実行ã™ã‚‹ã€ã¨ã„ã†ã“ã¨ã‚’ã‚„ã‚Šã¾ã—ãŸã€‚çµè«–ã‹ã‚‰è¨€ã†ã¨ã“ã‚ŒãŒã‹ãªã‚Šä¸Šæ‰‹ã„ã“ã¨ã„ã£ã¦ã€æ´ä»£æœ€é€Ÿè¨˜éŒ²ã‚’大幅ã«(1/2ä½ï¼Ÿï¼‰æ›´æ–°ã™ã‚‹ã“ã¨ãŒã§ãã¾ã—ãŸã€‚ 具体的ã«ã¯è¨˜éŒ²ã¯ä»¥ä¸‹ã®é€šã‚Šã§ã™ã€‚詳ã—ãã¯*1 4.666948 s(7コアã€é€æ¬¡å®Ÿè¡Œã¨æ¯”ã¹æ¼”ç®—é †åºãŒå¤‰ã‚り得る） 5.193502 s（6コアã€æ¼”ç®—é †åºãŒå¤‰ã‚らãªã„） ＊実験ã®æ¡ä»¶ã‚‚年々良ããªã£ã¦ã„ã‚‹ã®ã§
PLT by steshaw
Programming Language Theory Learning about Programming Language Theory can be a tough journey, particularly for programming practitioners who haven’t studied it formally. This resource is here to help. Please feel free to get in touch if you have ideas for improvement. 💡 Top Tips For a quick course in Type Theory, Philip Wadler recommends: Types and Programming Languages, Proofs and Types, follow
LLVMを始ã‚よã†ï¼ 〜 LLVM IRã®åŸºç¤Žã¯clangãŒæ•™ãˆã¦ãã‚ŒãŸãƒ»Brainf**kコンパイラを作ã£ã¦ã¿ã‚ˆã† 〜 - プãƒã‚°ãƒ©ãƒ モグモグ
コンパイラを作ã£ã¦ã¿ãŸã„ã¨æ€ã£ã¦ã„ã¦ã‚‚ã€ã‚¢ã‚»ãƒ³ãƒ–リ言語ã¯ã‚ˆãã‚ã‹ã‚‰ãªã„。 パーサーã¿ãŸã„ãªã‚³ãƒ¼ãƒ‰ã¯æ›¸ã„ãŸã“ã¨ãŒã‚ã‚‹ã‘ã‚Œã©ã€ã‚³ãƒ¼ãƒ‰ç”Ÿæˆã®å‡¦ç†ã¯ã•ã£ã±ã‚Šã 。 実行ファイルをãƒã‚¤ãƒŠãƒªã‚¨ãƒ‡ã‚£ã‚¿ãƒ¼ã§è¦‹ã‚‹ã¨ã‹ãªã«ãれ怖ã„。 ãã‚“ãªç§ãªã®ã§ã™ãŒã€LLVMã«èˆˆå‘³ã‚’æŒã¡å§‹ã‚ã¦ã„ã¾ã™ã€‚ Swiftã‚„Rustã€ã‚ã‚‹ã„ã¯Emscriptenãªã©ã€è¿‘年注目ã•ã‚Œã¦ã„る言語やコンパイラ技術ã®ä¸æž¢ã«ã¯LLVMãŒã‚ã‚Šã¾ã™ã€‚ アセンブリã¯ã‚ˆã分ã‹ã‚‰ãªãã¦ã‚‚LLVMを使ã„ã“ãªã›ã‚‹ã‚ˆã†ã«ãªã‚Œã°ã€ãƒžãƒ«ãƒãƒ—ラットフォームã§å®Ÿè¡Œãƒ•ã‚¡ã‚¤ãƒ«ã‚’生æˆã§ãる言語処ç†ç³»ã‚’作るã®ã§ã¯ãªã„ã‹ã€‚ コンパイラ作ã£ã¦ã¿ãŸã„ãªã€LLVMを使ã£ã¦ã¿ã‚ˆã†ã‹ãªã¨æ€ã£ã¦ã„る今日ã“ã®ã”ã‚ã§ã™ã€‚ ã¨ã“ã‚ãŒã€ã„ã–LLVMを勉強ã—よã†ã¨æ€ã£ã¦ã‚‚ã©ã“ã‹ã‚‰å§‹ã‚ã‚Œã°ã„ã„ã‹ã‚ˆã分ã‹ã‚Šã¾ã›ã‚“ã§ã—ãŸã€‚ マニュアルã¯å·¨å¤§ã§èªã‚€æ°—ãŒèµ·ããªã„ã—ã€ãƒªãƒ•ã‚¡ãƒ¬ãƒ³ã‚¹ã‚’見ã¦ã‚‚ã•ã£ã±ã‚Šã§ã™ã€‚ 雰囲気ã¯ã‚
combine: マクãƒã®ã„らãªã„Rustã®ãƒ‘ーサーコンビãƒãƒ¼ã‚¿ãƒ¼ - ç°¡æ½”ãªQ
ã¯ã˜ã‚ã« Rustã«ã¯æœ‰åãªnomã¨ã„ã†ãƒ‘ーサーコンビãƒãƒ¼ã‚¿ãƒ¼ãƒ©ã‚¤ãƒ–ラリãŒã‚ã‚‹ãŒã€ã›ã£ã‹ã高級ãªåž‹ã‚·ã‚¹ãƒ†ãƒ ã¨æœ€é©åŒ–ãŒã‚ã‚‹ã®ã«ãƒžã‚¯ãƒã§ä½•ã¨ã‹ã—よã†ã¨ã™ã‚‹ã®ã¯å‹¿ä½“ç„¡ã„ã¨æ€ã†ã®ã§ã€ãƒžã‚¯ãƒã«æ·±ãä¾å˜ã—ãªã„combineを使ã£ã¦ã¿ãŸã€‚ combineã®ä¸»ãªç‰¹å¾´ parsec リスペクトã®ãƒ‘ーサーコンビãƒãƒ¼ã‚¿ãƒ¼ コンビãƒãƒ¼ã‚¿ãƒ¼ã¯ãƒžã‚¯ãƒã§ã¯ãªã〠Parser traitを実装ã™ã‚‹å€¤ã§è¡¨ã™ ãƒã‚¤ãƒˆã‚¹ãƒˆãƒªãƒ¼ãƒ ã€æ–‡å—(Unicodeコードãƒã‚¤ãƒ³ãƒˆ)ストリームã€ãƒˆãƒ¼ã‚¯ãƒ³ã‚¹ãƒˆãƒªãƒ¼ãƒ ã®å…¨ã¦ã«å¯¾å¿œ メモリ上ã®æ–‡å—列ã ã‘ã§ã¯ãªãã€å…¥åŠ›ã‚¹ãƒˆãƒªãƒ¼ãƒ ã‹ã‚‰ã®ç›´æŽ¥ã®ãƒ‘ースã«ã‚‚対応 ã¾ã 計測ã¯ã—ã¦ã„ãªã„ãŒã€ Box を多用ã—ã¦ã„ãŸã‚Šã¯ã—ãªã„ã®ã§ã€é€Ÿåº¦çš„ã«å¤§ããé…れをã¨ã‚‹ã‚ˆã†ãªã“ã¨ã¯ãªã„ã®ã§ã¯ãªã„ã‹ã¨æ€ã†ã€‚ 以下ã€parsecã«ã¤ã„ã¦çŸ¥ã£ã¦ã„ãŸã»ã†ãŒèªã¿ã‚„ã™ã„構æˆã«ãªã£ã¦ã„ã‚‹ã®ã§ã€å¿…è¦ãªã‚‰parsecã®è³‡æ–™ã‚’探ã—ã¦èªã‚€ã¨ã„ã„ã‹ã‚‚ã—
1
ランã‚ング
ランã‚ング
ランã‚ング
リリースã€éšœå®³æƒ…å ±ãªã©ã®ã‚µãƒ¼ãƒ“スã®ãŠçŸ¥ã‚‰ã›
最新ã®äººæ°—エントリーã®é…ä¿¡
j次ã®ãƒ–ックマーク
kå‰ã®ãƒ–ックマーク
lã‚ã¨ã§èªã‚€
eコメント一覧を開ã
oページを開ã
Department of Computer Science
[quant-ph/0507171] An Introduction to Cartan's KAK Decomposition for QC Programmers
力扣 (LeetCode) å…¨çƒæžå®¢æŒšçˆ±çš„技术æˆé•¿å¹³å°
https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.887.3091&rep=rep1&type=pdf
A lambda calculus for quantum computation | Hacker News
Quantum Programming Language | Quantiki
https://www.cis.upenn.edu/~jpaykin/papers/pz_linearity_monad_2017.pdf
{{#tags}}- {{label}}
{{/tags}}