检索结果-内蒙古大学图书馆

Making design patterns explicit in FACE: A framework adaptive composition environment 6th

6th European Software Engineering conference Held Jointly with 5th acm SIGSOFT Symposium on the Foundations of Software Engineering, ESEC/FSE 1997

作者： Meijler, Theo Dirk Demeyer, Serge Engel, Robert Baan Labs Groot Zonneoord PO Box 250 EdeNL-6710 BG Netherlands Software Composition Group University of Berne Neubrückstrasse 10 BerneCH-3012 Switzerland Washington University Computer Science Department Campus Box 1045 St. LouisMO63130 United States

ISBN: (纸本)3540635319

Tools incorporating design patterns combine the advantage of having a high-abstraction level of describing a system and the possibility of coupling these abstractions to some underlying implementation. Still, all current tools are based on generating source code in which the design patterns become implicit. After that, further extension and adaptation of the software is needed but this can no longer be supported at the same level of abstraction. This paper presents FACE, an environment based on an explicit representation of design patterns, sustaining an incremental development style without abandoning the higher-level design pattern abstraction. A visual composition tool for FACE has been developed in the Self programming language. © Springer-Verlag Berlin Heidelberg 1997.

关键词： Visual languages

来源：评论

学校读者我要写书评

暂无评论

The Smalltalk-76 programming system design and implementation 78

The Smalltalk-76 programming system design and implementatio...

引用

Proceedings of the 5th acm SIGACT-sigplan symposium on Principles of programming languages

作者： Daniel H. H. Ingalls XEROX Palo Alto Research Center Palo Alto California

ISBN: (纸本)9781450373487

This paper describes a programming system based on the metaphor of communicating objects. Experience with a running system shows that this model provides flexibility, modularity and compactness. A compiled representation for the language is presented, along with an interpreter suitable for microcoding. The object-oriented model provides naturally efficient addressing; a corresponding virtual memory is described which offers dense utilization of resident space.

关键词：

来源：评论

学校读者我要写书评

暂无评论

The design of a class mechanism for Moby 99

The design of a class mechanism for Moby

引用

Proceedings of the acm sigplan 1999 conference on programming language design and implementation

作者： Kathleen Fisher John Reppy AT&T Labs Research Bell Labs Lucent Technologies

ISBN: (纸本)9781581130942

Typical class-based languages, such as C++ and JAVA, provide complex class mechanisms but only weak module systems. In fact, classes in these languages incorporate many of the features found in richer module mechanisms. In this paper, we describe an alternative approach to designing a language that has both classes and modules. In our design, we rely on a rich ML-style module system to provide features such as visibility control and parameterization, while providing a minimal class mechanism that includes only those features needed to support inheritance. Programmers can then use the combination of modules and classes to implement the full range of class-based features and idioms. Our approach has the advantage that it provides a full-featured module system (useful in its own right), while keeping the class mechanism quite *** have incorporated this design in MOBY, which is an ML-style language that supports class-based object-oriented programming. In this paper, we describe our design via a series of simple examples, show how various class-based features and idioms are realized in MOBY, compare our design with others, and sketch its formal semantics.

关键词：

来源：评论

学校读者我要写书评

暂无评论

GCspy: An adaptable heap visualisation framework

引用

acm sigplan NOTICES 2002年第11期37卷 343-358页

作者： Printezis, T Jones, R Univ Glasgow Dept Comp Sci Glasgow G12 8RZ Lanark Scotland Univ Kent Comp Lab Canterbury CT2 7NF Kent England

GCspy is an architectural framework for the collection, transmission, storage and replay of memory management behaviour. It makes new contributions to the understanding of the dynamic memory behaviour of programming languages (and especially object-oriented languages that make heavy demands on the performance of memory managers). GCspy's architecture allows easy incorporation into any memory management system: it is not limited to garbage-collected languages. It requires only small changes to the system in which it is incorporated but provides a simple to use yet powerful data-gathering API. GCspy scales to allow very large heaps to be visualised effectively and efficiently. It allows already-running, local or remote systems to be visualised and those systems to run at full speed outside the points at which data is gathered. GCspy's visualisation tool presents this information in a number of novel ways. Deep understanding of program behaviour is essential to the design of the next generation of garbage collectors and explicit allocators. Until now, no satisfactory tools have been available to assist the implementer in gaining an understanding of heap behaviour. GCspy has been demonstrated to be a practical solution to this dilemma. It has been used to analyse production Java virtual machines running applications of realistic sizes. Its use has revealed important insights into the interaction between application program and JVM and has led to the development of better garbage collectors.

