From Contracts Towards Dependent Types: Proofs by Partial Evaluation

Authors:
Stephan Herhut;Sven-Bodo Scholz;Robert Bernecky;Clemens Grelck;Kai Trojahner
Affiliations:
University of Hertfordshire, U.K.;University of Hertfordshire, U.K.;University of Toronto, Canada;University of Hertfordshire, U.K. and University of Lübeck, Germany;University of Lübeck, Germany
Venue:
Implementation and Application of Functional Languages
Year:
2008

Citing 19
Cited 3

SISAL versus FORTRAN: a comparison using the Livermore loops

Proceedings of the 1990 ACM/IEEE conference on Supercomputing
Eiffel: the language

Eiffel: the language
Indexed types

Theoretical Computer Science - Special volume on computer algebra
Dependent types in practical programming

Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Reducing computational complexity with array predicates

APL '98 Proceedings of the APL98 conference on Array processing language
ZPL: A Machine Independent Programming Language for Parallel Computers

IEEE Transactions on Software Engineering - Special issue on architecture-independent languages and software tools for parallel processing
Types and programming languages

Types and programming languages
Applying "Design by Contract"

Computer
jContractor: A Reflective Java Library to Support Design by Contract

Reflection '99 Proceedings of the Second International Conference on Meta-Level Architectures and Reflection
Design by Contract for Python

APSEC '97 Proceedings of the Fourth Asia-Pacific Software Engineering and International Computer Science Conference
iContract - The Java(tm) Design by Contract(tm) Tool

TOOLS '98 Proceedings of the Technology of Object-Oriented Languages and Systems
The view from the left

Journal of Functional Programming
Single Assignment C: efficient support for high-level array operations in a functional setting

Journal of Functional Programming
Hybrid type checking

Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A verifiable SSA program representation for aggressive compiler optimization

Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Extended static checking for haskell

Proceedings of the 2006 ACM SIGPLAN workshop on Haskell
Parallel Programmability and the Chapel Language

International Journal of High Performance Computing Applications
Shape cliques

ACM SIGAPL APL Quote Quad
On optimising shape-generic array programs using symbolic structural information

IFL'06 Proceedings of the 18th international conference on Implementation and application of functional languages

Symbiotic expressions

IFL'09 Proceedings of the 21st international conference on Implementation and application of functional languages
Asynchronous adaptive optimisation for generic data-parallel array programming

Concurrency and Computation: Practice & Experience
Partial evaluation as universal compiler tool: experiences from the SAC Eco system

Proceedings of the ACM SIGPLAN 2014 Workshop on Partial Evaluation and Program Manipulation

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.