Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-14T10:24:55.990Z Has data issue: false hasContentIssue false
  • English
  • Français

Deciding inclusion of set constants over infinite non-strict data structures

Published online by Cambridge University Press:  18 July 2007

Manfred Schmidt-Schauss,
David Sabel and
Marko Schütz
Manfred Schmidt-Schauss
Affiliation:
Institut für Informatik, Johann Wolfgang Goethe-Universität, Postfach 11 19 32, 60054 Frankfurt, Germany; schauss@ki.informatik.uni-frankfurt.de
David Sabel
Affiliation:
Institut für Informatik, Johann Wolfgang Goethe-Universität, Postfach 11 19 32, 60054 Frankfurt, Germany; schauss@ki.informatik.uni-frankfurt.de
Marko Schütz
Affiliation:
Dept. of Mathematics and Computing Science, University of the South Pacific, Suva, Fiji Islands; schutz_m@usp.ac.fj
Get access

Abstract

Various static analyses of functional programming languages that permit infinite data structures make use of set constants like Top, Inf, and Bot, denoting all terms, all lists not eventually ending in Nil, and all non-terminating programs, respectively. We use a set language that permits union, constructors and recursive definition of set constants with a greatest fixpoint semanticsin the set of all, also infinite, computable trees,where all term constructors are non-strict.This paper provesdecidability, in particular DEXPTIME-completeness, of inclusion of co-inductively defined sets by using algorithms and results from tree automata and set constraints. The test for set inclusion is required by certain strictness analysis algorithms in lazy functional programming languagesand could also be the basis for further set-based analyses.

Keywords

Functional programming languageslambda calculusstrictness analysisset constraintstree automata

Information

Type
Research Article
Information
RAIRO - Theoretical Informatics and Applications , Volume 41 , Issue 2 , April 2007, pp. 225 - 241
Copyright
© EDP Sciences, 2007

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

