This paper presents a new type of programming language (also called modeling language) which allows a modeler to combine declarative and algorithmic knowledge, that is, mathematical-logical constraints on the one hand and an instruction sequence defining an algorithm on the other hand. The approach is new in the sense that it strictly separates syntactically and sematically the declarative from...

The Scheme language has three major standards; Revised Report on the Algorithmic language Scheme (R5RS) standardised in February 1998, the Revised Report on Algorithmic language Scheme (R6RS) standardised in September 2007 and the Revised Report on the Algorithmic language Scheme (R7RS) standardised in July 2013. R7RS, the latest standard of Scheme focuses on the R5RS compatibility thus making ...

The Scheme language has three major standards; Revised Report on the Algorithmic language Scheme (R5RS) standardised in February 1998, the Revised Report on Algorithmic language Scheme (R6RS) standardised in September 2007 and the Revised Report on the Algorithmic language Scheme (R7RS) standardised in July 2013. R7RS, the latest standard of Scheme focuses on the R5RS compatibility thus making ...

Establishing local consistency is one of the main algorithmic techniques in temporal and spatial reasoning. A central question for the various proposed temporal and spatial constraint languages is whether local consistency implies global consistency. Showing that a constraint language Γ has this “local-to-global” property implies polynomial-time tractability of the constraint language, and has ...

Programming languages should be designed not by piling feature on top of feature, but by removing the weaknesses and restrictions that make additional features appear necessary. Scheme demonstrates that a very small number of rules for forming expressions, with no restrictions on how they are composed, suffice to form a practical and efficient programming language that is flexible enough to sup...

In genetic systems there is a non-trivial interface between the sequence of symbols which constitutes the chromosome, or 'genotype', and the products which this sequence encodes--the 'phenotype'. This interface can be thought of as a 'computer'. In this case the chromosome is viewed as an algorithm and the phenotype as the result of the computation. In general, only a small fraction of all poss...

The report gives a defining description of the programming language Scheme. Scheme is a statically scoped and properly tail-recursive dialect of the Lisp programming language invented by Guy Lewis Steele Jr. and Gerald Jay Sussman. It was designed to have an exceptionally clear and simple semantics and few different ways to form expressions. A wide variety of programming paradigms, including fu...

The report gives a defining description of the programming language Scheme. Scheme is a statically scoped and properly tail-recursive dialect of the Lisp programming language invented by Guy Lewis Steele Jr. and Gerald Jay Sussman. It was designed to have an exceptionally clear and simple semantics and few different ways to form expressions. A wide variety of programming paradigms, including fu...