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

acm International conference on Systems, programming, languages, and Applications: Software for Humanity, SPLASH'11

作者： Kuramitsu, Kimio JST/CREST/DEOS Project Yokohama National University Japan

ISBN: (纸本)9781450309424

This demonstration presents the language design of Konoha-Script, a statically typed object-oriented scripting language. KonohaScript provides the very similar scripting experiences compared to dynamic languages. In addition, it also preserves useful programming supports by static typing, such as automated verification of careless mistakes, improved readability of source code, better opportunity of optimized code generation. This demonstration will show how KonohaScript improved scripting experiences with static typing, using our open source implementation fully written in C.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Randomized implementation of multiple functional arrays

Randomized implementation of multiple functional arrays

引用

proceedings of the 1994 acm conference on LISP and Functional programming

作者： Chuang, Tyng-Ruey Chalmers Univ of Technology Goteborg Sweden

ISBN: (纸本)0897916433

The array update problem in the implementation of a purely functional language is the following: once an array is updated, both the original array and the newly updated one must be preserved to maintain referential transparency. Previous approaches have mainly based on the detection or enforcement of single-threaded accesses to an aggregate, by means of compiler-time analyses or language restrictions. These approaches cannot deal with aggregates which are updated in a multi-threaded manner. Baker's shallow binding scheme can be used to implement multi-threaded functional arrays. His scheme, however, can be very expensive if there are repeated alternations between long binding paths. We design a scheme that fragments binding paths randomly. The randomization scheme is on-line, simple to implement, and its expected performance comparable to that of the optimal off-line solutions. All this is achieved without using compiler-time analyses, and without restricting the languages. The expected performance of the randomization scheme is analyzed in details, and some preliminary results are shown. Applications of the randomization technique to other functional aggregates, as well as its implications, are briefly outlined.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

A comparative study of language support for generic programming

A comparative study of language support for generic programm...

引用

18th Annual conference on Object-Oriented programming, Systems, languages and Applications (OOPSLA 2003)

作者： Garcia, R Järvi, J Lumsdaine, A Siek, J Willcock, J Indiana Univ Open Syst Lab Bloomington IN 47401 USA

Many modem programming languages support basic generic programming, sufficient to implement type-safe polymorphic containers. Some languages have moved beyond this basic support to a broader, more powerful interpretation of generic programming, and their extensions have proven valuable in practice. This paper reports on a comprehensive comparison of generics in six programming languages: C++, Standard NIL, Haskell, Eiffel, Java (with its proposed generics extension), and Generic C#. By implementing a substantial example in each of these languages, we identify eight language features that support this broader view of generic programming. We find these features are necessary to avoid awkward designs, poor maintainability, unnecessary run-time checks, and painfully verbose code. As languages increasingly support generics, it is important that language designers understand the features necessary to provide powerful generics and that their absence causes serious difficulties for programmers.

关键词： languages design standardization generics generic programming polymorphism C plus Standard ML Haskell Eiffel Java C#

来源：评论

学校读者我要写书评

暂无评论

SPLASH'12 - proceedings of the 2012 acm conference on Systems, programming, and Applications: Software for Humanity

SPLASH'12 - Proceedings of the 2012 ACM Conference on System...

引用

2012 3rd acm conference on Systems, programming, and Applications: Software for Humanity, SPLASH 2012

ISBN: (纸本)9781450315630

The proceedings contain 57 papers. The topics discussed include: the storyteller version control system: tackling version control, code comments, and team learning;the ALIA4J approach to efficient language implementation;Citisense: mobile air quality sensing for individuals and communities;analyzing ultra-large-scale code corpus with Boa;OpenRefactory/C: an infrastructure for developing program transformations for C programs;SCuV: a novel software clustering and visualization tool;generic adaptable test cases for software product line testing;using software quality standards to assure the quality of the mobile software product;developing a new computer music programming language in the 'research through design' context;automated behavioral testing of refactoring engines;software tools research: a matter of scale and scope - or commoditization?;and programming language abstractions for self-reconfigurable robots.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Once upon a polymorphic type 99