S. Abramsky and C. Hankin, Abstract interpretation of declarative languages. Ellis Horwood, (1987).
Aiken, A., Set constraints: Results, applications, and future directions, in Second Workshop on the Principles and Practice of Constraint Programming, Orcas Island, Washington, Springer-Verlag. Lect. Notes Comput. Sci. 874 (1994) 171–179.
A. Aiken, D. Kozen, M.Y. Vardi and E.L. Wimmers, The complexity of set constraints, in Proc. CSL 1993, Swansea, Wales (1993) 1–17.
Z.M. Ariola and S. Blom, Cyclic lambda calculi, in TACS, Sendai, Japan (1997) 77–106.
Ariola, Z.M. and Klop, J.W., Lambda calculus with explicit recursion. Inform. Comput. 139 (1997) 154–233. CrossRef
L. Bachmair, H. Ganzinger and U. Waldmann, Set constraints are the monadic class, in Proc. 8th Proc Symp. Logic in Computer Science, Swansea, Wales (1993) 75–83.
G. Burn, Lazy Functional Languages: Abstract Interpretation and Compilation. Pitman, London, (1991).
Burn, G.L., Hankin, C.L. and Abramsky, S., The theory for strictness analysis for higher order functions, in Programs as Data Structures, edited by H. Ganzinger and N.D. Jones. Lect. Notes Comput. Sci. 217 (1985) 42–62. CrossRef
Charatonik, W. and Podelski, A., Co-definite set constraints, in Proceedings of the 9th International Conference on Rewriting Techniques and Applications, edited by T. Nipkow, Springer-Verlag. Lect. Notes Comput. Sci. 1379 (1998) 211–225. CrossRef
D. Clark, C. Hankin, and S. Hunt, Safety of strictness analysis via term graph rewriting. In SAS 2000 (2000) 95–114.
H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison and M. Tommasi. Tree automata techniques and applications. Available on: http://www.grappa.univ-lille3.fr/tata, 1997. release October, 1rst 2002.
Coppo, M., Damiani, F. and Giannini, P., Strictness, totality, and non-standard type inference. Theoret. Comput. Sci. 272 (2002) 69–112. CrossRef
P. Cousot and R. Cousot, Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints, in Conference Record of the Fourth ACM Symposium on Principles of Programming Languages, ACM Press (1977) 252–252.
B.A. Davey and H.A. Priestley, Introduction to Lattices and Order. Cambridge University Press, Cambridge, (1992).
P. Devienne, J.-M. Talbot and S. Tison, Co-definite set constraints with membership expressions, in JICSLP'98: Proceedings of the 1998 joint international conference and symposium on Logic programming, Cambridge, MA, USA, MIT Press (1998) 25–39.
T.P. Jensen, inference of polymorphic and conditional strictness properties, in Symposium on Principles of Programming Languages, San Diego, ACM Press. (1998) 209–221.
S.P. Jones, Haskell 98 Language and Libraries. Cambridge University Press (2003). www.haskell.org
Tsun-Ming Kuo and P. Mishra, Strictness analysis: A new perspective based on type inference, in Functional Programming Languages and Computer Architecture, ACM Press, (1989) 260–272.
Lackner Solberg Gasser, K., Riis Nielson, H. and Nielson, F., Strictness and totality analysis. Sci. Comput. Programming 31 (1998) 113–145. CrossRef
Launchbury, J. and Peyton Jones, S., State in Haskell. Lisp Symbolic Comput. 8 (1995) 293–341. CrossRef
Mauborgne, L., Improving the representation of infinite trees to deal with sets of trees, in ESOP '00: Proceedings of the 9th European Symposium on Programming Languages and Systems. Lect. Notes Comput. Sci. 1782 (2000) 275–289. CrossRef
Moran, A.K.D., Sands, D. and Carlsson, M., Erratic fudgets: A semantic theory for an embedded coordination language. Sci. Comput. Programming 46 (2003) 99–135. CrossRef
A. Mycroft, Abstract Interpretation and Optimising Transformations for Applicative Programs. Ph.D. thesis, University of Edinburgh (1981).
E. Nöcker, Strictness analysis using abstract reduction. Technical Report 90-14, Department of Computer Science, University of Nijmegen (1990).
E. Nöcker, Strictness analysis by abstract reduction in orthogonal term rewriting systems. Technical Report 92-31, University of Nijmegen, Department of Computer Science (1992).
E. Nöcker, Strictness analysis using abstract reduction. In Functional Programming Languages and Computer Architecture, ACM Press, (1993) 255–265.
Pape, D., Higher order demand propagation. In Implementation of Functional Languages (IFL '98) London, edited by K. Hammond, A.J.T. Davie and C. Clack, Springer-Verlag. Lect. Notes Comput. Sci. 1595 (1998) 155–170.
D. Pape, Striktheitsanalysen funktionaler Sprachen. Ph.D. thesis, Fachbereich Mathematik und Informatik, Freie Universität Berlin, (2000). In German.
Paterson, R., Compiling laziness using projections, in Static Analysis Symposium, Aachen, Germany. Lect. Notes Comput. Sci. 1145 (1996) 255–269. CrossRef
R. Plasmeijer and M. van Eekelen, The concurrent Clean language report: Version 1.3 and 2.0. Technical report, Dept. of Computer Science, University of Nijmegen, 2003. http://www.cs.kun.nl/~clean/
Rychlikowski, P. and Truderung, T., in Computer Science Logic, 18th International Workshop, CSL 2004, 13th Annual Conference of the EACSL, Karpacz, Poland, September 20-24, 2004, Proceedings, Set constraints on regular terms, edited by J. Marcinkowski and A. Tarlecki, Springer. Lect. Notes Comput. Sci. 3210 (2004) 458–472. CrossRef
M. Schmidt-Schauß, S. Eric Panitz and M. Schütz, Strictness analysis by abstract reduction using a tableau calculus, in Proc. of the Static Analysis Symposium. Lect. Notes Comput. Sci. 983 (1995) 348–365.
M. Schmidt-Schauß, M. Schütz and D. Sabel, On the safety of Nöcker's strictness analysis. Technical Report Frank-19, Institut für Informatik. J.W. Goethe-University (2004).
M. Schmidt-Schauß, M. Schütz and D. Sabel, A complete proof of the safety of Nöcker's strictness analysis. Technical Report Frank-20, Institut für Informatik. J.W. Goethe-University, (2005).
M. Schütz, Analysing demand in nonstrict functional programming languages. Dissertation, J.W.Goethe-Universität Frankfurt, 2000. Available at http://www.ki.informatik.uni-frankfurt.de/papers/marko
Seidl, H., Deciding equivalence of finite tree automata. SIAM J. Comput. 19 (1990) 424–437. CrossRef
W. Thomas, Automata on infinite objects. In Handbook of Theoretical Computer Science, Formal Models and Semantics (B), edited by J. van Leeuwen, Elsevier (1990) 133–192.
P. Wadler, Strictness analysis on non-flat domains (by abstract interpretation over finite domains). In Abstract Interpretation of Declarative Languages, Chap. 12. Edited by S. Abramsky and C. Hankin, Ellis Horwood Limited, Chichester (1987).
Wadler, P. and Hughes, J., Projections for strictness analysis. In Functional Programming Languages and Computer Architecture. Lect. Notes Comput. Sci. 274 (1987) 385–407. CrossRef