Sandra Madison, James Gifford · Journal of Research on Technology in Education · 2002
This study explored the parameter-related misconceptions of two college students enrolled in an introductory programming course. Both students appeared to conceive a direct procedure-to-procedure linkage, with the connection being forged by identically named formal parameters. Throughout the semester, both students were able—by making apparently innocuous adjustments to formal parameter lists—to construct correctly functioning modular programs. They were also able to correctly answer parameter-related test questions when the questions did not provoke a conflict with their fundamental misconception of the parameter process. Therefore, the misconceptions were concealed from the instructor and perhaps from the students themselves. This article discusses the results of the study within the constructivist framework and suggests implications for instruction.
Cited by 18
Tony Royce · 1996
A program may be divided into a number of modules — each one in a separate file. These modules may be compiled (and tested) separately — then linked together to form one program.
Cited by 0
SpringerReference · 2011
Cited by 0
Wolfgang Weck, Jürg Gutknecht · Lecture notes in computer science · 2000
Cited by 5
José Júlio Alferes, Antonio Brogi, João Alexandre Leite et al. · 2002
Logic programming has often been considered less than adequate for modelling the dynamics of knowledge changing over time. In this paper we describe a simple though quite powerful approach to modelling the updates of knowledge bases expressed by generalized logic programs, by means of a new language, hereby christened EVOLP (after EVOlving Logic Programs). The approach was first sparked by a critical analysis of previous efforts and results in this direction [1,2,7,11], and aims to provide a simpler, and at once more general, formulation of logic program updating, which runs closer to traditional logic programming (LP) doctrine. From the syntactical point of view, evolving programs are just generalized logic programs (i.e. normal LPs plus default negation also in rule heads), extended with (possibly nested) assertions, whether in heads or bodies of rules. From the semantics viewpoint, a model-theoretic characterization is offered of the possible evolutions of such programs. These evolutions arise both from self (or internal) updating, and from external updating too, originating in the environment. This formulation sets evolving programs on a firm basis in which to express, implement, and reason about dynamic knowledge bases, and opens up a number of interesting research topics that we brush on.
Cited by 0
Robin Judd · ITNOW · 1970
Abstract Modular programming has the obvious merit that it enables programming to be divided among several programmers working concurrently. There is another advantage, however, since it allows better testing and validation by groups who may not be aware of the detailed methods used.
Cited by 1
Salvatore Ruggieri · 1994
Cited by 0
John C. Molluzzo · ACM SIGCSE Bulletin · 1984
article Free Access Share on Modular assembler language programming Author: John C. Molluzzo City University of New York, New York, NY City University of New York, New York, NYView Profile Authors Info & Claims ACM SIGCSE BulletinVolume 16Issue 3September 1984 pp 17–20https://doi.org/10.1145/989357.989362Online:01 September 1984Publication History 2citation125DownloadsMetricsTotal Citations2Total Downloads125Last 12 Months3Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
Cited by 2Open access
Deborah Ann Stidd · Cardinal Scholar (Ball State University) · 1975
There is no abstract available for this research paper.
Cited by 0
Reiji Nakajima, Taiichi Yuasa · 1983
Cited by 1
2008
This paper summarizes the initial experience with the programming language Concurrent Pascal in the design of three model operating systems. A Concurrent Pascal program consists of modules called processes, monitors, and classes. The compiler checks that the data structures of each module are accessed only by the operations defined in the module. The author emphasizes that the creative aspect of program construction is the initial selection of modules and the connection of them into hierarchical structures. By comparison the detailed implementation of each module is straightforward. The most important result is that it is possible to build concurrent programs of one thousand lines out of one-page modules that can be comprehended at a glance. 1
Cited by 0
浅井 清, 桂木 学 · Jaea Originated Papers Searching System (National Research and Development Corporation Japan Atomic Energy Agency)
過去数年間日本原子力研究所の研究者、技術者はモジュラ、コード、システムに適用するために有用な計算機の諸機能を追及してきた。それらのひとつはデータプールと呼ばれるファイル取扱いのプログラムで、こらは現在原研で開発中のコーード、システムで使用されている。その他は、プログラムの動的結合、主記憶内プログラム共用可能、会話型プログラミング、記録清書、システム出力表示、実行速度制御可能Fortran、タイムシュアリングあるいはバッチッ処理用計算機の選択的使用などの計算機機能である。最近原研に設置された計算機は、これらの諸機能を装備しているので、原子力コードの開発や利用者が特に意識しなくても既存の大型コードをモジュラ、コード、システムに変更することができる。これによって我々は柔軟なモジュラ、コード、システム開発利用への長い道程の中点に到達したといえる。
Cited by 0
Ran Rinat, Scott Smith · 2002
Cited by 5
Taiichi Yuasa, Reiji Nakajima · IEEE Transactions on Software Engineering · 1985
A highly interactive programming system is presented which supports hierarchical and modular program development with abstraction mechanisms. By taking advantage of abstraction mechanisms, the system provides a "truly modular" environment, in which modules are constructed, debugged, verified, and compiled in a module-by-module fashion. Such an environment naturally requires system management of the information concerning ongoing program development, in the form of module databases. As a result, further problems arise as to how to modify the information in efficient and consistent ways. This paper discusses design objectives for modular programming systems by focusing on such issues as information management, interactive construction and modification of modules, separate processing, specification and verification, and supports for cooperative program development.
Cited by 6
Per Brinch Hansen · IEEE Transactions on Software Engineering · 1977
This paper summarizes the initial experience with the programming language Concurrent Pascal in the design of three model operating systems. A Concurrent Pascal program consists of modules called processes, monitors, and classes. The compiler checks that the data structures of each module are accessed only by the operations defined in the module. The author emphasizes that the creative aspect of program construction is the initial selection of modules and the connection of them into hierarchical structures. By comparison the detailed implementation of each module is straightforward. The most important result is that it is possible to build a concurrent program of one thousand lines out of one-page modules that can be comprehended at a glance.
Cited by 20
Matthew Lane · HAL (Le Centre pour la Communication Scientifique Directe) · 2015
International audience
Cited by 0Open access
Christensen, Aske Simon, Midtgaard, Jan; Dept. of Computer Science, Aarhus University, Winther, Johnni et al. · AUL · 2015
Cited by 0
2010
Build modular SAS Frame applications using advanced programming techniques and features available in SAS SCL. Easily separate critical logic and business rules from your code base without creating tangled source code. Isolate and integrate decision-logic from task-logic without separating your brain from your sanity.
Cited by 0
Ali Mili Njit · 2012
Cited by 0
Naveen, Kumar · CERN Document Server (European Organization for Nuclear Research) · 2017
Cited by 0