[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Clarification of full funarging and spaghetti stacks

To: common-lisp at SU-AI
Subject: Clarification of full funarging and spaghetti stacks
From: MOON at SCRC-TENEX
Date: Sat, 04 Sep 1982 08:21:00 -0000

Okay, here's the big question.  Do closures over lexical variables have
dynamic extent or indefinite extent?  In other words, do we have upward
funargs, or only downward funargs with full access to lexical variables?

Prev by Date: Proposed definition of SUBST
Next by Date: Mailing list
Previous by thread: Writing PROG as a macro
Next by thread: Re: Clarification of full funarging and spaghetti stacks
Index(es):
- Date
- Thread