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

SP-K - SYSTEM FOR TEACHING COMPUTER programming

COMMUNICATIONS OF THE ACM 1977年第5期20卷 301-309页

作者： HOLT, RC WORTMAN, DB BARNARD, DT CORDY, JR UNIV TORONTO COMP SYST RES GRPTORONTO M5S 1A4ONTARIOCANADA

SP/k is a compatible subset of the PL/I language that has been designed for teaching programming. The features of the SP/k language were chosen to encourage structured problem solving by computers, to make the language easy to learn and use, to eliminate confusing and redundant constructs, and to make the language easy to compile. The resulting language is suitable for introducing programming concepts used in various applications, including business data processing, scientific calculations and non-numeric computation. SP/k is actually a sequence of language subsets called SP/1, SP/2, … SP/8. Each subset introduces new programming language constructs while retaining all the constructs of preceding subsets. Each subset is precisely defined and can be learned or implemented without the following subsets.

关键词： PL/I SP/k community colleges high schools introductory computing minicomputers programmer education programming language design teaching programming universities

来源：评论

学校读者我要写书评

暂无评论

CODE OPTIMIZATION CONSIDERATIONS IN LIST PROCESSING SYSTEMS

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1982年第2期8卷 107-112页

作者： SAMET, H Dept. Comp. Sci. Univ. MD College Park MD 20742

High-level languages operating through interpreters have performed satisfactorily in small applications. However, as applications grow, it becomes necessary to find means to adapt these languages to execute in less space and in less time. In list processing systems, much of the program execution time is spent setting up linkages between functions and for recursion. By optimizing the linkages and expediting the recursion, these programs can execute much faster. Also, the calling sequences can be adapted in such a fashion that some of the parameters will be already in the accumulators at the time the call is issued. As regards execution space, the language LISP, for example, allocates storage whenever a CONS operation is performed. An examination is made of dynamic space optimization in the context of reducing the frequency of occurrence of garbage collection. Some language extensions are proposed which lessen the amount of storage which needs to be allocated and hence, may result in a decrease in the frequency of garbage collection.

关键词： programming language design Code Optimization Compilers Garbage Collection LISP List Processing

来源：评论

学校读者我要写书评

暂无评论

OPTIMAL INSERTION OF SOFTWARE PROBES IN WELL-DELIMITED PROGRAMS

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1982年第1期8卷 34-42页

作者： PROBERT, RL Dept. Comp. Sci. Univ. Ottawa Ottawa Ont. Can.

A standard technique for monitoring software testing activities is to instrument the module under test with counters or probes before testing begins; then, during testing, data generated by these probes can be used to identify portions of as yet unexercised code. In this paper the effect of the disciplined use of language features for explicitly delimiting control flow constructs is investigated with respect to the corresponding ease of software instrumentation. In particular, assuming all control constructs are explicitly delimited, for example, by END IF or equivalent statements, an easily programmed method is given for inserting a minimum number of probes for monitoring statement and branch execution counts without disrupting source code structure or paragraphing. The use of these probes, called statement probes, is contrasted with the use of standard (branch) probes for execution monitoring. It is observed that the results apply to well-delimited modules written in a wide varity of programming languages, in particular, Ada.

关键词： Testing Branch Execution Control Structures Execution Count Flowgraphs Graph Theory Monitors Probe Basis Program Instrumentation programming language design Software Probes Spanning Trees Structured Programs

来源：评论

学校读者我要写书评

暂无评论

PARALLEL COMPILATION - design AND ITS APPLICATION TO SIMULA 67

引用

COMPUTER languageS 1978年第2期3卷 75-94页

作者： SCHWARTZ, RL Jet Propulsion Laboratory 4800 Oak Grove Drive Pasadena CA 91103 U.S.A. Computer Science Department University of California Los Angeles CA 90024 U.S.A.

A design for a separate compilation facility for the SIMULA 67 programming language is presented. The paper explores the problems with existing separate compilation schemes, and proposes a new scheme that allows top-down, bottom-up, or even parallel development and integration of program modules. An evaluation of the proposal and a discussion of its applicability to other languages are then given.

关键词： SIMULA 67 programming language design Separate compilation Parallel compilation Module

来源：评论

学校读者我要写书评

暂无评论

THE design OF EDISON

引用

SOFTWARE-PRACTICE & EXPERIENCE 1981年第4期11卷 363-396页

作者： HANSEN, PB Computer Science Department University of Southern California Los Angeles California 90007 U.S.A.

This paper describes the considerations behind the design of the programming language Edison including the reasons why a large number of well-known language featuges were excluded. It also discusses the linguistic pro... 详细信息

关键词： Edison programming language design programming language description

来源：评论

学校读者我要写书评

暂无评论

Interaction Nets With Nested Pattern Matching

引用

ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE 2008年第1期203卷 79-92页

作者： Hassan, Abubakar Sato, Shinya Kings Coll London Dept Comp Sci London WC2R 2LS England Himeji Dokkyo Univ Fac Econoinformat Himeji Hyogo 6708524 Japan

Reduction rules in Interaction Nets are constrained to pattern match exactly one argument at a time. Consequently, a programmer has to introduce auxiliary rules to perform more sophisticated matches. We propose an extension of Interaction Nets which facilitates nested pattern matching on interaction rules. We then define a practical compilation scheme from extended rules to pure interaction rules. We achieve a system that provides convenient ways to express Interaction Net programs without defining auxiliary rules.