关键词： algorithms measurement performance languages human factors language implementation memory management garbage collection visualisation of objects Java

来源：评论

学校读者我要写书评

暂无评论

Pluggable AOP: designing aspect mechanisms for third-party composition 05

Pluggable AOP: designing aspect mechanisms for third-party c...

引用

Proceedings of the 20th annual acm sigplan conference on Object-oriented programming, systems, languages, and applications

作者： Sergei Kojarski David H. Lorenz University of Virginia Charlottesville VA

ISBN: (纸本)9781595930316

Studies of Aspect-Oriented programming (AOP) usually focus on a language in which a specific aspect extension is integrated with a base language. languages specified in this manner have a fixed, non-extensible AOP functionality. This paper argues the need for AOP to support the integration and use of multiple domain-specific aspect extensions together. We study the more general case of integrating a base language with a set of third-party aspect extensions for that language. We present a general mixin-based semantic framework for implementing dynamic aspect extensions in such a way that multiple, independently developed aspect mechanisms can be subject to third-party composition and work collaboratively. Principles governing the design of a collaborative aspect mechanism are aspectual effect exposure and implementation hiding.

关键词： aspectual effect aspect mechanism COOL domain-specific aspect language collaboration AOP reuse AspectJ AOP semantics third-party composition mixin aspect extension software components CBSE AOSD AspectWerkz

来源：评论

学校读者我要写书评

暂无评论

Mechanizing the meta-theory of programming languages 05

Mechanizing the meta-theory of programming languages

引用

Proceedings of the tenth acm sigplan international conference on Functional programming

作者： Robert Harper Carnegie Mellon University Pittsburgh PA

ISBN: (纸本)9781595930644

What does it mean for a programming language to exist? Usually languages are defined by an informal description augmented by a reference compiler whose behavior is regarded as normative. This approach works well so long as the one true implementation suffices, but as soon as we wish to have multiple compilers for the same language, we must agree on what the language is independently of its implementations. Most often this is accomplished through social processes such as standardization committees for building *** processes have served us well, and will continue to be important for language design. But they are not sufficient to support the level of rigor required to prove theorems about languages and programs written in them. For that we need a semantics, which provides an objective foundation for such analyses, typically in the form of a type system and an operational semantics. But merely having such a rigorous definition for a language is not enough — it must be validated by a body of meta-theory that establishes its coherence and its consistency with *** how are we to develop and maintain this body of theory? For full-scale languages the task is so onerous as to inhibit innovation and foster stagnation. The way forward is to take advantage of the recent advances in mechanized reasoning. By representing a language definition within a logical framework we may subject it to formal analysis, much as we use types to express and enforce crucial invariants in our programs. I will describe our use of the Twelf implementation of the LF logical framework, and discuss our successes and difficulties in using it as a tool for mechanizing the meta-theory of programming languages.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Improved Type Specialization for Dynamic Scripting languages

引用

acm sigplan NOTICES 2014年第2期49卷 37-48页

作者： Kedlaya, Madhukar N. Roesch, Jared Robatmili, Behnam Reshadi, Mehrdad Hardekopf, Ben Univ Calif Santa Barbara Santa Barbara CA 93106 USA Qualcomm Res Silicon Valley Santa Barbara CA USA

Type feedback and type inference are two common methods used to optimize dynamic languages such as JavaScript. Each of these methods has its own strengths and weaknesses, and we propose that each can benefit from the other if combined in the right way. We explore the interdependency between these two methods and propose two novel ways to combine them in order to significantly increase their aggregate benefit and decrease their aggregate overhead. In our proposed strategy, an initial type inference pass is applied that can reduce type feedback overhead by enabling more intelligent placement of profiling hooks. This initial type inference pass is novel in the literature. After profiling, a final type inference pass uses the type information from profiling to generate efficient code. While this second pass is not novel, we significantly improve its effectiveness in a novel way by feeding the type inference pass information about the function signature, i.e., the types of the function's arguments for a specific function invocation. Our results show significant speedups when using these low-overhead strategies, ranging from 1.2 x to 4 x over an implementation that does not perform type feedback or type inference based optimizations. Our experiments are carried out across a wide range of traditional benchmarks and realistic web applications. The results also show an average reduction of 23.5% in the size of the profiled data for these benchmarks.

