The lambda calculus is a formal symbolic term rewrite system that has been used for many years both as a mechanism for defining the semantics of programming languages, and as the basis for functional programming languages. In this paper, we describe a completely visual representation for lambda expressions, VEX, that has several advantages over traditional textual lambda calculus. Although VEX ...

ion λx.A In the last case λx. is a binder and free occurrences of x in A become bound . A term in which all variables are bound is said to be closed otherwise it is open. The motivating idea is that closed term represent functions. The intended meaning of AB is the application of function A to argument B while λx.A is the function which for input x returns A. Terms which are the same except for...

Recursive functions defined on a coalgebraic datatype C may not converge if there are cycles in the input, that is, if the input object is not well-founded. Even so, there is often a useful solution. Unfortunately, current functional programming languages provide no support for specifying alternative solution methods. In this paper we give numerous examples in which it would be useful to do so:...

First-order temporal logics are notorious for their bad computational behaviour. It is known that even the two-variable monadic fragment is highly undecidable over various timelines. However, following the introduction of the monodic formulas (where temporal operators can be applied only to subformulas with at most one free variable), there has been a renewed interest in understanding extension...

class Closure { abstract Object apply(Object arg); Object apply2(Object arg1, Object arg2) { return ((Closure)(apply(arg1))).apply(arg2); } } abstract class Closure2 extends Closure { Object apply(Object arg) { return new PartialApplication(this, arg); } abstract Object apply2(Object arg1, Object arg2); } class PartialApplication extends Closure { Closure2 fn; Object arg1; PartialApplication(Cl...

calls. In dynamic binding, free variables in a method obtain their values from the environment from which the method is called, rather from the environment in which the method is de ned [Abelson et al. 85]. Functional programming languages prefer static binding, an alternative approach where the de nition environment is used instead of the application environment in the evaluation of a method. ...

Constraint merging tableaux maintain a system of all closing substitutions of all subtableau up to a certain depth, which is incrementally increased. This avoids backtracking as necessary in destructive first order free variable tableaux. The first successful implementation of this paradigm was given in an object-oriented style. We analyse the reasons why lazy functional implementations so far ...

Multi-modal imaging-guided synergistic photodynamic therapy (PDT) and photothermal (PTT) show great benefits in cancer treatment. The phototheranostics with near-infrared (NIR) absorption, high reactive oxygen species (ROS) generation conversion efficiency is highly desirable. Here, we designed synthesized an “acceptor-donor-acceptor” (A-D-A) structured molecule named IDCIC, strong absorbance t...

We present a lightweight, automated tool for specificationbased testing of declarative programs written in the functional logic programming language Curry and emphasize the usefulness of logic features in its implementation and use. Free variables, nondeterminism and encapsulated search turn out to be elegant and powerful means to express test-data generation.

Economic aspects of possible land use strategies and protection measures in coastal zones as a response to global environmental change are examined. First, some key elements are mentioned that are of critical importance for water and land management in coastal zones. Next, various socio-economic repercussions are discussed. In this context, research needs will be addressed. Subsequently, these ...