关键词： Interaction nets pattern matching programming language design

来源：评论

学校读者我要写书评

暂无评论

THE EFFECT OF SCOPE DELIMITERS ON PROGRAM COMPREHENSION

引用

SOFTWARE-PRACTICE & EXPERIENCE 1983年第9期13卷 817-824页

作者： SYKES, F TILLMAN, RT SHNEIDERMAN, B UNIV MARYLAND DEPT COMP SCICOLLEGE PKMD 20740

Scope delimiters, such as BEGIN-END or DO-END, are used in many programming languages, but they can lengthen and clutter a program listing. This paper provides experimental evidence that ENDIF or ENDWHILE statement te... 详细信息

关键词： Scope delimiters programming language design Software psychology

来源：评论

学校读者我要写书评

暂无评论

Verified Compilation of Quantum Oracles

引用

PROCEEDINGS OF THE ACM ON programming languageS-PACMPL 2022年第OOPSLA期6卷 589–615页

作者： Li, Liyi Voichick, Finn Hietala, Kesha Peng, Yuxiang Wu, Xiaodi Hicks, Michael Univ Maryland College Pk MD 20742 USA Amazon Seattle WA USA

Quantum algorithms often apply classical operations, such as arithmetic or predicate checks, over a quantum superposition of classical data;these so-called oracles are often the largest components of a quantum program. To ease the construction of efficient, correct oracle functions, this paper presents VQO, a high-assurance framework implemented with the Coq proof assistant. The core of VQO is OQASM, the oracle quantum assembly language. OQASM operations move qubits between two different bases via the quantum Fourier transform, thus admitting important optimizations, but without inducing entanglement and the exponential blowup that comes with it. OQASM's design enabled us to prove correct VQO's compilers-from a simple imperative language called OQIMP to OQASM, and from OQASM to sqir, a general-purpose quantum assembly language-and allowed us to efficiently test properties of OQASM programs using the QuickChick property-based testing framework. We have used VQO to implement a variety of arithmetic and geometric operators that are building blocks for important oracles, including those used in Shor's and Grover's algorithms. We found that VQO's QFT-based arithmetic oracles require fewer qubits, sometimes substantially fewer, than those constructed using "classical" gates;VQO's versions of the latter were nevertheless on par with or better than (in terms of both qubit and gate counts) oracles produced by Quipper, a state-of-the-art but unverified quantum programming platform.

关键词： Quantum Oracle programming language design Type System Compiler Verification

来源：评论

学校读者我要写书评

暂无评论

CONSTRUCTIVE METHODS IN PROGRAM VERIFICATION

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1977年第3期3卷 193-210页

作者： WEGBREIT, B XEROX CORP PALO ALTO RES CTRPALO ALTOCA 94304

Most current approaches to mechanical program verification transform a program and its specifications into first-order formulas and try to prove these formulas valid. Since the first-order predicate calculus is not decidable, such approaches are inherently limited. This paper proposes an alternative approach to program verification: correctness proofs are constructively established by proof justifications written in an algorithmic notation. These proof justifications are written as part of the program, along with the executable code and correctness specifications. A notation is presented in which code, specifications, and justifications are interwoven. For example, if a program contains a specification 3x P(x), the program also contains a justification that exhibits the particulat value of x that makes P true. Analogously, justifications may be used to state how universally quantified formulas are to be instantiated when they are used as hypotheses. Programs so justifiled may be verified by proving quantifier-free formulas. Additional classes of justifications serve related ends. Formally, justifications reduce correctness to a decidable theory. Informally, justifications establish the connection between the executable code and correctness specifications, documenting the reasoning on which the correctness is based.

关键词： Constructive Program Verification First Order Logic Instantiations Program Verification programming language design programming languages programming Methodology Proof Justifications Proving Programs Correct

来源：评论

学校读者我要写书评

暂无评论

The Ultimate Conditional Syntax

引用

PROCEEDINGS OF THE ACM ON programming languageS-PACMPL 2024年第OOPSLA期8卷 988-1017页

作者： Cheng, Luyu Parreaux, Lionel HKUST Hong Kong Peoples R China

Functional programming languages typically support expressive pattern-matching syntax allowing programmers to write concise and type-safe code, especially appropriate for manipulating algebraic data types. Many features have been proposed to enhance the expressiveness of stock pattern-matching syntax, such as pattern bindings, pattern alternatives (a.k.a. disjunction), pattern conjunction, view patterns, pattern guards, pattern synonyms, active patterns, 'if-let' patterns, multi-way if-expressions, etc. In this paper, we propose a new pattern-matching syntax that is both more expressive and (we argue) simpler and more readable than previous alternatives. Our syntax supports parallel and nested matches interleaved with computations and intermediate bindings. This is achieved through a form of nested multi-way if-expressions with a condition-splitting mechanism to factor common conditional prefixes as well as a binding technique we call conditional pattern flowing. We motivate this new syntax with many examples in the setting of MLscript, a new ML-family programming language. We describe a straightforward desugaring pass from our rich source syntax into a minimal core syntax that only supports flat patterns and has an intuitive small-step semantics. We then provide a translation from the core syntax into a normalized syntax without backtracking, which is more amenable to coverage checking and compilation, and formally prove that our translation is semantics-preserving. We view this work as a step towards rethinking pattern matching to make it more powerful and natural to use. Our syntax can easily be integrated, in part or in whole, into existing as well as future programming language designs.

关键词： pattern matching syntax programming language design

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：