Once upon a polymorphic type

引用

The 1999 26th Annual acm sigplan-SIGACT Symposium on Principles of programming language, POPL'99

作者： Wansbrough, Keith Jones, Simon Peyton Univ of Cambridge Cambridge United Kingdom

ISBN: (纸本)9781581130959

We present a sound type-based `usage analysis' for a realistic lazy functional language. Accurate information on the usage of program subexpressions in a lazy functional language permits a compiler to perform a number of useful optimizations. However, existing analyses are either ad-hoc and approximate, or defined over restricted languages. Our work extends the Once Upon A Type system of Turner, Mossin, and Wadler (FPCA'95). Firstly, we add type polymorphism, an essential feature of typed functional programming languages. Secondly, we include general Haskell-style user-defined algebraic data types. Thirdly, we explain and solve the `poisoning problem', which causes the earlier analysis to yield poor results. Interesting design choices turn up in each of these areas. Our analysis is sound with respect to a Launchbury-style operational semantics, and it is straightforward to implement. Good results have been obtained from a prototype implementation, and we are currently integrating the system into the Glasgow Haskell Compiler.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

PL4XGL: A programming language Approach to Explainable Graph Learning

引用

proceedings OF THE acm ON programming languageS-PacmPL 2024年第PLDI期8卷 2148-2173页

作者： Jeon, Minseok Park, Jihyeok Oh, Hakjoo Korea Univ Dept Comp Sci & Engn Seoul South Korea

In this article, we present a new, language-based approach to explainable graph learning. Though graph neural networks (GNNs) have shown impressive performance in various graph learning tasks, they have severe limitations in explainability, hindering their use in decision-critical applications. To address these limitations, several GNN explanation techniques have been proposed using a post-hoc explanation approach providing subgraphs as explanations for classification results. Unfortunately, however, they have two fundamental drawbacks in terms of 1) additional explanation costs and 2) the correctness of the explanations. This paper aims to address these problems by developing a new graph-learning method based on programming language techniques. Our key idea is two-fold: 1) designing a graph description language (GDL) to explain the classification results and 2) developing a new GDL-based interpretable classification model instead of GNN-based models. Our graph-learning model, called PL4XGL, consists of a set of candidate GDL programs with labels and quality scores. For a given graph component, it searches the best GDL program describing the component and provides the corresponding label as the classification result and the program as the explanation. In our approach, learning from data is formulated as a program-synthesis problem, and we present top-down and bottom-up algorithms for synthesizing GDL programs from training data. Evaluation using widely-used datasets demonstrates that PL4XGL produces high-quality explanations that outperform those produced by the state-of-the-art GNN explanation technique, SUBGRAPHX. We also show that PL4XGL achieves competitive classification accuracy comparable to popular GNN models.

关键词： Graph Learning Domain-Specific language Program Synthesis

来源：评论

学校读者我要写书评

暂无评论

Exploiting implicit parallelism in dynamic array programming languages 1

Exploiting implicit parallelism in dynamic array programming...

引用

1st acm sigplan International Workshop on Libraries, languages and Compilers for Array programming, ARRAY 2014 - Part of PLDI 2014

作者： Imam, Shams Sarkar, Vivek Leibs, David Kessler, Peter B. Rice University United States Oracle Labs United States

ISBN: (纸本)9781450329378

We have built an interpreter for the array programming language J. The interpreter exploits implicit data parallelism in the language to achieve good parallel speedups on a variety of benchmark applications. Many array programming languages operate on entire arrays without the need to write loops. Writing without loops simplifies the programs. Array programs without loops allow an interpreter to parallelize the execution of the code without complex analysis or input from the programmer. The J programming language includes the usual idioms of operations on arrays of the same size and shape, where the operations can often be performed in parallel for each individual item of the operands. Another opportunity comes from Js reduction operations, where suitable operations can be performed in parallel for all the items of an operand. J has a notion of verb rank, which allows programmers to simplify programs by declaring how operations are applied to operands. The verb rank mechanism allows us to extract further parallelism. Our implementation of an implicitly parallelizing interpreter for J is written entirely in Java. We have written the interpreter in a framework that produces native code for the interpreter, giving good scalar performance. The interpreter itself is responsible for exploiting the parallelism available in the applications. Our results show we attain good parallel speed-up on a variety of benchmarks, including near perfect linear speed-up on inherently parallel benchmarks. We believe that the lessons learned from our approach to exploiting data parallelism in an interpreter can be applied to other interpreted languages as we. Copyright © 2014 acm 978-1-4503-2937-8/14/06. 15.00.

