Putting declarative programming into the web

Hanus, Michael

doi:10.1145/1273920.1273942

Cited by 14 publications

(11 citation statements)

References 34 publications

(74 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For example, we might wish to translate validation code to JavaScript to run on the client [12], or enforce separation between those portions of the program that deal with presentation and those that treat application-specific computation, a common requirement in large web projects. Either of these may be combined with the formlet abstraction without injury to the core design presented here.…”

Section: Other Extensionsmentioning

confidence: 99%

“…WUI The WUI (Web User Interface) library [11,12] implements form abstractions for the functional logic programming language Curry. Here the basic units are called WUIs.…”

Section: Related Workmentioning

confidence: 99%

“…But remarkably few web frameworks support it. Three existing web programming frameworks that do support some degree of abstraction over form components are WASH [28], iData [23] and WUI [11,12], each having distinctive features and limitations. (We discuss these further in Section 6.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

The Essence of Form Abstraction

Cooper

Lindley

Wadler

et al. 2008

Programming Languages and Systems

View full text Add to dashboard Cite

show abstract

Section: Other Extensionsmentioning

confidence: 99%

“…WUI The WUI (Web User Interface) library [11,12] implements form abstractions for the functional logic programming language Curry. Here the basic units are called WUIs.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

The Essence of Form Abstraction

Cooper

Lindley

Wadler

et al. 2008

Programming Languages and Systems

View full text Add to dashboard Cite

show abstract

“…Modern languages of this kind [8,17,19] combine the concepts of demand-driven evaluation and higher-order functions from functional programming with logic programming features like computing with partial information (logic variables), unification, and nondeterministic search for solutions. This combination, supported by optimal evaluation strategies [1] and new design patterns [2], leads to better abstractions in application programs, e.g., as shown for programming with databases [3,6] or web programming [10,12,14]. The declarative multi-paradigm language Curry [8,17] is a functional logic language extended by features for concurrent programming.…”

Section: Functional Logic Programming and Currymentioning

confidence: 99%

Declarative Programming of User Interfaces

Hanus

Kluß

2008

Practical Aspects of Declarative Languages

Self Cite

View full text Add to dashboard Cite

Abstract. This paper proposes a declarative description of user interfaces that abstracts from low-level implementation details. In particular, the user interfaces specified in our framework are executable as graphical user interfaces for desktop applications as well as web user interfaces via standard web browsers. Thus, our approach combines the advantages of existing user interface technologies in a flexible way without demands on the programmer's side. We sketch an implementation of this concept in the declarative multi-paradigm programming language Curry and show how the integrated functional and logic features of Curry are exploited to enable a high-level implementation of this concept. MotivationThe implementation of a good user interface for application programs is a necessary but often non-trivial and tedious task. In order to support programmers in the implementation of user interfaces, one can find specific libraries that reflect different approaches to the construction of user interfaces. From a user's perspective, there are two kinds of user interfaces (UIs) that are currently the most important ones on conventional desktop computers:Graphical User Interfaces (GUIs): These are user interfaces that followed the early textual user interfaces on single host computers. GUIs enabled non-expert users to easily interact with application programs. They provide a good reaction time (since they run on the local host) and are relatively easy to install as any other program, i.e., usually they are distributed with the executable of the application program. On the negative side, application programs with GUIs require some installation efforts if many users want to use them on their desktops, because one has to install them on all desktops that might have different configurations or operating systems. Moreover, they are difficult to maintain during their life time since updates must be performed on all existing installations. Web User Interfaces (WUIs):These are user interfaces that became popular with the world-wide web and its opportunities for user interaction via dynamic web pages. In this case, the application runs on a web server and the user interacts with the application via a standard web browser. Thus, applications with WUIs are relatively easy to install for many users since every single user needs only a web browser on ⋆ This work was partially supported by the German Research Council (DFG) under grant Ha 2457/5-2.his local host (which is usually already installed). Moreover, such applications are easy to maintain since one has to update the central installation on the web server only. On the negative side, WUIs have a moderate reaction time (since the web server is contacted for every state-changing interaction) and a complete application is more difficult to install on a single host (since one has to install and configure a web server).A few years ago, there was also another important difference between GUIs and WUIs: the model of interaction. In application with GUIs, the user could immediately cha...

show abstract

“…The first group of Curry programs are standard libraries distributed with KiCS2, where HTML is the largest one (supporting programming of dynamic web pages [16]). The next two programs (AddTypes, Curry2JS) are tools contained in the KiCS2 distribution to add type signatures to top-level operations and compiling Curry programs into JavaScript programs (which is used to implement type-safe dynamic web pages [17]), respectively. The last two programs are small examples demonstrating typical functional logic programming techniques.…”

mentioning

confidence: 99%

From Boolean Equalities to Constraints

Antoy

Hanus

2015

Logic-Based Program Synthesis and Transformation

Self Cite

View full text Add to dashboard Cite

Abstract. Although functional as well as logic languages use equality to discriminate between logically different cases, the operational meaning of equality is different in such languages. Functional languages reduce equational expressions to their Boolean values, True or False, logic languages use unification to check the validity only and fail otherwise. Consequently, the language Curry, which amalgamates functional and logic programming features, offers two kinds of equational expressions so that the programmer has to distinguish between these uses. We show that this distinction can be avoided by providing an analysis and transformation method that automatically selects the appropriate operation. Without this distinction in source programs, the language design can be simplified and the execution of programs can be optimized. As a consequence, we show that one kind of equational expressions is sufficient and unification is nothing else than an optimization of Boolean equality. MotivationFunctional as well as logic programming languages are based on the common idea to specify computational problems in a high-level and descriptive manner. However, the computational entities and, thus, the programming styles are different. This can be seen in a prominent feature of such languages: the discrimination between logically different cases of a given problem. Functional (as well as imperative) languages use Boolean equations for this purpose, i.e., an equational expression is reduced to either True or False and, depending on the computed result, a different computation path is selected. A typical example is the factorial function where the base case is distinguished from the recursive case by comparing the argument with 0: 1 fac n = if n==0 then 1 else n * fac (n-1) The equality symbol "=" used in this program is different from the Boolean equality "==" above. For instance, in the first rule it is not intended to evaluate X=[] to True or False, but this equality must hold to proceed with this rule, i.e., it is a constraint for subsequent evaluation steps. As a consequence, it is not necessary to fully evaluate equational expressions but one can continue a computation even with partial knowledge, as long as the constraint is ensured to hold. For instance, if we want to ensure that a list L ends with the element 0, we can write Functional logic languages attempt to combine the most important features of functional and logic programming in a single language (see [5,18] for recent surveys). In particular, the functional logic language Curry [21] extends Haskell by common features of logic programming, i.e., non-determinism, free variables, and equational constraints. Due to its roots in functional and logic programming, Curry provides two kinds of equalities: Boolean equality ("==") as in functional programming and equational constraints ("=:=") as in logic programming. The motivation for this decision is to support nested case distinctions, like in functional programming, as well as rule-oriented programming with partial i...

show abstract

Putting declarative programming into the web

Cited by 14 publications

References 34 publications

The Essence of Form Abstraction

The Essence of Form Abstraction

Declarative Programming of User Interfaces

From Boolean Equalities to Constraints

Contact Info

Product

Resources

About