Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 10,000 papers for “programming”

Strategic programming meets adaptive programming

Ralf Lämmel, Eelco Visser, Joost Visser · 2003

Strategic programming is a generic programming idiom for processing compound data such as terms or object structures. At the heart of the approach is the separation of two concerns: basic dataprocessing computations vs. traversal schemes. Actual traversals are composed by passing the former as arguments to the latter. Traversal schemes can be defined by the strategic programmer using a combinator style that relies on primitives for layered traversal.In this paper, we take a look at strategic programming from an aspect-oriented programming perspective. Throughout the paper, we compare strategic programming with adaptive programming, which is a well-established aspectual approach to the traversal of object structures. We start from the observation that aspect-oriented programming terms, e.g., crosscutting, join point, and advice can be instantiated for aspectual traversal approaches.

Cited by 49

Programming enviroments for parallel programming

Andrew W. Kwan · eScholarship (California Digital Library) · 1989

Programming environments are used to bridge the gap between actual computers ad developement of their application programs. Most parallel programming environments currently in use focus on a specific parallel programming tool. This paper examines programming environments. language, tools, and techniques used for programming of parallel computers.In this paper, several topics are examined. First, a brief survey of parallel computer architectures and typical application programs is performed. Then, a survey of available environments, languages, and tools is conducted to determine how parallel programming is currently performed. Finally, by considering architectures, applications, and environments, an attempt is made to find desirable characteristics for a parallel programming environment and a useful set of parallel programming tools.

Cited by 0Open access

Programming is Writing is Programming

Felienne Hermans, Marlies Aldewereld · 2017

Writing and programming are often seen as different: writing a creative profession, programming a technical one. Below the surface however, there is one striking similarity: both writing and programming can be described as the translation of a high-level idea into low level sentences or statements. This paper compares writing and programming and uncovers similarities between some of the steps commonly considered part of the writing and programming workflows, such as information gathering and selection. We however also observe differences, like the attention that writers spent on formatting and styling, and the opportunity for feedback that programmers have by compiling and executing programs. We close the paper with a discussion of the impact of this finding, including educational methods that programming could take from writing education.

Cited by 23

Revision programming = logic programming + constraints

Victor Marek, Inna Pivkina, Mirosław Truszczyński · 2008

We study revision programming, a logic-based mechanism for enforcing constraints on databases. The central concept of this approach is that of a justified revision based on a revision program. We show that revisions can be shifted, that is for any program P, for any pair of initial databases I and I ′ we can shift the program P to program P ′ so that the size of the resulting program does not increase and so that P-justified revisions of I are shifted to P ′-justified revisions of I ′. Using this result we show that revision programming is closely related to a subsystem of general logic programming of Lifschitz and Woo. This, in turn, allows us to reduce revision programming to logic programming with stable model semantics extended by the concept of a constraint. Finally, we use the connection between revision programming and general logic programming to introduce disjunctive and nested versions of our formalism. 1

Cited by 0

Programming abstractions for concurrent programming

Caromel, Denis, Centre National de la Recherche Scientifique (CNRS), 54 - Vandoeuvre-les-Nancy (France). Centre de Recherche en Informatique de Nancy (CRIN), Nancy-1 Univ., 54 - Vandoeuvre-les-Nancy (France). Centre de Recherche en Informatique de Nancy (CRIN) et al. · OpenGrey (Institut de l'Information Scientifique et Technique) · 1990

Dans : Proceedings TOOLS PACIFIC'90 (Technology of Object-Oriented Languages and Systems), Sydney (Australie), novembre 1990

Cited by 6

C Programming: Structured Programming Language

Tapasya M. Mate - · International Journal For Multidisciplinary Research · 2024

The c programming language was developed by Dennis Ritchie at AT&T bell laboratories in early 1970s. C is powerful language that provides fast program execution. its power and fast program execution come from its ability to access low level commands, similar to assembly language, but with high level syntax.

Cited by 0Open access

End user programming/informal programming

Howie Goodell, Sarah Kuhn, David Maulsby et al. · ACM SIGCHI Bulletin · 1999

article Free Access Share on End user programming/informal programming Authors: Howie Goodell View Profile , Sarah Kuhn View Profile , David Maulsby View Profile , Carol Traynor View Profile Authors Info & Claims ACM SIGCHI BulletinVolume 31Issue 4Oct. 1999 pp 17–21https://doi.org/10.1145/339290.339294Published:01 October 1999Publication History 8citation147DownloadsMetricsTotal Citations8Total Downloads147Last 12 Months13Last 6 weeks2 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 Alerts New Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF

Cited by 12

Semidefinite Programming and Integer Programming

Monique Laurent, Franz Rendl, Aardal, Karen et al. · Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands · 2003

We survey how semidefinite programming can be used for finding good approximative solutions to hard combinatorial optimization problems.

Cited by 1Open access

Automatic programming using genetic programming

Kevin Igwe, Nelishia Pillay · 2013

Genetic programming (GP) is an evolutionary algorithm which explores a program space rather than a solution space which is typical of other evolutionary algorithms such as genetic algorithms. GP finds solutions to problems by evolving a program, which when implemented will produce a solution. This paper investigates the use of genetic programming for automatic programming. The paper focuses on the procedural/imperative programming paradigm. More specifically the evolution of programs using memory, conditional and iterative programming constructs is investigated. An internal representation language is defined in which to evolve programs. The generational GP algorithm was implemented using the grow method to create the initial population, tournament selection to choose parents and reproduction, crossover and mutation for regeneration purposes. The paper also presents a form of incremental learning which facilitates modularization. The GP approach to automatic programming was tested on ten programming problems that are usually presented to novice programmers in a first year procedural programming course of an undergraduate degree in Computer Science. The GP approach evolved solutions for all ten problems, with incremental learning needed in two instances to produce a solution.

Cited by 11

Semidefinite Programming and Constraint Programming

Willem-Jan Hoeve · RePEc: Research Papers in Economics

Abstract Recently, semidefinite programming relaxations have been applied in constraint programming to take advantage of the high-quality bounds and precise heuristic guidance during the search for a solution. The purpose of this chapter is to present an overview of these developments, and to provide future research prospects.

Cited by 0