Solving the TTC 2013 Flowgraphs Case with FunnyQT
FunnyQT is a model querying and model transformation library for the functional Lisp-dialect Clojure providing a rich and efficient querying and transformation API. This paper describes the FunnyQT solution to the TTC 2013 Flowgraphs Transformation Case. It solves all four tasks, and it has won the...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Open Publishing Association
2013-11-01
|
| Series: | Electronic Proceedings in Theoretical Computer Science |
| Online Access: | http://arxiv.org/pdf/1312.0347v1 |
| _version_ | 1818853965601701888 |
|---|---|
| author | Tassilo Horn |
| author_facet | Tassilo Horn |
| author_sort | Tassilo Horn |
| collection | DOAJ |
| description | FunnyQT is a model querying and model transformation library for the functional Lisp-dialect Clojure providing a rich and efficient querying and transformation API. This paper describes the FunnyQT solution to the TTC 2013 Flowgraphs Transformation Case. It solves all four tasks, and it has won the best efficiency award for this case. |
| first_indexed | 2024-12-19T07:45:12Z |
| format | Article |
| id | doaj.art-063e01089fcd4134b61df2ad4869c544 |
| institution | Directory Open Access Journal |
| issn | 2075-2180 |
| language | English |
| last_indexed | 2024-12-19T07:45:12Z |
| publishDate | 2013-11-01 |
| publisher | Open Publishing Association |
| record_format | Article |
| series | Electronic Proceedings in Theoretical Computer Science |
| spelling | doaj.art-063e01089fcd4134b61df2ad4869c5442022-12-21T20:30:21ZengOpen Publishing AssociationElectronic Proceedings in Theoretical Computer Science2075-21802013-11-01135Proc. TTC 2013576810.4204/EPTCS.135.7Solving the TTC 2013 Flowgraphs Case with FunnyQTTassilo HornFunnyQT is a model querying and model transformation library for the functional Lisp-dialect Clojure providing a rich and efficient querying and transformation API. This paper describes the FunnyQT solution to the TTC 2013 Flowgraphs Transformation Case. It solves all four tasks, and it has won the best efficiency award for this case.http://arxiv.org/pdf/1312.0347v1 |
| spellingShingle | Tassilo Horn Solving the TTC 2013 Flowgraphs Case with FunnyQT Electronic Proceedings in Theoretical Computer Science |
| title | Solving the TTC 2013 Flowgraphs Case with FunnyQT |
| title_full | Solving the TTC 2013 Flowgraphs Case with FunnyQT |
| title_fullStr | Solving the TTC 2013 Flowgraphs Case with FunnyQT |
| title_full_unstemmed | Solving the TTC 2013 Flowgraphs Case with FunnyQT |
| title_short | Solving the TTC 2013 Flowgraphs Case with FunnyQT |
| title_sort | solving the ttc 2013 flowgraphs case with funnyqt |
| url | http://arxiv.org/pdf/1312.0347v1 |
| work_keys_str_mv | AT tassilohorn solvingthettc2013flowgraphscasewithfunnyqt |