Garbage collection, tail recursion and first-class continuations

Details Garbage collection, tail recursion and first-class continuations Garbage collection, tail recursion and first-class continuations

1995-01-13

1996-12-31

Kriess, Kevin A.

395622, G06F 945

Patent

active

055903320

ABSTRACT:
Methods for implementing garbage collection, tail recursion and first-class continuations for advanced computer applications in a stack-oriented language. Objects, including assignable cells, subprogram closure objects and continuation objects, can be allocated within the invocation frames of the stack-oriented language and these objects will be evacuated from the invocation frames before these frames are deallocated. The techniques enable a tail-call optimization by which a tail-recursion can be executed in constant net space for the invocation frames of the tail-recursive subprogram. The technique, when combined with a continuation-passing style of programming in stack-oriented computer languages, also allows an efficient implemention of garbage collection and first-class continuations. Our technique is useful in the interpretation and compilation of advanced computer languages which incorporate the features of tail-recursion, first-class continuations and/or garbage collection.

REFERENCES:
patent: 4922414 (1990-05-01), Holloway et al.
patent: 4951194 (1990-08-01), Bradley et al.
patent: 5355483 (1994-10-01), Serler
patent: 5386520 (1995-01-01), Gillet
patent: 5396632 (1995-03-01), Gillet
Baker, "Cons should not Cons its Arguments", ACM Sig. Plan Notices, vol. 27, No. 3, Mar. 1992, pp. 24-34.
Tarditi et al., "No Assembly Required: Compiling Standard ML to C", ACM Letters on Prog. Lang. and Sys., vol. 1, No. 2, 1992, pp. 161-177.
R. Hieb et al., "Representing Control in the Presence of First-Class Continuations", ACM SigPlan'90 Conf. on Prog. Lang. Design and Implementation, Jun. 1990, pp. 66-77.

Affiliated with

Also associated with

Rating

Garbage collection, tail recursion and first-class continuations does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Garbage collection, tail recursion and first-class continuations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Garbage collection, tail recursion and first-class continuations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-1149803