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

INTERNATIONAL JOURNAL OF COMPUTER & INFORMATION SCIENCES 1975年第2期4卷 105-132页

作者： HOARE, CAR QUEENS UNIV BELFAST DEPT COMP SCIBELFAST BT7 1NNNORTH IRELAND

The power and convenience of a programming language may be enhanced for certain applications by permitting treelike data structures to be defined by recursion. This paper suggests a pleasing notation by which such structures can be declared and processed; it gives the axioms which specify their properties, and suggests an efficient implementation method. It shows how a recursive data structure may be used to represent another data type, for example, a set. It then discusses two ways in which significant gains in efficiency can be made by selective updating of structures, and gives the relevant proof rules and hints for implementation. The examples show that a certain range of applications in symbol manipulation can be efficiently programmed without introducing the low-level concept of a reference into a high-level programming language.

关键词： axiomatic proof rules data representation Data structures dynamic storage allocation pointers (abolition of) programming language design programming language features programming language implementation recursive data structures references (abolition of) symbol manipulation

来源：评论

学校读者我要写书评

暂无评论

COMPUTING WITH IMPURE NUMBERS - AUTOMATIC CONSISTENCY CHECKING AND UNITS CONVERSION USING COMPUTER ALGEBRA

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1977年第6期3卷 478-480页

作者： STOUTEMYER, DR UNIV HAWAII DEPT ELECT ENGNHONOLULUHI 96822

The computer algebra language MACSYMA enables the programmer to include symbolic physical units in computer calculations, and features automatic detection of dimensionally-inhomogeneous formulas and conversion of inco... 详细信息

关键词： Units Conversion Dimensional Homogeneity MACSYMA programming language design Symbolic Algebraic Manipulation Units Consistency

来源：评论

学校读者我要写书评

暂无评论

Types and Semantics for Extensible Data Types 21st

Types and Semantics for Extensible Data Types

引用

21st Asian Symposium on programming languages and Systems (APLAS)

作者： van der Rest, Cas Poulsen, Casper Bach Delft Univ Technol Delft Netherlands

ISBN: (纸本)9789819983100;9789819983117

Developing and maintaining software commonly requires (1) adding new data type constructors to existing applications, but also (2) adding new functions that work on existing data. Most programming languages have native support for defining data types and functions in a way that supports either (1) or (2), but not both. This lack of native support makes it difficult to use and extend libraries. A theoretically well-studied solution is to define data types and functions using initial algebra semantics. While it is possible to encode this solution in existing programming languages, such encodings add syntactic and interpretive overhead, and commonly fail to take advantage of the map and fold fusion laws of initial algebras which compilers could exploit to generate more efficient code. A solution to these is to provide native support for initial algebra semantics. In this paper, we develop such a solution and present a type discipline and core calculus for a language with native support for initial algebra semantics.

关键词： Type systems Modularity programming language design Categorical Semantics

来源：评论

学校读者我要写书评

暂无评论

Automatic Parallelization of Programs via Software Stream Rewriting 36

Automatic Parallelization of Programs via Software Stream Re...

引用

36th IEEE International Parallel and Distributed Processing Symposium (IEEE IPDPS)

作者： Tao, Tao Plaisted, David Univ N Carolina Dept Comp Sci Chapel Hill NC 27515 USA

ISBN: (纸本)9781665497473

We introduce a system for automatically parallelizing programs using a parallel-by-default language based on stream rewriting. Our method is general and supports all programs that can be written in a typical high-level, imperative language. The technique is fine-grained and fully automatic. It requires no programmer annotation, static analysis, runtime profiling, or cutoff schemes. The only assumption is that all function arguments in the input program can be executed in parallel. This does not affect the generality of our system since the programmers can write sequential parts in continuation-passing style. Experiments show that the runtime can scale computation-bound programs up to 16 cores without performance degradation. Future works remain to improve key aspects of the runtime and further increase the system's performance.

关键词： automatic parallelization programming language design load balancing multithreading

来源：评论

学校读者我要写书评

暂无评论

Extending PL/I for structured programming

引用

Computer languages 1975年第1期1卷 29-43页

作者： Sullivan, Joseph E. The Mitre Corporation Bedford MA 01730 United States

General principles of structured programming, and practical aspects of applying those principles within the programming language PL/I, are discussed. Suitable extensions (and contractions) of that language are suggest... 详细信息

关键词： Error handling GOTO-free coding Hierarchial design Interrupts Level of abstraction PL/I Program comprehension programming language design Structured programming

来源：评论

学校读者我要写书评

暂无评论

language Support for Generic programming in Object-Oriented languages: Peculiarities, Drawbacks, Ways of Improvement 1

引用

20th Brazilian Symposium on Programing languages (SBLP)

作者： Belyakova, Julia Southern Fed Univ II Vorovich Inst Math Mech & Comp Sci Rostov Na Donu Russia

ISBN: (数字)9783319452791

ISBN: (纸本)9783319452791;9783319452784

Earlier comparative studies of language support for generic programming (GP) have shown that mainstream object-oriented (OO) languages such as C# and Java provide weaker support for GP as compared with functional languages such as Haskell or SML. But many new object-oriented languages have appeared in recent years. Have they improved the support for generic programming? And if not, is there a reason why OO languages yield to functional ones in this respect? In this paper we analyse language constructs for GP in seven modern object-oriented languages. We demonstrate that all of these languages follow the same approach to constraining type parameters, which has a number of inevitable problems. However, those problems are successfully lifted with the use of the another approach. Several language extensions that adopt this approach and allow to improve GP in OO languages are considered. We analyse the dependencies between different language features, discuss the features' support using both approaches, and propose which approach is more expressive.

