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

conference Record of the Annual acm Symposium on Principles of programming languages 1999年 214-227页

作者： Xi, Hongwei Pfenning, Frank Oregon Graduate Inst of Science and Technology Beaverton OR United States

We present an approach to enriching the type system of ML with a restricted form of dependent types, where type index objects are drawn from a constraint domain C, leading to the DML(C) language schema. This allows specification and inference of significantly more precise type information, facilitating program error detection and compiler optimization. A major complication resulting from introducing dependent types is that pure type inference for the enriched system is no longer possible, but we show that type-checking a sufficiently annotated program in DML(C) can be reduced to constraint satisfaction in the constraint domain C. We exhibit the unobtrusiveness of our approach through practical examples and prove that DML(C) is conservative over ML. The main contribution of the paper lies in our language design, including the formulation of type-checking rules which makes the approach practical. To our knowledge, no previous type system for a general purpose programming language such as ML has combined dependent types with features including datatype declarations, higher-order functions, general recursions, let-polymorphism, mutable references, and exceptions. In addition, we have finished a prototype implementation of DML(C) for an integer constraint domain C, where constraints are linear inequalities (Xi and Pfenning 1998).

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Dependent types in practical programming 99

Dependent types in practical programming

引用

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

作者： Xi, Hongwei Pfenning, Frank Oregon Graduate Inst of Science and Technology Beaverton OR United States

ISBN: (纸本)9781581130959

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Improvement in a lazy context: An operational theory for call-by-need

Conference Record of the Annual ACM Symposium on Principles ...

引用

conference Record of the Annual acm Symposium on Principles of programming languages 1999年 43-56页

作者： Moran, Andrew Sands, David Univ of Goteborg Goteborg Sweden

