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.
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.
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).
Braßel, B. ., & Christiansen, J. . (2008). A Relation Algebraic Semantics for a Lazy Functional Logic Language. In R. . Berghammer, B. . Möller, & G. . Struth (Hrsg.), Relations and Kleene Algebra in Computer Science (S. 37–53). Springer Berlin Heidelberg.
Abstract
We propose a relation algebraic semantics along with a concrete model for lazy functional logic languages. The resulting semantics provides several interesting advantages over former approaches for this class of languages. On the one hand, the high abstraction level of relation algebra allows equational reasoning leading to concise proofs about functional logic programs. On the other hand the proposed approach features, in contrast to former approaches with a comparable level of abstraction, an explicit modeling of sharing. The latter property gives rise to the expectation that the presented framework can be used to clarify notions currently discussed in the field of functional logic languages, like constructive negation, function inversion and encapsulated search. All of these topics have proved to involve subtle problems in the context of sharing and laziness in the past.
erez-Guirao, M. D. P., Lübben, R. ., Zhao, Z. ., Kaiser, T. ., & Jobmann, K. . (2007). Cross-Layer MAC Design for IR-UWB Networks. In IEEE IWCLD (S. 113–116). http://doi.org/10.1109/IWCLD.2007.4379050 (Original work published 2025)
Petersen, K. ., Zaha, J. M., & Metzger, A. . (2007). Variability-driven selection of services for service compositions. In International Conference on Service-Oriented Computing (S. 388–400).
Schlipf, D. ., Fernandes, P. B., & Trierweiler, J. O. (2006). Modeling and identification of nonlinear systems using MIMO LEM-Hammerstein structure. In Workshop on Solving Industrial Control and Optimization Problems. Gramado, Brazil. http://doi.org/10.18419/opus-8175 (Original work published 2025)
Fernandes, P. B., Schlipf, D. ., & Trierweiler, J. O. (2006). Modeling and identification of nonlinear systems using SISO LEM-Hammerstein and LEM-Wiener model structures. In 6th IFAC Symposium on Advanced Control of Chemical Processes (Bd. 39, S. 1101–1106). http://doi.org/10.3182/20060402-4-br-2902.01101 (Original work published 2025)
Petersen, K. ., Bramsiepe, N. ., & Pohl, K. . (2006). Applying variability modeling concepts to support decision making for service composition. In 2006 Service-Oriented Computing: Consequences for Engineering Requirements (SOCCER 06-RE 06 Workshop) (S. 1–1).