What is the distinguishing feature of the method?

The most distinguishing feature of the method is that it can be implemented for a full lazy functional language by a small portable library.

What is the main reason why declarative languages have become larger?

With improvements in the implementation of declarative languages and computer architecture, applications written in declarative languages have become larger.

What is the function last intended to do?

last xs | append ys [y] =:= xs = y append [] ys = yswhere y,ys free append (x:xs) ys = x:append xs xsThe function last is intended to compute the last element of a list by solving the equation append ys [y] =:= xs.

What is the arity of a value event?

There are two more important things the authors have to know about a Value Event: (1) Because a value is built from constructor symbols, the authors need the arity of the constructor.

What is the function that is used to isolate the bug?

To isolate the bug, the authors set an observation point at the call of the non-deterministic function of their program:perm (x:xs) = observe oInsert "insert" insert x (perm xs)where oInsert = oInt ~> oList oInt ~>

What is the difference between observation and full recording?

Observation with COOSy does slow down computation considerably but only proportionally to the size of the observed data and not to the length of the full computation.

Open AccessBook Chapter10.1007/978-3-540-24836-1_14

Observing functional logic computations

Bernd Braßel, +3 more

- 18 Jun 2004

- pp 193-208

TL;DR: A lightweight approach to debugging functional logic programs by observations is presented, implemented for the language Curry, and COOSy covers all aspects of modern functional logic multiparadigm languages.

Abstract: A lightweight approach to debugging functional logic programs by observations is presented, implemented for the language Curry. The Curry Object Observation System (COOSy) comprises a portable library plus a viewing tool. A programmer can observe data structures and functions by annotating expressions in his program. The possibly partial values of observed expressions that are computed during program execution are recorded in a trace file, including information on non-deterministic choices and logical variables. A separate viewing tool displays the trace content. COOSy covers all aspects of modern functional logic multiparadigm languages such as lazy evaluation, higher order functions, non-deterministic search, logical variables, concurrency and constraints. Both use and implementation of COOSy are described.

AI Agents for this Paper

Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps

Most frequently asked questions

1. What are the contributions in this paper?

A lightweight approach to debugging functional logic programs by observations is presented, implemented for the language Curry.

2. What are the future works in this paper?

Furthermore, the authors intend to extend the viewing tool in the future.. Animations would give the programmer further insights into the workings of his program and might be particularly useful for educational purposes.

3. What is the purpose of the type descriptor oOpaque?

The type descriptor oOpaque becomes vital when the authors observe polymorphic values so that the types of components are statically unknown at the observation point:

4. What is the purpose of this paper?

In this paper the authors extended the debugging-by-observation method as introduced and implemented by HOOD [5] for functional languages to functional logic languages.

Fig. 2. Graphical representation of COOSy trace of Example 7

Fig. 4. Separating the extended COOSy trace of Example 9

Citations

•Proceedings Article•10.1145/1273920.1273930

Systematic generation of glass-box test cases for functional logic programs

Sebastian Fischer, +1 more

- 14 Jul 2007

TL;DR: This work employs the narrowing-based execution mechanism of the functional logic programming language Curry to automatically generate a system of test cases for glass-box testing of Curry programs, and presents a novel coverage criterion for this programming paradigm.

...read moreread less

Proceedings Article•10.1145/1013963.1013984

A semantics for tracing declarative multi-paradigm programs

Bernd Brassel, +3 more

- 24 Aug 2004

TL;DR: This work defines an instrumented operational semantics that generates not only the computed values and bindings but also an appropriate data structure---a sort of redex trail---which can be used to trace computations at an adequate level of abstraction.

...read moreread less

The Kiel Curry System KiCS.

Bernd Brassel, +1 more

- 01 Jan 2007

TL;DR: The Kiel Curry System is presented, a new implementation of the lazy functional logic language Curry with main features beyond other Curry implementations: flexible search control by means of search trees, referentially transparent encapsulation and sharing across non-determinism.

...read moreread less

Book Chapter•10.1007/978-3-642-00675-3_13

The Kiel Curry System KiCS

Bernd Braßel, +1 more

- 21 Apr 2009

TL;DR: The Kiel Curry System (KCS) as mentioned in this paper is a new implementation of the Curry language with flexible search control by means of search trees, referentially transparent encapsulation and sharing across non-determinism.

...read moreread less

•Book Chapter•10.1007/978-3-642-20775-4_2

Transforming functional logic programs into monadic functional programs

Bernd Braßel, +3 more

- 17 Jan 2010

TL;DR: This work defines a systematic method to transform lazy functional logic programs into monadic programs with explicit sharing, which results in a transformation scheme which produces high-level and flexible target code.

...read moreread less

...

Expand

References

•Book

Haskell 98 language and libraries : the revised report

Peyton Jones, +1 more

- 01 Jan 2003

TL;DR: The Haskell 98 Language: Lexical structure, Declarations and bindings, Predefined types and classes, and Libraries.

...read moreread less

1.4K

•Book

Algorithmic Program Debugging

Ehud Shapiro

- 14 Apr 1983

TL;DR: An algorithm that can fix a bug that has been identified, and integrate it with the diagnosis algorithms to form an interactive debugging system that can debug programs that are too complex for the Model Inference System to synthesize.

...read moreread less

1.2K

Declarative debugging for lazy functional languages

Henrik Nilsson

- 01 Jan 1998

TL;DR: This thesis presents a technique for debugging lazy functional programs declaratively and an efficient implementation of a declarative debugger for a large subset of Haskell, believed to be the first implementation of such a debugger which is sufficiently efficient to be useful in practice.

...read moreread less

187

Book•10.1007/3-540-63237-9

Implementation of Functional Languages

Werner Kluge

- 01 Jan 1997

183

Book•10.1007/3-540-61756-6

Programming Languages: Implementations, Logics, and Programs

Hugh Glaser, +2 more

- 01 Jan 1995

129

...

Expand

Observing functional logic computations

Chat with Paper

AI Agents for this Paper

Most frequently asked questions

1. What are the contributions in this paper?

2. What are the future works in this paper?

3. What is the purpose of the type descriptor oOpaque?

4. What is the purpose of this paper?

5. What is the distinguishing feature of the method?

6. What is the main reason why declarative languages have become larger?

7. What is the function last intended to do?

8. What is the arity of a value event?

9. What is the function that is used to isolate the bug?

10. What is the difference between observation and full recording?

Figures

Citations

Systematic generation of glass-box test cases for functional logic programs

A semantics for tracing declarative multi-paradigm programs

The Kiel Curry System KiCS.

The Kiel Curry System KiCS

Transforming functional logic programs into monadic functional programs

References

Haskell 98 language and libraries : the revised report

Algorithmic Program Debugging

Declarative debugging for lazy functional languages

Implementation of Functional Languages

Programming Languages: Implementations, Logics, and Programs

Related Papers (5)

Encapsulating Non-Determinism in Functional Logic Computations.

A needed narrowing strategy

Debugging Haskell by Observing Intermediate Data Structures

TOY: A Multiparadigm Declarative System

Haskell 98 language and libraries : the revised report