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. © Springer-Verlag Berlin Heidelberg 2008.
Cite
CITATION STYLE
Herhut, S., Scholz, S. B., Bernecky, R., Grelck, C., & Trojahner, K. (2008). From contracts towards dependent types: Proofs by partial evaluation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5083 LNCS, pp. 254–273). https://doi.org/10.1007/978-3-540-85373-2_15
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
