Nondeterminism Analysis of Functional Logic Programs

Braßel, Bernd; Hanus, Michael

doi:10.1007/11562931_21

Cited by 6 publications

(9 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Previous work on non-determinism checking and analysis (Hanus & Steiner, 1998;Hanus & Steiner, 2000;Braßel & Hanus, 2005) for the functional logic language Curry (Hanus & Zartmann, 1994) could be fruitfully applied to αML. This would be beneficial because the evaluation of a branching expression creates multiple non-deterministic branches of the configuration, but there is no way to subsequently bring these branches back together and continue the computation in a deterministic way.…”

Section: Discussionmentioning

confidence: 99%

Contextual equivalence for inductive definitions with binders in higher order typed functional programming

Lakin¹,

Pitts²

2013

J. Funct. Prog.

View full text Add to dashboard Cite

Correct handling of names and binders is an important issue in meta-programming. This paper presents an embedding of constraint logic programming into the αML functional programming language, which provides a provably correct means of implementing proof search computations over inductive definitions involving names and binders modulo α-equivalence. We show that the execution of proof search in the αML operational semantics is sound and complete with regard to the model-theoretic semantics of formulae, and develop a theory of contextual equivalence for the subclass of αML expressions which correspond to inductive definitions and formulae. In particular, we prove that αML expressions, which denote inductive definitions, are contextually equivalent precisely when those inductive definitions have the same model-theoretic semantics. This paper is a revised and extended version of the conference paper (Lakin, M. R. & Pitts, A. M. (2009) Resolving inductive definitions with binders in higher-order typed functional programming. InProceedings of the 18th European Symposium on Programming (ESOP 2009), Castagna, G. (ed), Lecture Notes in Computer Science, vol. 5502. Berlin, Germany: Springer-Verlag, pp. 47–61) and draws on material from the first author's PhD thesis (Lakin, M. R. (2010)An Executable Meta-Language for Inductive Definitions with Binders. University of Cambridge, UK).

show abstract

Section: Discussionmentioning

confidence: 99%

Contextual equivalence for inductive definitions with binders in higher order typed functional programming

Lakin¹,

Pitts²

2013

J. Funct. Prog.

View full text Add to dashboard Cite

show abstract

“…As discussed in Section 1, CurryBrowser offers a generic interface to integrate various analysis tools for declarative programs. Since flat programs are an appropriate abstraction level for implementing such tools [8,15,16], this interface is based on them. To be more concrete, CurryBrowser provides the following type definition to connect program analyzers (where a is the type of the analysis result):…”

Section: Methodsmentioning

confidence: 99%

A generic analysis environment for declarative programs

Hanus

2005

Proceedings of the 2005 ACM SIGPLAN Workshop on Curry and Functional Logic Programming

Self Cite

View full text Add to dashboard Cite

In this paper we present CurryBrowser, a generic analysis environment for the declarative multi-paradigm language Curry. CurryBrowser supports browsing through the implementation of an application written in Curry, i.e., the main module and all directly or indirectly imported modules. Each module can be shown in different formats (e.g., source code, interface, intermediate code) and, inside each module, various properties of functions defined in this module can be analyzed. In order to support the integration of various program analyses, CurryBrowser has a generic interface to connect local and global analyses implemented in Curry. CurryBrowser is completely implemented in Curry using libraries for GUI programming and meta-programming.

show abstract

“…On the other hand, it is sometimes possible to express "topdown oriented" analyses, like a groundness analysis in logic programming, in a bottom-up manner by choosing appropriate abstract domains. For instance, [7] presents a type and effect system to analyze groundness and non-determinism information in functional logic programs. This can be implemented as a bottom-up analysis, as discussed later in this paper.…”

Section: Modeling Program Analysesmentioning

confidence: 99%

“…This might be due to the fact that the dependencies between the 6 CASS is part of the distributions of the Curry systems KiCS2 [8] and PAKCS [19]. 7 http://mdb.ps.informatik.uni-kiel.de/ modules are complex so that there are not many opportunities for an independent analysis of modules, i.e., workers might have to wait for the termination of the analysis of modules which are imported by many other modules. Nevertheless, the approach shows that there is a potential to exploit the computing power offered by modern computers.…”

Section: Practical Evaluationmentioning

confidence: 99%

“…It is a dependency analysis so that it can be defined as follows (in this case, True is the bottom element since the abstract value False denotes "might not be totally defined"): Hence, a function is totally defined if it is pattern complete and depends only on totally defined functions. Further examples of combined analyses are the higher-order function analysis used in KiCS2 (see above) where the higher-order status of a function depends on the higherorder status of its argument types, and the non-determinism analysis of [6] where nondeterminism effects are analyzed based on groundness information.…”

Section: Implementing Program Analysesmentioning

confidence: 99%

See 1 more Smart Citation

A modular and generic analysis server system for functional logic programs

Hanus

Skrlac

2014

Proceedings of the ACM SIGPLAN 2014 Workshop on Partial Evaluation and Program Manipulation

Self Cite

View full text Add to dashboard Cite

We present the design, implementation, and application of a system, called CASS, for the analysis of functional logic programs. The system is generic so that various kinds of analyses (e.g., groundness, non-determinism, demanded arguments) can be easily integrated. In order to analyze larger applications consisting of dozens or hundreds of modules, CASS supports a modular and incremental analysis of programs. Moreover, it can be used by different programming tools, like documentation generators, analysis environments, program optimizers, as well as Eclipse-based development environments. For this purpose, CASS can also be invoked as a server system to get a language-independent access to its functionality. CASS is completely implemented in the functional logic language Curry as a master/worker architecture to exploit parallel or distributed execution environments.

show abstract

Nondeterminism Analysis of Functional Logic Programs

Cited by 6 publications

References 18 publications

Contextual equivalence for inductive definitions with binders in higher order typed functional programming

Contextual equivalence for inductive definitions with binders in higher order typed functional programming

A generic analysis environment for declarative programs

A modular and generic analysis server system for functional logic programs

Contact Info

Product

Resources

About