|Static type-checking with dynamic scoping firstname.lastname@example.org (1991-01-14)|
|Static type-checking with dynamic scoping email@example.com (1991-01-15)|
|Re: Static type-checking with dynamic scoping Chuck_Lins.SIAC_QMAIL@gateway.qm.apple.com (Chuck Lins) (1991-01-15)|
|Re: Static type-checking with dynamic scoping brm@Neon.Stanford.EDU (Brian R. Murphy) (1991-01-15)|
|Re: Static type-checking with dynamic scoping firstname.lastname@example.org (1991-01-16)|
|Re: Static type-checking with dynamic scoping brm@Neon.Stanford.EDU (Brian R. Murphy) (1991-01-17)|
|Re: Static type-checking with dynamic scoping email@example.com (1991-01-21)|
|From:||firstname.lastname@example.org (roberto bagnara)|
|Keywords:||types, design, storage|
|Organization:||CERN, Geneva, Switzerland|
|Date:||14 Jan 91 14:55:30 GMT|
we couldn't find a clear answer to the following question and absolutely
need an answer, or a pointer to it:
"Let's consider a Pascal-like imperative language, with dynamic
binding of free variables inside abstractions (functions and
procedures). Is it possible to perform static type-checking?"
We had a look to different books finding that languages using
the dynamic scoping rule either don't have types or perform
type checking at run-time, but that's not a negative answer.
We are developing an interpreter for the above language in prolog, using
a transition system as defined in "Plotkin - A structural approach to
operational semantics - Aarhus University, 1981".
He just mentions the existence of the dynamic scope rule, but gives
no answers on how it can be implemented.
In summary: is it possible to do static type-checking when you've dynamic
If not, are there restrictions on the language that makes it
possible (e.g. no recursion, no functional/procedural parameters)?
Thank you in advance
Return to the
Search the comp.compilers archives again.