Understanding Programming Languages

We document the influence on programming language semantics of the Platonism/formalism divide in the philosophy of mathematics.

Programming Languages in Economics

Young economists sometimes ask which computer programming languages they should learn. This paper answers that question by suggesting that they begin with a high level language like GAUSS, GAMS, Mathematica, Maple or MATLAB depending on their field of specialization in economics. Then they should work down to one of the low level languages such as Fortran, Basic, C, C++ or Java depending on the planned areas of application. Finally, they should proceed to the languages which are used to develop graphical interfaces and internet applications, viz. Visual Basic, C, C++ or Java.     

Fundamental Concepts in Programming Languages

This paper forms the substance of a course of lectures given at the International Summer School in Computer Programming at Copenhagen in August, 1967. The lectures were originally given from notes and the paper was written after the course was finished. In spite of this, and only partly because of the shortage of time, the paper still retains many of the shortcomings of a lecture course. The chief of these are an uncertainty of aim—it is never quite clear what sort of audience there will be for such lectures—and an associated switching from formal to informal modes of presentation which may well be less acceptable in print than it is natural in the lecture room. For these (and other) faults, I apologise to the reader.There are numerous references throughout the course to CPL [1–3]. This is a programming language which has been under development since 1962 at Cambridge and London and Oxford. It has served as a vehicle for research into both programming languages and the design of compilers. Partial implementations exist at Cambridge and London. The language is still evolving so that there is no definitive manual available yet. We hope to reach another resting point in its evolution quite soon and to produce a compiler and reference manuals for this version. The compiler will probably be written in such a way that it is relatively easyto transfer it to another machine, and in the first instance we hope to establish it on three or four machines more or less at the same time.The lack of a precise formulation for CPL should not cause much difficulty in this course, as we are primarily concerned with the ideas and concepts involved rather than with their precise representation in a programming language.     

Programming Languages For Interactive Computing

Traditional programming languages are algorithmic: they are best suited to writing programs that acquire all their inputs before executing and only produce a result on termination. By contrast most applications are interactive: they maintain ongoing interactions with their environments. Modern systems address this incompatibility by manually extending the execution model of the host language to support interaction, usually by embedding an event-driven state management scheme which executes fragments of imperative code in response to interactions, the job of each executed fragment being to restore the internal consistency of the computation. The downside of this approach to interaction is that it relies heavily on mutable stores and side-effects and mixes application logic in with behaviour which is more properly the responsibility of an execution model. I describe a programming model called declarative interaction which supports interaction directly. The distinguishing feature of the model is its modal construal of state and interaction.     

Strategies in Programming Languages Today