关键词： JavaScript type specialization type inference profiling language implementation

来源：评论

学校读者我要写书评

暂无评论

BIGMAC II: A FORTRAN language augmentation tool 4

BIGMAC II: A FORTRAN language augmentation tool

引用

4th International Workshop on Real-Time Ada Issues, IRTAW 1990

作者： Myers, Eugene W. Osterweil, Leon J. Department of Computer Science University of Colorado BoulderCO80309 United States

ISBN: (纸本)0897911466

This paper describes the motivation, design, implementation, and some preliminary performance characteristics of BIGMAC II, a macro definition capability for creating language enhancers and translators. BIGMAC II enables the user to specify transformations through STREX, a FORTRAN-like language, which enables the specification of macros which are then used to interpretively alter incoming programs. BIGMAC II is specially adapted to the processing of FORTRAN programs. This paper shows how it can be used as a deprocedurizer (or flattener), a dialect-to-dialect translator, a portability and version control aid, and a device for creating language enhancements as sophisticated as new control structures and abstract data types. © 1981 IEEE Computer Society. All rights reserved.

关键词： FORTRAN (programming language)

来源：评论

学校读者我要写书评

暂无评论

Behind Every Great Deep Learning Framework Is an Even Greater programming languages Concept (Keynote) 2018

Behind Every Great Deep Learning Framework Is an Even Greate...

引用

26th acm Joint Meeting on European Software Engineering conference (ESEC) / Symposium on the Foundations of Software Engineering (FSE)

作者： Meijer, Erik Delft Univ Technol Software Engn Res Grp Cloud Programming Delft Netherlands Facebook Infra Struct Org Menlo Pk CA 94025 USA

ISBN: (纸本)9781450355735

In many areas, such as image recognition, natural language processing, search, recommendation, autonomous cars, systems software and infrastructure, and even Software Engineering tools themselves, Software 2.0 (= programming using learned models) is quickly swallowing Software 1.0 (= programming using handcrafted algorithms). Where the Software 1.0 Engineer formally specifies their problem, carefully designs algorithms, composes systems out of subsystems or decomposes complex systems into smaller components, the Software 2.0 Engineer amasses training data and simply feeds it into an ML algorithm that will synthesize an approximation of the function whose partial extensional definition is that training data. Instead of code as the artifact of interest, in Software 2.0 it is all about the data where compilation of source code is replaced by training models with data. This new style of programming has far-reaching consequences for traditional software engineering practices. Everything we have learned about life cycle models, project planning and estimation, requirements analysis, program design, construction, debugging, testing, maintenance and implementation, ... runs the danger of becoming obsolete. One way to try to prepare for the new realities of software engineering is not to zero in on the differences between Software 1.0 and Software 2.0 but instead focus on their similarities. If you carefully look at what a neural net actually represents, you realize that in essence it is a pure function, from multi-dimensional arrays of floating point numbers to multi-dimensional arrays of floating point numbers (tensors). What is special about these functions is that they are differentiable (yes, exactly as you remember from middle school calculus), which allows them to be trained using back propagation. The programming language community has also discovered that there is a deep connection between back propagation and continuations. Moreover, when you look closely at how So

关键词： Machine Learning programming languages Functional programming Automatic Differentiation Differentiable programming Deep Learning Continuation Passing Style

来源：评论

学校读者我要写书评

暂无评论

Fast parallel implementation of lazy languages—the EQUALS experience 92

Fast parallel implementation of lazy languages—the EQUALS e...

引用

Proceedings of the 1992 acm conference on LISP and functional programming

作者： O. Kaser S. Pawagi C. R. Ramakrishnan I. V. Ramakrishnan R. C. Sekar

ISBN: (纸本)9780897914819

This paper describes EQUALS, a fast parallel implementation of a lazy functional language on a commercially available shared-memory parallel machine, the Sequent Symmetry. In contrast to previous implementations, we detect parallelism automatically by propagating exhaustive (normal form) demand. Another important difference between EQUALS and previous implementations is the use of reference counting for memory management instead of garbage collection. Our implementation shows that reference counting leads to very good scalability, low memory requirements and improved locality. We compare our results with sequntial SML/NJ as well as parallel (v, G-machine and GAML implementations.

关键词：

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：