Publikationen

2010

• Free Theorems for Functional Logic Programs

  Christiansen, J. ., Seidel, D. ., & Voigtländer, J. . (2010). Free Theorems for Functional Logic Programs. In Proceedings of the 4th ACM SIGPLAN Workshop on Programming Languages Meets Program Verification (S. 39–48). http://doi.org/10.1145/1707790.1707797

  • Suche auf Google Scholar
  • DOI Verweis

  Exportformate

  • BibTeX
  • EndNote X3 XML
  • EndNote 7 XML
  • EndNote tagged
  • RIS

  Weiterführende Links

  anzeigen ▸

  • Personenseiten

    • Christiansen, Jan

  • Fachbereich

    • Fachbereich 3: Information und Kommunikation

  Filter Tags

  • 2010
  • Conference Paper
  • • Jan Christiansen
    • Daniel Seidel
    • Janis Voigtländer

2008

• Denotation by Transformation

  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

  anzeigen ▸

  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.

  • Suche auf Google Scholar

  Exportformate

  • BibTeX
  • EndNote X3 XML
  • EndNote 7 XML
  • EndNote tagged
  • RIS

  Weiterführende Links

  anzeigen ▸

  • Personenseiten

    • Christiansen, Jan

  • Fachbereich

    • Fachbereich 3: Information und Kommunikation

  Filter Tags

  • 2008
  • Conference Paper
  • • Bernd Braßel
    • Jan Christiansen
    • Andy King

• A Relation Algebraic Semantics for a Lazy Functional Logic Language

  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

  anzeigen ▸

  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.

  • Suche auf Google Scholar

  Exportformate

  • BibTeX
  • EndNote X3 XML
  • EndNote 7 XML
  • EndNote tagged
  • RIS

  Weiterführende Links

  anzeigen ▸

  • Personenseiten

    • Christiansen, Jan

  • Fachbereich

    • Fachbereich 3: Information und Kommunikation

  Filter Tags

  • 2008
  • Conference Paper
  • • Bernd Braßel
    • Jan Christiansen
    • Rudolf Berghammer
    • Bernhard Möller
    • Georg Struth

• EasyCheck — Test Data for Free

  Christiansen, J. ., & Fischer, S. . (2008). EasyCheck — Test Data for Free. In Functional and Logic Programming (S. 322–336). Springer Berlin Heidelberg.

  Abstract

  anzeigen ▸

  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.

  • Suche auf Google Scholar

  Exportformate

  • BibTeX
  • EndNote X3 XML
  • EndNote 7 XML
  • EndNote tagged
  • RIS

  Weiterführende Links

  anzeigen ▸

  • Personenseiten

    • Christiansen, Jan

  • Fachbereich

    • Fachbereich 3: Information und Kommunikation

  Filter Tags

  • 2008
  • Conference Paper
  • • Jan Christiansen
    • Sebastian Fischer

2006

• A Purely Functional Implementation of ROBDDs in Haskell

  Christiansen, J. ., & Huch, F. . (2006). A Purely Functional Implementation of ROBDDs in Haskell. Trends in Functional Programming, 7, 55–71.

  Abstract

  anzeigen ▸

  This paper presents an implementation of the ROBDD data structure in Haskell. It shows that lazy evaluation can be used to improve the performance of some ROBDD algorithms. While standard implementations construct the whole structure no matter which parts are demanded we use lazy evaluation to provide a more demand driven construction. To achieve this behavior we have to relax a property that guarantees that ROBDDs contain no redundant nodes. All measurements show that relaxing causes only a small number of additional nodes. Furthermore we present an equality check implementation that performs well although it does not make use of canoicity. The canonicity is lost because of the relaxing. The equality check implementation benefits highly from laziness.

  • Suche auf Google Scholar

  Exportformate

  • BibTeX
  • EndNote X3 XML
  • EndNote 7 XML
  • EndNote tagged
  • RIS

  Weiterführende Links

  anzeigen ▸

  • Personenseiten

    • Christiansen, Jan

  • Fachbereich

    • Fachbereich 3: Information und Kommunikation

  Filter Tags

  • 2006
  • Journal Article
  • • Jan Christiansen
    • Frank Huch

2004

• Searching for Deadlocks While Debugging Concurrent Haskell Programs

  Christiansen, J. ., & Huch, F. . (2004). Searching for Deadlocks While Debugging Concurrent Haskell Programs. In Proceedings of the Ninth ACM SIGPLAN International Conference on Functional Programming (S. 28–39). ACM. http://doi.org/10.1145/1016850.1016858

  • Suche auf Google Scholar
  • DOI Verweis

  Exportformate

  • BibTeX
  • EndNote X3 XML
  • EndNote 7 XML
  • EndNote tagged
  • RIS

  Weiterführende Links

  anzeigen ▸

  • Personenseiten

    • Christiansen, Jan

  • Fachbereich

    • Fachbereich 3: Information und Kommunikation

  Filter Tags

  • 2004
  • Conference Paper
  • • Jan Christiansen
    • Frank Huch
  • • concurrent haskell
    • deadlock
    • debugging
    • detecting deadlocks

• Proving Inequational Propositions about Haskell Programs in Coq

  Christiansen, J. ., & Dylus, S. . Proving Inequational Propositions about Haskell Programs in Coq.

  • Suche auf Google Scholar

  Exportformate

  • BibTeX
  • EndNote X3 XML
  • EndNote 7 XML
  • EndNote tagged
  • RIS

  Weiterführende Links

  anzeigen ▸

  • Personenseiten

    • Christiansen, Jan

  • Fachbereich

    • Fachbereich 3: Information und Kommunikation

  Filter Tags

  • Unpublished
  • • Jan Christiansen
    • Sandra Dylus