Recursion and dynamic data-structures in bounded space: Towards embedded ML programming

SIGPLAN Notices (ACM Special Interest Group on Programming Languages)

Volumn 34, Issue 9, 1999, Pages 70-80

  Hughes, John ^a   Pareto, Lars ^a  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

DIGITAL STORAGE;

BOUNDED SPACES; DYNAMIC DATA STRUCTURE; FIRST-ORDER VARIANT; FUNCTIONAL LANGUAGES; INFERENCE SYSTEMS; RECURSIONS; SPACE BOUNDS; TYPE SYSTEMS;

STORAGE MANAGEMENT;

EID: 0013115226     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/317765.317785     Document Type: Article

References (8)

1. Joe Armstrong, Robert Virding, and Mike Williams, Concurrent programming in erlang, Prentice Hall, 1993.
2. N. Halbwachs, P. Caspi, P. Raymond, and D. Pilaud, The synchronous dataflow programming language Lustre, Proc. IEEE 79 (1991), no. 9, 1305-1320.
3. John Hughes, Lars Pareto, and Amr Sabry, Proving the correctness of reactive systems using sized types, POPL '96, January 1996.
4. P. J. Landin, The Mechanical Evaluation of Expressions, Computer Journal 6 (1964), no. 4, 308-320.
5. Lars Pareto, Sized types, Licentiate thesis, Chalmers University of Technology, 1998, (http://www.cs.chalmers.se/~pareto/lic.ps).
6. William Pugh, A practical algorithm for exact array dependence analysis, Communications of the ACM 35 (1992), no. 8, 102-114.
7. Mads Tofte, Lars Birkedal, Martin Elsman, Niels Hallenberg, Tommy Højfeld Olesen, Peter Sestoft, and Peter Bertelsen, Programming with regions in the ML Kit, Tech. Report DIKU-TR-97/12, University of Copenhagen.
8. Mads Tofte and Jean-Pierre Talpin, Region-based memory management, Information and Computation 132 (1997), no. 2, 109-176.