Domain-Speciï¬c Languages with Scala Cyrille Artho1 , Klaus Havelund2 , Rahul Kumar2 , and Yoriyuki Yamagata1 1 AIST, Amagasaki, Japan 2 Jet Propulsion Laboratory, California Institute of Technology, California, USA Abstract. Domain-Speciï¬c Languages
Domain-Speciï¬c Languages with Scala Cyrille Artho1 , Klaus Havelund2 , Rahul Kumar2 , and Yoriyuki Yamagata1 1 AIST, Amagasaki, Japan 2 Jet Propulsion Laboratory, California Institute of Technology, California, USA Abstract. Domain-Speciï¬c Languages (DSLs) are often classiï¬ed into external and internal DSLs. An external DSL is a stand-alone language with its own parser. An internal DSL is an exte
Martin Fowler's Bliki in Japanese - 言語ワークベンãƒ
以下ã®æ–‡ç« ã¯ã€Martin Fowler ã«ã‚ˆã‚‹ 「Language Workbenches: The Killer-App for Domain Specific Languages?〠ã®æ—¥æœ¬èªžè¨³ã§ã‚る。 ソフトウェア開発ã«ãŠã‘ã‚‹æ–°ã—ã„考ãˆã®å¤šãã¯ã€å®Ÿã¯å¤ã„考ãˆã®æ–°ã—ã„組ã¿åˆã‚ã›æ–¹ã§ã™ã€‚ã“ã®è¨˜äº‹ã§ã¯ã€ãã®æ–°ã—ã„組ã¿åˆã‚ã›æ–¹ã®ã²ã¨ã¤ã€ç§ãŒã€Œè¨€èªžãƒ¯ãƒ¼ã‚¯ãƒ™ãƒ³ãƒ(Language Workbenches)ã€ã¨å‘¼ã‚“ã§ã„るツールã«ã¤ã„ã¦èª¬æ˜Žã—ã¾ã™ã€‚ã“ã‚Œã¯ã€ç¾åœ¨åºƒã¾ã‚Šã¤ã¤ã‚る考ãˆæ–¹ã§ã€ãŸã¨ãˆã°ã€Intentional Softwareã€JetBrainsã®Meta Programming Systemã€Microsoftã®Software Factoriesãªã©ãŒä¾‹ã¨ã—ã¦æŒ™ã’られã¾ã™ã€‚ã“れらã®ãƒ„ールã¯å¤ã„開発スタイルを採用ã—ã¦ãŠã‚Šã€ç§ã¯ã“れを「言語指å‘プãƒã‚°ãƒ©ãƒŸãƒ³ã‚°(language oriente
Typed Tagless-Final Interpretations: Introductory Course
The first course on typed tagless-final embeddings of domain-specific languages has been presented at the Spring School on Generic and Indexed Programming (SSGIP) <http://www.comlab.ox.ac.uk/projects/gip/school.html> at Wadham College, Oxford, UK on 22nd to 26th March 2010. This page collects the notes for the course in the form of the extensively commented Haskell and OCaml code. Lecture Notes In
What is the "Free Monad + Interpreter" pattern?
The actual pattern is actually significantly more general than just data access. It's a lightweight way of creating a domain-specific language that gives you an AST, and then having one or more interpreters to "execute" the AST however you like. The free monad part is just a handy way to get an AST that you can assemble using Haskell's standard monad facilities (like do-notation) without having to
syntactic
The library provides a generic representation of type-indexed abstract syntax trees (or indexed data types in general). It also permits the definition of open syntax trees based on the technique in Data Types à la Carte [1]. This package does not work on GHC version 8.2, but works on many earlier and later versions. (Note that the difference between version 2.x and 3.0 is not that big. The bump to
(Ab)using Compiler Plugins to Improve Embedded DSLs
GETÂ INÂ TOUCHWe take pride in personally connecting with all interested partners, collaborators and potential clients. Please email us with a brief description of how you would like to be connected with Galois and we will do our best to respond within one business day. Embedded DSLs are a bit of a double-edged sword. They have a low start-up cost because you can defer a lot of work to the host lang
Lucid: templating DSL for HTML
I’m not big on custom templating languages, for reasons I’ll write about another time. I prefer EDSLs. I preferred the xhtml package back when that was what everybody used. It looked like this: header << thetitle << "Page title" thediv noHtml ! [theclass "logo"] << "…" thediv noHtml ! [identifier "login"] Pretty line-noisy to read, write and hard to edit in a reasonable manner. Later, blaze-html b
Abstracting shader – introducing the ash Haskell library
A blog about graphics, demoscene, functional programming languages and some other IT materials. Foreword Abstracting what? Shaders are very common units in the world of graphics. Even though we’re used to using them for shading1 purposes, they’re not limited to that. Vulgarisation has ripped off the meaning up and down so much that nowadays, a shader might have nothing related to shading. If you’r
Quasi-quoting DSLs for free
Suppose you are writing a compiler for some programming language or DSL. If you are doing source to source transformations in your compiler, perhaps as part of an optimization pass, you will need to construct and deconstruct bits of abstract syntax. It would be very convenient if we could write that abstract syntax using the syntax of your language. In this blog post we show how you can reuse your
続・Template Haskell入門 -- QuasiQuotes編 - think and error
å…ˆã«ã“ã¡ã‚‰ã‚’ã©ã†ãžã€‚Template Haskell入門 - think and error QuasiQuotesã§ç°¡å˜ãªã‚‚ã®ã‚’作りã¾ã—ょã†ã€‚ ã“ã“ã§ã¯ãƒ’アドã‚ュメントを作ã‚ã†ã¨æ€ã„ã¾ã™ã€‚Haskellã«ã¯ãƒ’アドã‚ュメントãŒãªã„ã§ã™ã‹ã‚‰ã€‚ å‚考: ã“ã‚“ã•ã‚“ã®ã‚ã‚Œ:準クォートã§ã‚‚ã¦ã‹ã‚ゆるãµã‚メタプãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ï¼ - ã¯ã¦ãªä½¿ã£ãŸã‚‰è² ã‘ã ã¨æ€ã£ã¦ã„ã‚‹ deriving Haskell - haskell TemplateHaskellã®ã‚ã‚Œ å‰æ: GHC7.2.1 ãã‚‚ãã‚‚TemplateHaskellã§ä½•ãŒå‡ºæ¥ã‚‹ã®ã‹ 「既知ã®æƒ…å ±ã€ã¨ã€Œãƒ«ãƒ¼ãƒ«ã€ã‚’ã‚‚ã¨ã«Haskellã®ã‚³ãƒ¼ãƒ‰ã‚’生æˆã™ã‚‹ã‚ã‘ã§ã™ã。 Haskellã®ã‚³ãƒ¼ãƒ‰ã§ç›´æŽ¥å®Ÿç¾å‡ºæ¥ãªã„ã“ã¨ã‚„ã€ä¼¼ãŸã‚ˆã†ãªã‚³ãƒ¼ãƒ‰ã‚’大é‡ã«æ›¸ããŸã„時ãªã©ä¾¿åˆ©ãã†ã§ã™ã€‚ 例ãˆã°å¯å¤‰å¼•æ•°é–¢æ•°(QuasiQuotesã®ä¾‹ã¨ã—ã¦printfãŒæŒ™ã’られã¦ã„ã¾ã™ã)ã‚„ã€
ã¯ã¦ãªã‚°ãƒ«ãƒ¼ãƒ—ã®çµ‚了日を2020å¹´1月31æ—¥(金)ã«æ±ºå®šã—ã¾ã—㟠- ã¯ã¦ãªã®å‘ŠçŸ¥
ã¯ã¦ãªã‚°ãƒ«ãƒ¼ãƒ—ã®çµ‚了日を2020å¹´1月31æ—¥(金)ã«æ±ºå®šã—ã¾ã—㟠以下ã®ã‚¨ãƒ³ãƒˆãƒªã®é€šã‚Šã€ä»Šå¹´æœ«ã‚’目処ã«ã¯ã¦ãªã‚°ãƒ«ãƒ¼ãƒ—を終了予定ã§ã‚る旨をãŠçŸ¥ã‚‰ã›ã—ã¦ãŠã‚Šã¾ã—ãŸã€‚ 2019年末を目処ã«ã€ã¯ã¦ãªã‚°ãƒ«ãƒ¼ãƒ—ã®æ供を終了ã™ã‚‹äºˆå®šã§ã™ - ã¯ã¦ãªã‚°ãƒ«ãƒ¼ãƒ—日記 ã“ã®ãŸã³ã€æ£å¼ã«çµ‚了日を決定ã„ãŸã—ã¾ã—ãŸã®ã§ã€ä»¥ä¸‹ã®é€šã‚Šã”確èªãã ã•ã„。 終了日: 2020å¹´1月31æ—¥(金) エクスãƒãƒ¼ãƒˆå¸Œæœ›ç”³è«‹æœŸé™:2020å¹´1月31æ—¥(金) 終了日以é™ã¯ã€ã¯ã¦ãªã‚°ãƒ«ãƒ¼ãƒ—ã®é–²è¦§ãŠã‚ˆã³æŠ•ç¨¿ã¯è¡Œãˆã¾ã›ã‚“。日記ã®ã‚¨ã‚¯ã‚¹ãƒãƒ¼ãƒˆãŒå¿…è¦ãªæ–¹ã¯ä»¥ä¸‹ã®è¨˜äº‹ã«ã—ãŸãŒã£ã¦æ‰‹ç¶šãã‚’ã—ã¦ãã ã•ã„。 ã¯ã¦ãªã‚°ãƒ«ãƒ¼ãƒ—ã«æŠ•ç¨¿ã•ã‚ŒãŸæ—¥è¨˜ãƒ‡ãƒ¼ã‚¿ã®ã‚¨ã‚¯ã‚¹ãƒãƒ¼ãƒˆã«ã¤ã„㦠- ã¯ã¦ãªã‚°ãƒ«ãƒ¼ãƒ—日記 ã”利用ã®ã¿ãªã•ã¾ã«ã¯ã”迷惑をãŠã‹ã‘ã„ãŸã—ã¾ã™ãŒã€ã©ã†ãžã‚ˆã‚ã—ããŠé¡˜ã„ã„ãŸã—ã¾ã™ã€‚ 2020-06-25 追記 ã¯ã¦ãªã‚°ãƒ«ãƒ¼ãƒ—日記ã®ã‚¨ã‚¯ã‚¹ãƒãƒ¼ãƒˆãƒ‡ãƒ¼ã‚¿ã¯2020å¹´2月28
shell-conduit: Write shell scripts in Haskell with Conduit
shell-conduit: Write shell scripts in Haskell with Conduit As part of my series of write-about-personal-projects, my latest obsession is writing shell scripts with Michael Snoyman’s Conduit. Here is my package, shell-conduit. It’s still in the experimental phase, but I don’t forsee any changes now for a while. Bash is evil I hate writing scripts in Bash. Until now, it was the easiest way to just w
型クラス㧠tagless DSL メタプãƒã‚°ãƒ©ãƒŸãƒ³ã‚° - keigoiã®æ—¥è¨˜
ã“れ㯠Haskell Advent Calendar 2011 ã®5日目ã®è¨˜äº‹ã§ã™ã€‚ 去年も書ãã¾ã—ãŸãŒã€ãã®è¨˜äº‹ã¯ã“ã¡ã‚‰ → Haskell厨を6å¹´ã‚„ã£ã¦ã‚‹ä¿ºãŒOCamlを仕事ã§2ヶ月使ã£ã¦ã¿ãŸ - keigoiã®æ—¥è¨˜ 先日ã®è¨˜äº‹ Haskell＋タグレスãªåž‹ä»˜ãDSLã§æ¥½ã€…ï¼Cè¨€èªžã‚³ãƒ¼ãƒ‰ç”Ÿæˆ - keigoiã®æ—¥è¨˜ ã‚’ã¡ã‚‡ã£ã¨ãƒ–ラッシュアップã—ãŸã€‚å‰å›žã¯ã‚³ãƒ¼ãƒ‰ã«ã¤ã„ã¦ã¯å…¨ã説明ã—ãªã‹ã£ãŸã®ã§ã€æ”¹ã‚ã¦è§£èª¬ã™ã‚‹ã€‚ ãŠã•ã‚‰ã„ Haskellã‚„OCamlãªã©ã®é–¢æ•°åž‹è¨€èªžã¯ã€ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°è¨€èªžã®å‡¦ç† ― 構文解æžã¨ã‚³ãƒ¼ãƒ‰ç”Ÿæˆ ― ãŒã¨ã¦ã‚‚å¾—æ„ã 。 大手ã®ã‚½ãƒ•ãƒˆã‚¦ã‚§ã‚¢ä¼æ¥ã¨ã—ã¦çŸ¥ã‚‰ã‚Œã‚‹ NTTデータも既å˜ã‚³ãƒ¼ãƒ‰ã®å‡¦ç† (構文解æžã€œãƒªãƒãƒ¼ã‚¹ã‚¨ãƒ³ã‚¸ãƒ‹ã‚¢ãƒªãƒ³ã‚°) ã®ãŸã‚ã« Haskell を使ã£ã¦ã„ã‚‹ãã†ã 。 (函数プãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã®é›†ã„2011より。インドã«å¤–注ã™ã‚‹éƒ¨åˆ†ã‚‚ã‚ã‚‹ãㆠtogetter 1
miniKanren.org
Twitter: @miniKanren    Github: @miniKanren    Google Group: miniKanren    IRC: irc://irc.libera.chat/minikanren Follow @miniKanren Workshop | Book | Online Course | Implementations | Projects | Upcoming Talks | Talks | Interviews | Tutorials | Theses | Papers | Screencasts | Weekly Hangouts | Podcasts | Blogs | Contact What is miniKanren? miniKanren is a family of Domain Specific Languages for lo
1
リリースã€éšœå®³æƒ…å ±ãªã©ã®ã‚µãƒ¼ãƒ“スã®ãŠçŸ¥ã‚‰ã›
最新ã®äººæ°—エントリーã®é…ä¿¡
j次ã®ãƒ–ックマーク
kå‰ã®ãƒ–ックマーク
lã‚ã¨ã§èªã‚€
eコメント一覧を開ã
oページを開ã
Monads for Free!
http://www.cse.chalmers.se/~emax/documents/axelsson2012generic-slides.pdf
http://www.cse.chalmers.se/~emax/documents/svenningsson2013combining.pdf
{{#tags}}- {{label}}
{{/tags}}