Multi-paradigm Declarative Languages

Hanus, Michael

doi:10.1007/978-3-540-74610-2_5

Cited by 72 publications

(76 citation statements)

References 75 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…3). There is a considerable literature about this specific source of non-determinism, centred around the semantics of the functional logic programming language Curry; see [14] for a survey. Since αML features nontrivial computational effects and we do not wish to impose a monadic programming style, we prefer a strict evaluation strategy, rather than the call-by-need strategy that is more common in the functional logic programming literature; and for simplicity's sake we wish to avoid residuation and concurrent execution [14, Sect.…”

Section: Fig 3 αMl Operational Semanticsmentioning

confidence: 99%

“…We think it is both useful and interesting to study executable operational semantics also using functional logic programming [14]. It has proved harder to integrate HOAS representations with functional programming: see [18] for a recent view on this.…”

Section: Related and Future Workmentioning

confidence: 99%

“…More specifically we study such an executable meta-language which is a higher-order, typed functional programming language, drawing upon the ideas of functional logic programming [14]. Our motivation for favouring this paradigm over the relational paradigm of first-order logic programming has to do with the expressiveness and modularity afforded by nfv(x, t): "x : vr is not a free variable of the λ-term t : tm"…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Resolving Inductive Definitions with Binders in Higher-Order Typed Functional Programming

Lakin

Pitts

2009

Programming Languages and Systems

View full text Add to dashboard Cite

Abstract. This paper studies inductive definitions involving binders, in which aliasing between free and bound names is permitted. Such aliasing occurs in informal specifications of operational semantics, but is excluded by the common representation of binding as meta-level λ-abstraction. Drawing upon ideas from functional logic programming, we represent such definitions with aliasing as recursively defined functions in a higher-order typed functional programming language that extends core ML with types for name-binding, a type of "semi-decidable propositions" and existential quantification for types with decidable equality. We show that the representation is sound and complete with respect to the language's operational semantics, which combines the use of evaluation contexts with constraint programming. We also give a new and simple proof that the associated constraint problem is NP-complete.

show abstract

Section: Fig 3 αMl Operational Semanticsmentioning

confidence: 99%

Section: Related and Future Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Resolving Inductive Definitions with Binders in Higher-Order Typed Functional Programming

Lakin

Pitts

2009

Programming Languages and Systems

View full text Add to dashboard Cite

show abstract

“…More details can be found in a recent survey on functional logic programming [13] and in the definition of Curry [17].…”

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

“…Functional logic languages integrate the most important features of functional and logic languages (see [8,24] for recent surveys). In particular, they combine higher-order functions and demand-driven evaluation from functional programming with logic programming features like non-deterministic search and computing with partial information (logic variables).…”

Section: Introductionmentioning

confidence: 99%

KiCS2: A New Compiler from Curry to Haskell

Braßel

Hanus

Peemöller

et al. 2011

Functional and Constraint Logic Programming

Self Cite

View full text Add to dashboard Cite

Abstract. In this paper we present our first steps towards a new system to compile functional logic programs of the source language Curry into purely functional Haskell programs. Our implementation is based on the idea to represent non-deterministic results as values of the data types corresponding to the results. This enables the application of various search strategies to extract values from the search space. We show by several benchmarks that our implementation can compete with or outperform other existing implementations of Curry.

show abstract

Multi-paradigm Declarative Languages

Cited by 72 publications

References 75 publications

Resolving Inductive Definitions with Binders in Higher-Order Typed Functional Programming

Resolving Inductive Definitions with Binders in Higher-Order Typed Functional Programming

Declarative Programming of User Interfaces

KiCS2: A New Compiler from Curry to Haskell

Contact Info

Product

Resources

About