Producing all ideals of a forest, functionally

Journal of Functional Programming

Volumn 13, Issue 5, 2003, Pages 945-956

  Filliâtre, Jean Christophe ^a   Pottier, François ^b  

^a UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

^b INRIA ROCQUENCOURT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

GRAY CODES;

ALGORITHMS; CODES (SYMBOLS); COMPUTER PROGRAMMING LANGUAGES;

MATHEMATICAL PROGRAMMING;

EID: 0042411217     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0956796803004763     Document Type: Article

References (11)

1. Barras, B., Herbelin, H. et al. (2002) The Coq Proof Assistant. URL: http://coq.inria.fr/.
2. Cejtin, H., Jagannathan, S. and Weeks, S. (2000) Flow-directed closure conversion for typed languages. In: Smolka, G., editor, Proceedings 2000 European Symposium on Programming (ESOP'00): Lecture Notes in Computer Science 1782, pp. 56-71. Springer Verlag.
3. Cejtin, H., Fluet, M., Jagannathan, S. and Weeks, S. (2002) The M Lton Standard M L Compiler. URL: http://www.mlton.org/.
4. Danvy, O. and Nielsen, L. R. (2001) Defunctionalization at work. Third International Conference on Principles and Practice of Declarative Programming (PPDP 2001). (Also available as BRIGS Research Report RS-01-23. URL: http://www.brics.dk/RS/01/23/BRICS-RS-01-23.ps.gz.)
5. Filliâtre, J.-C. and Pettier, F. (2002) Functional implementations of Koda and Ruskey's algorithm. URL: http://www.lri.fr/̃filliatr/software.en.html.
6. Knuth, D, E. (2001a) An implementation of Koda and Ruskey's algorithm. URL: http://www-cs-staff.stanford.edu/̃knuth/programs.html.
7. Knuth, D. E. (2001b) The Art of Computer Programming. Addison-Wesley.
8. Koda, Y. and Ruskey, F. (1993) A Gray code for the ideals of a forest poset. J. Algorithms, 15(2), 324-340.
9. Leroy, X., Doligez, D. et al. (2002) The Objective Caml language. URL: http://caml.inria.fr/.
10. Reynolds, J. C. (1998a) Definitional interpreters for higher-order programming languages. Higher-order & Symbolic Computation, 11(4), 363-397.
11. Reynolds, J C. (1998b) Definitional interpreters revisited. Higher-order & Symbolic Computation, 11(4), 355-361.