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 3,536 papers for “Declarative programming”

Declarative programming

John N. Crossley · Electronic Notes in Theoretical Computer Science · 2002

Cited by 14Open access

Declarative Programming

Apress eBooks · 2008

An interesting way to minimize the problems that arise with runtime aspects of an API is to eliminate the runtime completely. For lack of a better name, let’s call this declarative programming, though the term is overloaded with various meanings and it might mean different things to different people. With declarative programming, the basic idea is that users of your API don’t describe step-by-step what they want your API to do. Rather, they ”declare” what they want to have happen and then rely on your API to do it when necessary.

Cited by 0

Declarative specification and declarative programming

Manfred Broy · 2002

A formalism for declarative specification and programming is introduced that forms a logical and methodological framework for program and system specification and construction. It combines axiomatic techniques based on logical concepts for specifying properties and the possibility to introduce names for objects. In particular it comprises within one formalism, the possibilities of formulating specifications and defining algorithms. The logical formalism is based more or less on typed predicate logic. The development rules are particular proof rules together with the inference rules of predicate logic. As a special aspect, the authors consider logical formulas which explicitly specify typed identifiers as elements of signatures.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

Cited by 2

Advancing declarative programming

Milicevic, Aleksandar, Ph. D. Massachusetts Institute of Technology · DSpace@MIT (Massachusetts Institute of Technology) · 2015

Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2015.

Cited by 0Open access

Declarative Multithreaded Programming

Blanca Mancilla, John Plaice · 2009

We demonstrate how TransLucid can be used as a reactive system by introducing sets and privileged dimensions for time and port in the language. At each instant, there is a set of active ports, where sets of equations, demands and threads are all registered. Each thread defines a sequence of (state, demand) pairs and threads may interact through the overall set of equations. The entire system remains fully declarative.

Cited by 2

Declarative logic programming

佐藤泰介, TAISUKE SATO · Tokyo Tech Research Repository (Tokyo Institute of Technology) · 1999

Cited by 0Open access

Declarative Game Programming

Henrik Nilsson, Ivan Pérez · 2014

Video games are usually not programmed very declaratively. There are a number of reasons for this, from low-level efficiency concerns, via the nature of commonly employed programming languages, libraries, and frameworks, to the conceptual nature of such games, with state and effects being omnipresent. However, by structuring games in terms of time-varying values and transformations on such values, it is possible to design and implement video games in a more declarative way. This tutorial shows how this can be achieved through Functional Reactive Programming (FRP) by implementing the high-level parts of a 2D game akin to the classical game Breakout. The tutorial uses the Haskell-embedded FRP implementation Yampa and bindings to SDL (Simple DirectMedia Layer) to obtain game play and visual standards typical of the 2D genre; for example, as seen in many currently popular games for smartphones and tablets.

Cited by 1

Declarative aspectoriented programming

2015

Aspectoriented programming addresses the problem that the implementation of some properties such as error han dling and optimization tends to crosscut the basic func tionality To overcome that problem special languages are used to specify such propertiesthe socalled aspectsin isolation The software application is obtained by weav ing the aspect code and the implementation of properties corresponding to basic functionalitythe socalled compo nents This paper investigates the suitability of functional metaprograms to specify aspects and to perform weaving The proposal focuses on the declarative paradigm logic programming attribute grammars natural semantics con structive algebraic specication etc as far as components are concerned whereas aspects are represented by program transformations Weaving is regarded as a program compo sition returning a combination of the components satisfying all the aspects The computational behaviour of the compo nents is preserved during weaving The proposal improves reusability of declarative programs The approach is generic in the sense that it is applicable to several representatives of the declarative paradigm Several roles of aspect code are dened and analysed

Cited by 0

Declarative programming in PROLOG

Felician Alecu · RePEc: Research Papers in Economics · 2014

The declarative programming by declarative languages is clearly the best option a programmer can have for a completely readable, flexible and extensible code. Today, the economics of programming is clearly focused on the declarative paradigm while most imperative languages are trying to become cost effective by using new added declarative features for productivity and ease of use, like the Java 8. This paper tries to demonstrate a declarative language like PROLOG is perfectly suitable to be used to solve even common programming issue, like deciding an element is part of an array or not.

Cited by 1Open access

Meeting on declarative programming

Madrid Univ. Complutense (Spain), Malaga Univ. (Spain), Asociacion EspaNola de Informatica y Automatica, Madrid (Spain) · OpenGrey (Institut de l'Information Scientifique et Technique) · 1992

Available from Centro de Informacion y Documentacion Cientifica CINDOC. Joaquin Costa, 22. 28002 Madrid. SPAIN / CINDOC - Centro de Informaciòn y Documentaciòn Cientìfica

Cited by 0

that Supports Declarative Programming

K. R. Apt, J. Brunekreef, V. Partington et al. · 1997

and their applications. SMC is sponsored by the Netherlands Organization for Scientific Research (NWO). CWI is a member of

Cited by 0

Declarative Synchronous Multithreaded Programming

Blanca Mancilla, John Plaice · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2008

We demonstrate how TransLucid can be used as a reactive system. At each instant, there is a set of active ports, where sets of equations, demands and threads are all registered. Each thread defines a sequence of (state, demand) pairs, and threads may interact through the overall set of equations. The entire system remains fully declarative.

Cited by 0Open access

Declarative programming in Prolog

Krzysztof R. Apt · Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands · 1993

We try to assess to what extent declarative programming can be realized in Prolog and which aspects of correctness of Prolog programs can be dealt with by means of declarative interpretation. More specifically, we shall discuss termination of Prolog programs, partial correctness, absence of errors and the safe use of negation. 1991 Mathematics Subject Classification: 68Q40, 68T15. CR Categories: F.3.2., F.4.1, H.3.3, I.2.3. Keywords and Phrases: declarative programming, Prolog programs, verification. Notes. This research was partly supported by the ESPRIT Basic Research Action 6810 (Compulog 2). This paper will appear as invited lecture in: Proc. of International Logic Programming Symposium (ILPS &amp;apos;93), The MIT Press, D. Miller (editor). It also appeared as a Technical Report No CT-93-06 in the ILLC Prepublication Series of the University of Amsterdam. 1

Cited by 16Open access

Declarative Programming in Java

Răzvan Dina, Felician Alecu · RePEc: Research Papers in Economics · 2014

Despite the code is rarely self-explanatory, the imperative programming languages are the most commonly used in our days by the programmers all over the world and Java is definitely the lead language in popularity. This paper tries to conclude if there are any chances to use the most popular programming language of the moment in a declarative manner, even if Java itself is an intrinsic imperative language.

Cited by 0Open access