This paper provides a brief account of motivation, themes, and research directions leading to the round table on Strategies in Programming Languages Today organized as part of the 4th International Workshop on Reduction Strategies in Rewriting and Programming (WRS'04).     

Abstraction Techniques in Modern Programming Languages

Modern Programming languages depend on abstraction: they manage complexity by emphazing what is significant to the user and suppressing what is not.     

Reversible Computation and Reversible Programming Languages

A reversible programming language supports deterministic forward and backward computation. This tutorial focuses on a high-level reversible programming language Janus. In common with other programming paradigms, reversible programming has its own programming methodology. Janus is simple, yet powerful, and its constructs can serve as a model for designing reversible languages in general.     

Definitional Interpreters for Higher-Order Programming Languages

Higher-order programming languages (i.e., languages in which procedures or labels can occur as values) are usually defined by interpreters that are themselves written in a programming language based on the lambda calculus (i.e., an applicative language such as pure LISP). Examples include McCarthy's definition of LISP, Landin's SECD machine, the Vienna definition of PL/I, Reynolds' definitions of GEDANKEN, and recent unpublished work by L. Morris and C. Wadsworth. Such definitions can be classified according to whether the interpreter contains higher-order functions, and whether the order of application (i.e., call by value versus call by name) in the defined language depends upon the order of application in the defining language. As an example, we consider the definition of a simple applicative programming language by means of an interpreter written in a similar language. Definitions in each of the above classifications are derived from one another by informal but constructive methods. The treatment of imperative features such as jumps and assignment is also discussed.     

流程图编程语言和编辑软件的设计开发

为解决小型微型就地控制或显示设备的流程图显示问题,设计了一种适用于有限资源的基于矢量方式、顺序文件模式的流程图编程语言和配套的绿色图形化编辑软件.较为详尽地介绍了它们的设计思想和设计方法.     

Syntactic Error Correction in Programming Languages

A technique for syntactic error correction, called pattern mapping, is developed. A pattern is used to describe how to map or change one string into another. Using a preconstructed list of patterns, for each detected error, the first pattern with successful mapping is found and a correction is made based on this pattern.     

持久性程序设计语言及其现状

1.引言许多计算机系统如MIS系统、CAD/CAM系统、CASE系统、OA系统、地理信息系统、医疗保健系统都遵循一个共同的模式,就是围绕持久性的数据进行计算(处理),这类应用称为持久应用(persistent application)。在这类系统中,被处理数据分为瞬态数据和持久性数据。传统程序设计语言一般只提供了定义和操纵瞬态数据的设施,却不支持对持久性的抽象。传统的数据库系统可以定义和操纵持久数据,但却存在着计算不完备、数据建模能力差等问题。因此,在开发持久应用时,人们往往不得不同时使用数据库系统和传统程序设计语言:用数据库系统对持久性数据进行定义和存储,用传统语言进行其它辅助处理。但混合使用传统语言和数据库系统并不     

Developers Shift to Dynamic Programming Languages

Software developers are always looking for ways to boost their effectiveness and productivity and perform complex jobs more quickly and easily, particularly as projects have become increasingly large and complex. Programmers want to shed unneeded complexity and outdated methodologies and move to approaches that focus on making programming simpler and faster. With this in mind, many developers are increasingly using dynamic languages such as JavaScript, Perl, Python, and Ruby. Although software experts disagree on the exact definition, a dynamic language basically enables programs that can change their code and logical structures at runtime, adding variable types, module names, classes, and functions as they are running. These languages frequently are interpreted and generally check typing at runtime     

Programming Languages and Direct-Execution Computer Architecture

Besides offering fast execution speed, the direct-execution architecture permits highly interactive programming, language definition, and the measurement of language complexity.     

Modeling Biological Networks by Action Languages via Answer Set Programming

We describe an approach to modeling biological networks by action languages via answer set programming. To this end, we propose an action language for modeling biological networks, building on previous work by Baral et al. We introduce its syntax and semantics along with a translation into answer set programming, an efficient Boolean Constraint Programming Paradigm. Finally, we describe one of its applications, namely, the sulfur starvation response-pathway of the model plant Arabidopsis thaliana and sketch the functionality of our system and its usage.     

从面向方面程序设计的定义到面向方面程序设计语言

目前无论在学术界还是工业界,很多人士简单地将面向方面程序设计理解为模块化横切关注点,狭隘地认为 面向方面程序设计构建在面向对象程序设计之上,是面向对象程序设计的扩展、有效的补充等。回顾了面向方面程序 设计的定义,分析了面向方面程序设计区别于其它程序设计方法的本质特征,并形式化了定义中的量化语句与方面, 给出了量化语句与方面的语义。重申了面向方面程序设计的本质特性是Quantification与()bliviousncss,模块化横切 关注点只是其带来的一个好处。同时指出了面向方面程序设计是一种新型的程序设计范式,独立于面向对象等其它 程序设计方法。并且,基于此定义,给出了面向方面程序设计语言需满足的最小条件集,并比较了主流的面向方面程 序设计语言,探讨了这些语言在面向方面程序设计理念上的差异。     

从面向方面程序设计的定义到面向方面程序设计语言

目前无论在学术界还是工业界,很多人士简单地将面向方面程序设计理解为模块化横切关注点,狭隘地认为面向方面程序设计构建在面向对象程序设计之上,是面向对象程序设计的扩展、有效的补充等.回顾了面向方面程序设计的定义,分析了面向方面程序设计区别于其它程序设计方法的本质特征,并形式化了定义中的量化语句与方面,给出了量化语句与方面的...