关键词： Program interpreters

来源：评论

学校读者我要写书评

暂无评论

The smalitalk-76 programming system design and implementation 5

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

引用

5th acm SIGACT-sigplan Symposium on Principles of programming languages, POPL 1978

作者： Ingalls, Daniel H. H. XEROX Palo Alto Research Center Palo AltoCA United States

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. © 1986 acm.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

A generational on-the-fly garbage collector for Java

A generational on-the-fly garbage collector for Java

引用

acm sigplan' 00 conference on programming language design and implementation (PLDI)

作者： Domani, T Kolodner, EK Petrank, E Technion Israel Inst Technol Dept Comp Sci IL-32000 Haifa Israel

An on-the-fly garbage collector does not stop the program threads to perform the collection. Instead, the collector executes in a separate thread (or process) in parallel to the program. On-the-fly collectors are useful for multi-threaded applications running on multiprocessor servers, where it is important to fully utilize all processors and provide even response time, especially for systems for which stopping the threads is a costly operation. In this work, we report on the incorporation of generations into an on-the-fly garbage collector. The incorporation is non-trivial since an on-the-fly collector avoids explicit synchronization with the program threads. To the best of our knowledge, such an incorporation has not been tried before. We have implemented the collector for a prototype Java Virtual Machine on AIX, and measured its performance on a 4-way multiprocessor. As for other generational collectors, an on-the-fly generational collector has the potential for reducing the overall running time and working set of an application by concentrating collection efforts on the young objects. However, in contrast to other generational collectors, on-the-fly collectors do not move the objects;thus, there is no segregation between the old and the young objects. Furthermore, on-the-fly collectors do not stop the threads, so there is no extra benefit for the short pauses obtained by generational collection. Nevertheless, comparing our on-the-fly collector with and without generations, it turns out that the generational collector performs better for most applications. The best reduction in overall running time for the benchmarks we measured was 25%. However, there were some benchmarks for which it had no effect and one for which the overall running time increased by 4%.

关键词： programming languages memory management garbage collection generational garbage collection

来源：评论

学校读者我要写书评

暂无评论

Garbage collection and local variable type-precision and liveness in JavaTM virtual machines

Garbage collection and local variable type-precision and liv...

引用

proceedings of the 1998 Annual acm sigplan conference on programming language design and implementation, PLDI

作者： Agesen, Ole Detlefs, David Moss, J.Eliot B. Sun Microsystems Lab Chelmsford United States

Full precision in garbage collection implies retaining only those heap allocated objects that will actually be used in the future. Since full precision is not computable in general, garbage collectors use safe (i.e., conservative) approximations such as reachability from a set of root references. Ambiguous roots collectors (commonly called `conservative') can be overly conservative because they overestimate the root set, and thereby retain unexpectedly large amounts of garbage. We consider two more precise collection schemes for Java virtual machines (JVMs). One uses a type analysis to obtain a type-precise root set (only those variables that contain references);the other adds a live variable analysis to reduce the root set to only the live reference variables. Even with the Java programming language's strong typing, it turns out that the JVM specification has a feature that makes type-precise root sets difficult to compute. We explain the problem and ways in which it can be solved. Our experimental results include measurements of the costs of the type and liveness analyses at load time, of the incremental benefits at run time of the liveness analysis over the type analysis alone, and of various map sizes and counts. We find that the liveness analysis often produces little or no improvement in heap size, sometimes modest improvements, and occasionally the improvement is dramatic. While further study is in order, we conclude that the main benefit of the liveness analysis is preventing bad surprises.

关键词： Java programming language

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：