Christiansen, J. ., & Fischer, S. . (2008). EasyCheck — Test Data for Free. In Functional and Logic Programming (S. 322–336). Springer Berlin Heidelberg.
Abstract
We present a lightweight, automated tool for specification-based testing of declarative programs written in the functional logic programming language Curry and emphasize the usefulness of logic features in its implementation and use. Free variables, nondeterminism and encapsulated search turn out to be elegant and powerful means to express test-data generation.
Labes, A. ., Staufenberger, T. ., & Imhoff, J. F. (2008). Novel glycoside hydrolases for biotechnological application from marine resources. BioCat2008-Tagung. Abgerufen von http://oceanrep.geomar.de/691/
Labes, A. ., Karlsson, N. ., Fridjonsson, O. ., Turner, P. ., Hreggvidson, G. ., Kristjansson, J. ., … Schönheit, P. . (2008). Novel members of glycoside hydrolase family 13 derived from environmental DNA. Applied and Environmental Microbiology, 74, 1914–1921. Abgerufen von http://oceanrep.geomar.de/7384/
Karlsson, E. N., Labes, A. ., Turner, P. ., Fridjonsson, O. H., Wennerberg, C. ., Pozzo, T. ., … Schönheit pages = 1006- 1014 P. (2008). Differences and similarities in enzymes from the neopullulanase subfamily isolated from thermophilic species. Biologia, 63. http://doi.org/10.2478/s11756-008-0171-3
Petersen, K. ., Feldt, R. ., Mujtaba, S. ., & Mattsson, M. . (2008). Systematic mapping studies in software engineering. In 12th International Conference on Evaluation and Assessment in Software Engineering (EASE) 12 (S. 1–10).
Gärtner, A. ., Krämer, M. ., Kajahn, I. ., Labes, A. ., Nagel, K. ., Stöhr, R. ., … Imhoff, J. F. (2008). Exploiting the pharmaceutical potential of Marine Microorganisms. XXX. Congreso Chileno de Microbiolog\ ia. Abgerufen von http://oceanrep.geomar.de/6763/
Braßel, B. ., & Christiansen, J. . (2008). Denotation by Transformation. In A. . King (Hrsg.), Logic-Based Program Synthesis and Transformation (S. 90–105). Springer Berlin Heidelberg.
Abstract
It has often been observed that a point-free style of programming provides a more abstract view on programs. We aim to use the gain in abstraction to obtain a denotational semantics for functional logic languages in a straightforward way. Here we propose a set of basic operations based on which arbitrary functional logic programs can be transformed to point-free programs. The semantics of the resulting programs are strict but, nevertheless, the semantics of the original program is preserved.