標(biāo)題: Titlebook: Generative Programming and Component Engineering; Second International Frank Pfenning,Yannis Smaragdakis Conference proceedings 2003 Spring [打印本頁(yè)] 作者: 棕櫚等 時(shí)間: 2025-3-21 19:21
書(shū)目名稱(chēng)Generative Programming and Component Engineering影響因子(影響力)
書(shū)目名稱(chēng)Generative Programming and Component Engineering影響因子(影響力)學(xué)科排名
書(shū)目名稱(chēng)Generative Programming and Component Engineering網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱(chēng)Generative Programming and Component Engineering網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱(chēng)Generative Programming and Component Engineering被引頻次
書(shū)目名稱(chēng)Generative Programming and Component Engineering被引頻次學(xué)科排名
書(shū)目名稱(chēng)Generative Programming and Component Engineering年度引用
書(shū)目名稱(chēng)Generative Programming and Component Engineering年度引用學(xué)科排名
書(shū)目名稱(chēng)Generative Programming and Component Engineering讀者反饋
書(shū)目名稱(chēng)Generative Programming and Component Engineering讀者反饋學(xué)科排名
作者: investigate 時(shí)間: 2025-3-21 22:22 作者: 睨視 時(shí)間: 2025-3-22 03:28
Concluding Thoughts and Way Forward,ming techniques. The method presented has benefits compared to traditional approaches with respect to documentation and reusability of the program, as well as providing a better separation of the protocol contained in the pattern.作者: MOTIF 時(shí)間: 2025-3-22 05:43 作者: 攝取 時(shí)間: 2025-3-22 10:33 作者: 明智的人 時(shí)間: 2025-3-22 15:24
Making Patterns Explicit with Metaprogrammingming techniques. The method presented has benefits compared to traditional approaches with respect to documentation and reusability of the program, as well as providing a better separation of the protocol contained in the pattern.作者: 明智的人 時(shí)間: 2025-3-22 19:23
Generating Spreadsheet-Like Tools from Strong Attribute Grammars be used to statically guarantee termination of the attribute grammars and to derive efficient implementations. A strong attribute grammar for a spreadsheet is defined and the first incremental results are presented.作者: 不可磨滅 時(shí)間: 2025-3-23 01:17 作者: 跑過(guò) 時(shí)間: 2025-3-23 03:28
Creation Emanation and Salvationtypes, arbitrary but sized user-defined data structures, asynchronous processes, lightweight exception handling, automatic memory management and domain-specific metaprogramming features, whilst seeking to guarantee strong space/time behaviour and maintaining overall determinacy.作者: 格子架 時(shí)間: 2025-3-23 08:09 作者: phase-2-enzyme 時(shí)間: 2025-3-23 11:15 作者: upstart 時(shí)間: 2025-3-23 14:02 作者: 不連貫 時(shí)間: 2025-3-23 20:07
Discovery of the Expanding Universe, to 2 times smaller than equivalent programs written in a GPL such as C..We have implemented a compiler for Spidle. Preliminary results show that compiled Spidle programs are roughly as efficient as the compiled, equivalent C programs.作者: 命令變成大炮 時(shí)間: 2025-3-24 00:48 作者: Benzodiazepines 時(shí)間: 2025-3-24 03:42
https://doi.org/10.1007/978-94-017-5082-0scribe the architecture of the application. Later this architectural information is loaded into the DAOP platform, which needs it to establish the dynamic connections between autonomous components and aspects. Therefore, the use of DAOP-ADL closes the gap between design and implementation of component- and aspect-based applications.作者: climax 時(shí)間: 2025-3-24 09:18
https://doi.org/10.1007/978-3-319-99380-5neration issues within a meta-weaver framework, and a comparison between AODM and AOP. An example of the approach is provided, as well as a description of several future concepts for extending the flexibility within AODM.作者: Cholagogue 時(shí)間: 2025-3-24 14:25 作者: invade 時(shí)間: 2025-3-24 17:59
Spidle: A DSL Approach to Specifying Streaming Applications to 2 times smaller than equivalent programs written in a GPL such as C..We have implemented a compiler for Spidle. Preliminary results show that compiled Spidle programs are roughly as efficient as the compiled, equivalent C programs.作者: 創(chuàng)新 時(shí)間: 2025-3-24 19:29
Staged Notational Definitionsg problem but retains MacroML’s phase distinction. Additionally, SND incorporates the generality of Griffin’s account of notational definitions. We exhibit a formal equational theory for SND and prove its soundness.作者: 拒絕 時(shí)間: 2025-3-25 02:05 作者: DOTE 時(shí)間: 2025-3-25 06:20
An Approach for Supporting Aspect-Oriented Domain Modelingneration issues within a meta-weaver framework, and a comparison between AODM and AOP. An example of the approach is provided, as well as a description of several future concepts for extending the flexibility within AODM.作者: 健忘癥 時(shí)間: 2025-3-25 11:16 作者: pacifist 時(shí)間: 2025-3-25 15:28
Hume: A Domain-Specific Language for Real-Time Embedded Systemstypes, arbitrary but sized user-defined data structures, asynchronous processes, lightweight exception handling, automatic memory management and domain-specific metaprogramming features, whilst seeking to guarantee strong space/time behaviour and maintaining overall determinacy.作者: addict 時(shí)間: 2025-3-25 15:48 作者: Strength 時(shí)間: 2025-3-25 21:26
An Extension to the Subtype Relationship in C++ Implemented with Template Metaprogrammingrk to handle collaborating groups of classes using template metaprogramming based on standard C++ features in the style of .. Our solution provides tailor-made implicit conversion rules between appropriate groups, inclusion polymorphism and a tool for dynamic binding.作者: 噴出 時(shí)間: 2025-3-26 02:49
Concept-Controlled Polymorphismclasses in Haskell. Second, concepts can be used to provide fine-grained control of function and operator overloading. Finally, generic functions can be overloaded (specialized) based on concepts, rather than simply on types. We describe a C++ implementation of a new mechanism, which we call ., and its role in concept-controlled polymorphism.作者: Fester 時(shí)間: 2025-3-26 07:00
Giuseppe Bertola,Daniele Coen Piraniment. Translators written to interface with GME models typically use a domain-independent API. This paper presents a tool called ANEMIC that generates a domain-specific API for GME translators using the same metamodel that generates the language.作者: maladorit 時(shí)間: 2025-3-26 12:11
Robert D. Friedberg,Erica V. Rozmidpowerful, they are comparatively complex and present a high barrier to entry for general users. The distinctive feature of the approach proposed here is instead its simplicity and its reliance on mainstream technology and tools.作者: Monotonous 時(shí)間: 2025-3-26 14:20
ANEMIC: Automatic Interface Enabler for Model Integrated Computingment. Translators written to interface with GME models typically use a domain-independent API. This paper presents a tool called ANEMIC that generates a domain-specific API for GME translators using the same metamodel that generates the language.作者: insolence 時(shí)間: 2025-3-26 20:15 作者: delegate 時(shí)間: 2025-3-26 22:49 作者: 小卷發(fā) 時(shí)間: 2025-3-27 04:27
TDL: A Hardware Description Language for Retargetable Postpass Optimizations and Analysescification of the target processor. . is assembly-oriented and provides a generic modeling of irregular hardware constraints that are typical for many embedded processors. The generic modeling supports graph-based and search-based optimization algorithms. An important design goal of . was to achieve作者: 擴(kuò)音器 時(shí)間: 2025-3-27 07:10
Hume: A Domain-Specific Language for Real-Time Embedded Systemsd systems, such as real-time embedded or control systems. Hume provides a number of high level features including higher-order functions, polymorphic types, arbitrary but sized user-defined data structures, asynchronous processes, lightweight exception handling, automatic memory management and domai作者: pellagra 時(shí)間: 2025-3-27 11:12 作者: 老人病學(xué) 時(shí)間: 2025-3-27 15:25 作者: 改革運(yùn)動(dòng) 時(shí)間: 2025-3-27 17:57
Staged Notational Definitionsguage called MacroML, in which all type checking is carried out before macro expansion. Building on this work, the goal of this paper is to develop a macro language that makes it easy for programmers to reason about terms locally. We show that defining the semantics of macros in this manner helps in作者: ASSET 時(shí)間: 2025-3-28 00:44
A Journey from Interpreters to Compilers and Virtual Machinesof this derivation with a number of existing virtual machines, mostly for functional languages. We then outline its relevance for today’s language development [5]..The work is joint with Mads Sig Ager, Dariusz Biernacki, and Jan Midtgaard [1–4].作者: 修改 時(shí)間: 2025-3-28 04:36 作者: 使絕緣 時(shí)間: 2025-3-28 08:43 作者: 寬敞 時(shí)間: 2025-3-28 13:52 作者: Gum-Disease 時(shí)間: 2025-3-28 16:06 作者: confederacy 時(shí)間: 2025-3-28 19:30 作者: infatuation 時(shí)間: 2025-3-28 23:43 作者: 嘲笑 時(shí)間: 2025-3-29 03:59 作者: 用樹(shù)皮 時(shí)間: 2025-3-29 10:04 作者: GUISE 時(shí)間: 2025-3-29 12:37
Towards a More Piece-ful World pieces may be produced by generation, adaptation of existing pieces, or integration of pieces, and this process of “pieceware” engineering continues–statically or dynamically–until a piece with the desired capabilities and properties is synthesized. The pieces themselves may comprise fragments of r作者: LIMN 時(shí)間: 2025-3-29 17:22
A Generative Approach to Framework Instantiationss is automated in the sense that designers configure and assemble the framework components using intuitive visual operations in a GUI-based environment. Their configuration actions are then used to automatically generate the framework instantiation code. Generative techniques for framework instanti作者: Sarcoma 時(shí)間: 2025-3-29 23:34
Making Patterns Explicit with Metaprogramming of this approach is the lack of an explicit representation of the patterns used in a program, as the collaboration between classes is normally expressed in the code of the class itself..In this paper, we present a method for explicitly representing patterns in a program with the help of metaprogram作者: Chivalrous 時(shí)間: 2025-3-30 00:16
Generating Spreadsheet-Like Tools from Strong Attribute Grammarspecified by strong attribute grammars. In this style of attribute grammar programming every single inductive computation is expressed within the attribute grammar formalism. Well-known attribute grammar techniques are used to reason about such grammars. For example, ordered scheduling algorithms can作者: Keshan-disease 時(shí)間: 2025-3-30 07:27 作者: 刀鋒 時(shí)間: 2025-3-30 09:20
Discovery of the Expanding Universe,g application often involves low-level programming, critical memory management, and finely tuned scheduling of processing steps..To address these problems, we present a domain-specific language (DSL) named ., for specifying streaming applications. Spidle offers high-level and declarative constructs;作者: 明確 時(shí)間: 2025-3-30 13:52
Creation Emanation and Salvationcification of the target processor. . is assembly-oriented and provides a generic modeling of irregular hardware constraints that are typical for many embedded processors. The generic modeling supports graph-based and search-based optimization algorithms. An important design goal of . was to achieve作者: Hectic 時(shí)間: 2025-3-30 19:58
Creation Emanation and Salvationd systems, such as real-time embedded or control systems. Hume provides a number of high level features including higher-order functions, polymorphic types, arbitrary but sized user-defined data structures, asynchronous processes, lightweight exception handling, automatic memory management and domai作者: Subjugate 時(shí)間: 2025-3-30 21:54 作者: CURL 時(shí)間: 2025-3-31 01:21 作者: 壯麗的去 時(shí)間: 2025-3-31 05:16
https://doi.org/10.1007/978-3-031-60207-8guage called MacroML, in which all type checking is carried out before macro expansion. Building on this work, the goal of this paper is to develop a macro language that makes it easy for programmers to reason about terms locally. We show that defining the semantics of macros in this manner helps in作者: mettlesome 時(shí)間: 2025-3-31 10:19 作者: 怪物 時(shí)間: 2025-3-31 13:47 作者: 鞠躬 時(shí)間: 2025-3-31 18:03
Giuseppe Bertola,Daniele Coen Piraniers, programmers are tapping into this power by creating their own languages fitting the particular needs of the domain. Graphical domain-specific modeling languages are even more appealing for non-programmers, since the modeling language constructs are automatically transformed into applications th作者: Ibd810 時(shí)間: 2025-3-31 22:39
https://doi.org/10.1007/978-3-319-99380-5truction of support tools that facilitate the elevation of crosscutting modeling concerns to first-class constructs in a type-system. The key idea is the application of a variant of the OMG Object Constraint Language to models that are stored persistently in XML. With this approach, weavers are gene作者: Irrepressible 時(shí)間: 2025-4-1 04:26 作者: 沙文主義 時(shí)間: 2025-4-1 09:45 作者: 浪費(fèi)時(shí)間 時(shí)間: 2025-4-1 12:58
https://doi.org/10.1007/978-3-030-48694-5 design. However, required subtype relationship between such families cannot be expressed in many programming languages. This paper presents a framework to handle collaborating groups of classes using template metaprogramming based on standard C++ features in the style of .. Our solution provides ta作者: FLIP 時(shí)間: 2025-4-1 16:23
https://doi.org/10.1007/978-1-4302-3429-6or using concepts to control polymorphism in different ways. First, concepts can be used to constrain parametric polymorphism, as exemplified by type classes in Haskell. Second, concepts can be used to provide fine-grained control of function and operator overloading. Finally, generic functions can 作者: 撫慰 時(shí)間: 2025-4-1 18:55
https://doi.org/10.1057/9780230001084ased software development. Since evolution lies at the heart of any software system the DSLs that were built around them must evolve as well. In this paper we identify important issues that cause a DSL implementation to be very rigid in which all phases are tightly coupled and highly dependent upon 作者: START 時(shí)間: 2025-4-2 02:37
Bhabani Shankar Nayak,Philip Powell pieces may be produced by generation, adaptation of existing pieces, or integration of pieces, and this process of “pieceware” engineering continues–statically or dynamically–until a piece with the desired capabilities and properties is synthesized. The pieces themselves may comprise fragments of r