The standard implementation technique for lazy functional languages is call-by-need, which ensures that an argument to a function in any given call is evaluated at most once. A significant problem with call-by-need is that it is difficult - even for compiler writers - to predict the effects of program transformations. The traditional theories for lazy functional languages are based on call-by-name models, and offer no help in determining which transformations do indeed optimize a program. In this article we present an operational theory for call-by-need, based upon an improvement ordering on programs: M is improved by N if in all program-contexts C, when C[M] terminates then C[N] terminates at least as cheaply. We show that this improvement relation satisfies a `context lemma', and supports a rich inequational theory, subsuming the call-by-need lambda calculi of Ariola et al. [AFM+95]. The reduction-based call-by-need calculi are inadequate as a theory of lazy-program transformation since they only permit transformations which speed up programs by at most a constant factor (a claim we substantiate); we go beyond the various reduction-based calculi for call-by-need by providing powerful proof rules for recursion, including syntactic continuity - the basis of fixed-point-induction style reasoning, and an improvement theorem, suitable for arguing the correctness and safety of recursion-based program transformations.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Hancock: A language for processing very large-scale data 99

Hancock: A language for processing very large-scale data

引用

2nd conference on Domain-Specific languages (DSL 99)

作者： Bonachea, D Fisher, K Rogers, A Smith, F AT&T Labs Res Shannon Lab Florham Park NJ 07932 USA

ISBN: (纸本)1880446278

A signature is an evolving customer profile computed from call records. AT&T uses signatures to detect fraud and to target marketing. Code to compute signatures can be difficult to write and maintain because of the volume of data. We have designed and implemented Hancock, a C-based domain-specific programming language for describing signatures. Hancock provides data abstraction mechanisms to manage the volume of data and control abstractions to facilitate looping over records. This paper describes the design and implementation of Hancock, discusses early experiences with the language, and describes our design process.

关键词： Abstracting

来源：评论

学校读者我要写书评

暂无评论

A truly implementation independent GUI development tool

A truly implementation independent GUI development tool

引用

1999 Annual acm SIGAda International conference on Ada, SIGAda 1999

作者： Carlisle, Martin C. Department of Computer Science US Air Force Academy 2354 Fairchild Dr CO80840-6234 United States

ISBN: (纸本)1581131275

Ovre the last few years, graphical user interface programming has become increasingly prevalent. Many libraries and languages have been developed to simplify this task. Additionally, design tools have been created that allow the programmer to "draw" their desired interface and then have code automatically generated. Unfortunately, use of these tools locks the programmer into a particular implementation. Even if the tool targets a multi-platform library (e.g. Tcl/Tk or JVM), the flexibility of the result is constrained. We present a truly implementation and platform independent solution. RAPID generates Ada code targeted to an object-oriented set of graphical user interface specifications with absolutely no implementation dependent information. The pattern used to derive these specifications is an improvement over the "Abstract Factory" Pattern, as it allows both the specification and implementation to take advantage of inheritance. The user can then select an implementation (for example, Tcl/Tk or JVM) at compile time. RAPID itself is also written using the same specifications;therefore it requires no modification to target a new implementation or to use a new implementation itself. RAPID is currently being used to design the user interface for a satellite ground station. © 1999 acm.

关键词： Graphical user interfaces

来源：评论

学校读者我要写书评

暂无评论

DSL implementation using staging and monads 99

DSL implementation using staging and monads

引用

2nd conference on Domain-Specific languages, DSL 1999

作者： Sheard, Tim Benaissa, Zine-El-Abidine Pasalic, Emir Pacific Software Research Center Oregon Graduate Institute P.O. Box 91000 PortlandON97291-1000 United States

ISBN: (纸本)1581132557

The impact of Domain Specific languages (DSLs) on software design is considerable. They allow programs to be more concise than equivalent programs written in a high-level programming languages. They relieve programmers from making decisions about data-structure and algorithm design, and thus allows solutions to be constructed quickly. Because DSL's are at a higher level of abstraction they are easier to maintain and reason about than equivalent programs written in a high-level language, and perhaps most importantly they can be written by domain experts rather than programmers. The problem is that DSL implementation is costly and prone to errors, and that high level approaches to DSL implementation often produce inefficient systems. By using two new programming language mechanisms, program staging and monadic abstraction, we can lower the cost of DSL implementations by allowing reuse at many levels. These mechanisms provide the expressive power that allows the construction of many compiler components as reusable libraries, provide a direct link between the semantics and the low-level implementation, and provide the structure necessary to reason about the implementation.

关键词： Software design

来源：评论

学校读者我要写书评

暂无评论

A collaboration specification language 99

A collaboration specification language

引用

2nd conference on Domain-Specific languages, DSL 1999

作者： Li, Du Muntz, Richard R. Department of Computer Science University of California Los Angeles Los AngelesCA90024 United States

ISBN: (纸本)1581132557

COCA (Collaborative Objects Coordination Architecture) was proposed as a novel means to model and support collaborations over the Internet. Our approach separates coordination policies from user interfaces and the policies are specified in a logic-based language. Over the past year, both the collaboration model and the specification language have been substantially refined and evaluated through our experience in building real-life collaboration systems. This paper presents the design of the specification language and illustrates the main ideas with a few simple design examples. Semantics, implementation, runtime support, and applications are also covered but not as the focus of this paper.

关键词： Specification languages

来源：评论

学校读者我要写书评

暂无评论

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

Proceedings of the 1998 Annual ACM SIGPLAN Conference on Pro...

引用

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

The proceedings contains 31 papers from the 1998 acm sigplan 1998 conference on programming language design and implementation (PLDI). Topics discussed include: scalar register promotions;sparse partial redundancy eliminations;data transformations;array languages;array access patterns;data-flow analysis;inclusion constraint graphs;flow-insensitive pointer analysis;type-based alias analysis;floating-point resources;branch reordering;linear-scan register allocation;asynchronous distributed garbage collection;generational stack collection;profile-driven pretenuring;data-parallel program analysis;Cilk-5 multithreaded language;run-time code generations;and Java virtual machines (JVM).

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Compressing Java class files

Proceedings of the ACM SIGPLAN Conference on Programming Lan...

引用

Proceedings of the acm sigplan conference on programming language design and implementation (PLDI) 1999年 247-258页

作者： Pugh, William Univ of Maryland College Park MD United States

Java class files are often distributed as jar files, which are collections of individually compressed class files (and possibility other files). Jar files are typically about 1/2 the size of the original class files due to compression. I have developed a wire-code format for collections of Java class files. This format is typically 1/2 to 1/5 of the size of the corresponding compressed jar file (1/4 to 1/10 the size of the original class files).

关键词： Java programming language

来源：评论

学校读者我要写书评

暂无评论

Semantics for imprecise exceptions

Proceedings of the ACM SIGPLAN Conference on Programming Lan...

引用

Proceedings of the acm sigplan conference on programming language design and implementation (PLDI) 1999年 25-36页

作者： Jones, Simon Peyton Reid, Alastair Hoare, Tony Marlow, Simon Henderson, Fergus Microsoft Research Ltd Cambridge United States

Some modern superscalar microprocessors provide only imprecise exceptions. That is, they do not guarantee to report the same exception that would be encountered by a straightforward sequential execution of the program. In exchange, they offer increased performance or decreased chip area (which amount to much the same thing). This performance/precision tradeoff has not so far been much explored at the programming language level. In this paper we propose a design for imprecise exceptions in the lazy functional programming language Haskell. We discuss several designs, and conclude that imprecision is essential if the language is still to enjoy its current rich algebra of transformations. We sketch a precise semantics for the language extended with exceptions. The paper shows how to extend Haskell with exceptions without crippling the language or its compilers. We do not yet have enough experience of using the new mechanism to know whether it strikes an appropriate balance between expressiveness and performance.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：