Zobrazeno 1 - 10
of 33
pro vyhledávání: '"Frank Huch"'
Autor:
Marcus Riemer, Frank Huch
Publikováno v:
Proceedings of the 11th Computer Science Education Research Conference.
Publikováno v:
Electronic Notes in Theoretical Computer Science. 216:111-124
Most implementations of functional and functional logic languages treat numbers and the basic numeric operations as external entities. The main reason for this is efficiency. However, this basic design decision has many unfortunate consequences for a
Publikováno v:
ICFP
Scopus-Elsevier
Scopus-Elsevier
Designing debugging tools for lazy functional programming languages is a complex task which is often solved by expensive tracing of lazy computations. We present a new approach in which the information collected as a trace is reduced considerably (ki
Autor:
Frank Huch, Parissa H. Sadeghi
Publikováno v:
Electronic Notes in Theoretical Computer Science. 177:107-122
Debugging by observing the evaluation of expressions and functions is a useful approach for finding bugs in lazy functional and functional logic programs. However, adding and removing observation annotations to a program is an effort making the use o
Publikováno v:
Journal of Symbolic Computation. 40(1):795-829
Declarative multi-paradigm languages combine the most important features of functional, logic and concurrent programming. The computational model of such integrated languages is usually based on a combination of two different operational principles:
Autor:
Volker Stolz, Frank Huch
Publikováno v:
Electronic Notes in Theoretical Computer Science. 113:201-216
In this article we use model checking techniques to debug Concurrent Haskell programs. LTL formulas specifying assertions or other properties are verified at runtime. If a run which falsifies a formula is detected, the debugger emits a warning and re
Autor:
Frank Huch, Jan Christiansen
Publikováno v:
ICFP
This paper presents an approach to searching for deadlocks in Concurrent Haskell programs. The search is based on a redefinition of the IO monad which allows the reversal of Concurrent Haskells concurrency primitives. Hence, it is possible to impleme
Publikováno v:
Electronic Notes in Theoretical Computer Science. 86:35-51
This paper deals with a framework to program autonomous robots in the declarative multi-paradigm language Curry. Our goal is to apply a high-level declarative programming language for the programming of embedded systems. For this purpose, we use a sp
Publikováno v:
Electronic Notes in Theoretical Computer Science. 70:62-83
Practical declarative multi-paradigm languages combine the main features of functional, logic and concurrent programming (e.g., laziness, sharing, higher-order, logic variables, non-determinism, search strategies). Usually, these languages also inclu
Publikováno v:
Electronic Notes in Theoretical Computer Science. 76:1-19
In this work we provide a semantic description of functional logic languages covering notions like laziness, sharing, and non-determinism. Such a semantic description is essential, for instance, to have appropriate language deflnitions in order to re