Constraint Imperative Programming

Published on February, 2003

Information

Martin Grabmüller: Constraint Imperative Programming, Diploma thesis, Technische Universität Berlin, February 2003.

130 pages, format DIN A4, English.

Abstract

Constraint-based programming languages are declarative programming languages. In constraint programs, the solutions of a problem are obtained by specifying their desired properties, whereas in imperative programs, the steps which lead to a solution must be defined explicitly, rather than being derived automatically from the specification. This work deals with the design and implementation of a programming language which integrates declarative constraints and imperative constructs in order to form a powerful programming paradigm suitable for solving a wide range of problems.

Table of Contents

Download

This Thesis is available electronically: [ PDF ]

BibTeX Entry

@MastersThesis{Grabmueller2003CIP,
  author = 	 {Martin Grabm{\"u}ller},
  title = 	 {{Constraint Imperative Programming}},
  school = 	 {Technische Universit{\"a}t Berlin},
  year = 	 {2003},
  type =	 {Diploma Thesis},
  month =	 {February},
  abstract = {Constraint-based programming languages are declarative
              programming languages.  In constraint programs, the solutions
              of a problem are obtained by specifying their desired
              properties, whereas in imperative programs, the steps which
              lead to a solution must be defined explicitly, rather than
              being derived automatically from the specification.  This 
              work deals with the design and implementation of a programming
              language which integrates declarative constraints and
              imperative constructs in order to form a powerful programming
              paradigm suitable for solving a wide range of problems.}
}