The specification and resolution of non-trivial domain constraints has become a well-recognised measure for improving the stability of large software systems. In this paper we propose an approach based on partial evaluation which tries to prove such constraints statically as far as possible and inserts efficient dynamic checks otherwise.
|Title of host publication
|IFL 2007: Implementation and Application of Functional Languages
|Number of pages
|Published - 24.09.2008
|19th International Symposium on Implementation and Application of Functional Languages - Freiburg, Germany
Duration: 21.09.1007 → 23.09.1007
Conference number: 73632