关键词： Generic programming Object-oriented languages programming language design Type parameters Constraints Interfaces Concepts Type classes Concept pattern Multi-type constraints Multiple models C# Java Scala Ceylon Kotlin Rust Swift Haskell

来源：评论

学校读者我要写书评

暂无评论

Simple objects for standard ML 96

Simple objects for standard ML

引用

ACM SIGPLAN 96 Conference on programming language design and Implementation

作者： Reppy, J Riecke, J AT&T Research Bell Laboratories

ISBN: (纸本)9780897917957

We propose a new approach to adding objects to Standard ML (SML) based on explicit declarations of object types, object constructors, and subtyping relationships, with a generalization of the SML case statement to a ''typecase'' on object types. The language, called Object ML (OML), has a type system that conservatively extends the SML type system, preserves sound static typing, and permits type inference. The type system sacrifices some of the expressiveness found in recently proposed schemes, but has the virtue of simplicity. We give examples of how features found in other object-oriented languages can be emulated in OML, discuss the formal properties of OML, and describe some implementation issues.

关键词： programming language design object-oriented programming functional programming Standard ML

来源：评论

学校读者我要写书评

暂无评论

Exploring language Support for Immutability 16

Exploring Language Support for Immutability

引用

38th IEEE/ACM International Conference on Software Engineering (ICSE)

作者： Coblenz, Michael Sunshine, Joshua Aldrich, Jonathan Myers, Brad Weber, Sam Shull, Forrest Carnegie Mellon Univ 5000 Forbes Ave Pittsburgh PA 15213 USA Inst Software Engn 4500 Fifth Ave Pittsburgh PA USA

ISBN: (纸本)9781450339001

programming languages can restrict state change by preventing it entirely (immutability) or by restricting which clients may modify state (read-only restrictions). The benefits of immutability and read-only restrictions in software structures have been long-argued by practicing software engineers, researchers, and programming language designers. However, there are many proposals for language mechanisms for restricting state change, with a remarkable diversity of techniques and goals, and there is little empirical data regarding what practicing software engineers want in their tools and what would benefit them. We systematized the large collection of techniques used by programming languages to help programmers prevent undesired changes in state. We interviewed expert software engineers to discover their expectations and requirements, and found that important requirements, such as expressing immutability constraints, were not reflected in features available in the languages participants used. The interview results informed our design of a new language extension for specifying immutability in Java. Through an iterative, participatory design process, we created a tool that reflects requirements from both our interviews and the research literature.

关键词： programming language design programming language usability Immutability Mutability Programmer productivity Empirical studies of programmers

来源：评论

学校读者我要写书评

暂无评论

design for Proof: An Approach to the design of Domain-Specific languages

引用

Formal Aspects of Computing 1998年第5-6期10.0卷 452-468页

作者： Anderson, Stuart Tourlas, Konstantinos Lab. for the Found. of Comp. Science Division of Informatics University of Edinburgh Edinburgh United Kingdom LFCS Division of Informatics University of Edinburgh Edinburgh EH9 3JZ United Kingdom

We propose that the domain of a Domain-Specific language (DSL) can be characterised by: 1. the class of environments in which systems developed in the language are expected to operate;and 2. the class of properties which such systems are expected to possess. The design of DSLs should therefore include the development of a proof system that eases the task of proving the properties in the class identified for the anticipated operating environments. We develop these ideas in the context of industrial computing systems by presenting a semantics and proof system for a language based on IEC 1131-3, the international standard programming language for programmable controllers. Of particular significance in this example is the use of a diagrammatic representation and the development of a proof system for a class of invariance properties that requires only local knowledge of the structure of diagrams.

关键词： Domain-specific languages Industrial critical systems Programmable controllers programming language design

来源：评论

学校读者我要写书评

暂无评论

Option Contracts 13

Option Contracts

引用

2013 ACM SIGPLAN International Conference on Object Oriented programming Systems languages

作者： Dimoulas, Christos Findler, Robert Bruce Felleisen, Matthias Harvard Univ Cambridge MA 02138 USA Northwestern Univ Evanston IL 60208 USA Northeastern Univ Boston MA USA

ISBN: (纸本)9781450323741

Many languages support behavioral software contracts so that programmers can describe a component's obligations and promises via logical assertions in its interface. The contract system monitors program execution, checks whether the assertions hold, and, if not, blames the guilty component. Pinning down the violator gets the debugging process started in the right direction. Quality contracts impose a serious runtime cost, however, and programmers therefore compromise in many ways. Some turn off contracts for deployment, but then contracts and code quickly get out of sync during maintenance. Others test contracts randomly or probabilistically. In all cases, programmers have to cope with lack of blame information when the program eventually fails. In response, we propose option contracts as an addition to the contract tool box. Our key insight is that in ordinary contract systems, server components impose their contract on client components, giving them no choice whether to trust the server's promises or check them. With option contracts, server components may choose to tag a contract as an option and clients may choose to exercise the option or accept it, in which case they also shoulder some responsibility. We show that option contracts permit programmers to specify flexible checking policies, that their cost is reasonable, and that they satisfy a complete monitoring theorem.

关键词： programming language design behavioral software contracts random testing probabilistic spot checking

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：