64 lines
25 KiB
HTML
64 lines
25 KiB
HTML
<!-- Common Lisp HyperSpec (TM), version 7.0 generated by Kent M. Pitman on Mon, 11-Apr-2005 2:31am EDT -->
|
|
<HTML>
|
|
<HEAD>
|
|
<TITLE>CLHS: Glossary-Section L</TITLE>
|
|
<LINK HREF="../Data/clhs.css" REL="stylesheet" TYPE="text/css" />
|
|
<META HTTP-EQUIV="Author" CONTENT="Kent M. Pitman">
|
|
<META HTTP-EQUIV="Organization" CONTENT="LispWorks Ltd.">
|
|
<LINK REL=TOP HREF="../Front/index.htm">
|
|
<LINK REL=COPYRIGHT HREF="../Front/Help.htm#Legal">
|
|
<LINK REL=DISCLAIMER HREF="../Front/Help.htm#Disclaimer">
|
|
<LINK REL=PREV HREF="26_glo_k.htm">
|
|
<LINK REL=UP HREF="26_a.htm">
|
|
<LINK REL=NEXT HREF="26_glo_m.htm">
|
|
</HEAD>
|
|
<BODY>
|
|
<H1><A REV=MADE HREF="http://www.lispworks.com/"><IMG WIDTH=80 HEIGHT=65 ALT="[LISPWORKS]" SRC="../Graphics/LWSmall.gif" ALIGN=Bottom></A><A REL=TOP HREF="../Front/index.htm"><IMG WIDTH=237 HEIGHT=65 ALT="[Common Lisp HyperSpec (TM)]" SRC="../Graphics/CLHS_Sm.gif" ALIGN=Bottom></A> <A REL=PREV HREF="26_glo_k.htm"><IMG WIDTH=40 HEIGHT=40 ALT="[Previous]" SRC="../Graphics/Prev.gif" ALIGN=Bottom></A><A REL=UP HREF="26_a.htm"><IMG WIDTH=40 HEIGHT=40 ALT="[Up]" SRC="../Graphics/Up.gif" ALIGN=Bottom></A><A REL=NEXT HREF="26_glo_m.htm"><IMG WIDTH=40 HEIGHT=40 ALT="[Next]" SRC="../Graphics/Next.gif" ALIGN=Bottom></A></H1>
|
|
|
|
<HR>
|
|
|
|
<B>L</B> <P>
|
|
<P><A NAME="lambda_combination"><B>lambda combination</B></A> <I>n.</I> <I>Trad.</I> a <A REL=DEFINITION HREF="#lambda_form"><I>lambda form</I></A>. <P>
|
|
<P><A NAME="lambda_expression"><B>lambda expression</B></A> <I>n.</I> a <A REL=DEFINITION HREF="#list"><I>list</I></A> which can be used in place of a <A REL=DEFINITION HREF="26_glo_f.htm#function_name"><I>function name</I></A> in certain contexts to denote a <A REL=DEFINITION HREF="26_glo_f.htm#function"><I>function</I></A> by directly describing its behavior rather than indirectly by referring to the name of an <I>established</I> <A REL=DEFINITION HREF="26_glo_f.htm#function"><I>function</I></A>; its name derives from the fact that its first element is the <A REL=DEFINITION HREF="26_glo_s.htm#symbol"><I>symbol</I></A> <TT>lambda</TT>. See <A REL=DEFINITION HREF="a_lambda.htm#lambda"><B>lambda</B></A>. <P>
|
|
<P><A NAME="lambda_form"><B>lambda form</B></A> <I>n.</I> a <A REL=DEFINITION HREF="26_glo_f.htm#form"><I>form</I></A> that is a <A REL=DEFINITION HREF="#list"><I>list</I></A> and that has a first element which is a <A REL=DEFINITION HREF="#lambda_expression"><I>lambda expression</I></A> representing a <A REL=DEFINITION HREF="26_glo_f.htm#function"><I>function</I></A> to be called on <A REL=DEFINITION HREF="26_glo_a.htm#argument"><I>arguments</I></A> which are the result of <I>evaluating</I> subsequent elements of the <A REL=DEFINITION HREF="#lambda_form"><I>lambda form</I></A>. <P>
|
|
<P><A NAME="lambda_list"><B>lambda list</B></A> <I>n.</I> a <A REL=DEFINITION HREF="#list"><I>list</I></A> that specifies a set of <A REL=DEFINITION HREF="26_glo_p.htm#parameter"><I>parameters</I></A> (sometimes called <A REL=DEFINITION HREF="#lambda_variable"><I>lambda variables</I></A>) and a protocol for receiving <A REL=DEFINITION HREF="26_glo_v.htm#value"><I>values</I></A> for those <A REL=DEFINITION HREF="26_glo_p.htm#parameter"><I>parameters</I></A>; that is, an <A REL=DEFINITION HREF="26_glo_o.htm#ordinary_lambda_list"><I>ordinary lambda list</I></A>, an <A REL=DEFINITION HREF="26_glo_e.htm#extended_lambda_list"><I>extended lambda list</I></A>, or a <A REL=DEFINITION HREF="26_glo_m.htm#modified_lambda_list"><I>modified lambda list</I></A>. <P>
|
|
<P><A NAME="lambda_list_keyword"><B>lambda list keyword</B></A> <I>n.</I> a <A REL=DEFINITION HREF="26_glo_s.htm#symbol"><I>symbol</I></A> whose <A REL=DEFINITION HREF="26_glo_n.htm#name"><I>name</I></A> begins with <A REL=DEFINITION HREF="26_glo_a.htm#ampersand"><I>ampersand</I></A> and that is specially recognized in a <A REL=DEFINITION HREF="#lambda_list"><I>lambda list</I></A>. Note that no <A REL=DEFINITION HREF="26_glo_s.htm#standardized"><I>standardized</I></A> <A REL=DEFINITION HREF="#lambda_list_keyword"><I>lambda list keyword</I></A> is in the <TT>KEYWORD</TT> package. <P>
|
|
<P><A NAME="lambda_variable"><B>lambda variable</B></A> <I>n.</I> a <A REL=DEFINITION HREF="26_glo_f.htm#formal_parameter"><I>formal parameter</I></A>, used to emphasize the <A REL=DEFINITION HREF="26_glo_v.htm#variable"><I>variable</I></A>'s relation to the <A REL=DEFINITION HREF="#lambda_list"><I>lambda list</I></A> that <I>established</I> it. <P>
|
|
<P><A NAME="leaf"><B>leaf</B></A> <I>n.</I> 1. an <A REL=DEFINITION HREF="26_glo_a.htm#atom"><I>atom</I></A> in a <A REL=DEFINITION HREF="26_glo_t.htm#tree"><I>tree</I></A>[1]. 2. a terminal node of a <A REL=DEFINITION HREF="26_glo_t.htm#tree"><I>tree</I></A>[2]. <P>
|
|
<P><A NAME="leap_seconds"><B>leap seconds</B></A> <I>n.</I> additional one-second intervals of time that are occasionally inserted into the true calendar by official timekeepers as a correction similar to ``leap years.'' All Common Lisp <A REL=DEFINITION HREF="26_glo_t.htm#time"><I>time</I></A> representations ignore <A REL=DEFINITION HREF="#leap_seconds"><I>leap seconds</I></A>; every day is assumed to be exactly 86400 seconds long. <P>
|
|
<P><A NAME="left-parenthesis"><B>left-parenthesis</B></A> <I>n.</I> the <A REL=DEFINITION HREF="26_glo_s.htm#standard_character"><I>standard character</I></A> ``<TT>(</TT>'', that is variously called ``left parenthesis'' or ``open parenthesis'' See <A REL=DEFINITION HREF="02_ac.htm#stdcharsthree">Figure 2-5</A>. <P>
|
|
<P><A NAME="length"><B>length</B></A> <I>n.</I> (of a <A REL=DEFINITION HREF="26_glo_s.htm#sequence"><I>sequence</I></A>) the number of <A REL=DEFINITION HREF="26_glo_e.htm#element"><I>elements</I></A> in the <A REL=DEFINITION HREF="26_glo_s.htm#sequence"><I>sequence</I></A>. (Note that if the <A REL=DEFINITION HREF="26_glo_s.htm#sequence"><I>sequence</I></A> is a <A REL=DEFINITION HREF="26_glo_v.htm#vector"><I>vector</I></A> with a <A REL=DEFINITION HREF="26_glo_f.htm#fill_pointer"><I>fill pointer</I></A>, its <A REL=DEFINITION HREF="#length"><I>length</I></A> is the same as the <A REL=DEFINITION HREF="26_glo_f.htm#fill_pointer"><I>fill pointer</I></A> even though the total allocated size of the <A REL=DEFINITION HREF="26_glo_v.htm#vector"><I>vector</I></A> might be larger.) <P>
|
|
<P><A NAME="lexical_binding"><B>lexical binding</B></A> <I>n.</I> a <A REL=DEFINITION HREF="26_glo_b.htm#binding"><I>binding</I></A> in a <A REL=DEFINITION HREF="#lexical_environment"><I>lexical environment</I></A>. <P>
|
|
<P><A NAME="lexical_closure"><B>lexical closure</B></A> <I>n.</I> a <A REL=DEFINITION HREF="26_glo_f.htm#function"><I>function</I></A> that, when invoked on <A REL=DEFINITION HREF="26_glo_a.htm#argument"><I>arguments</I></A>, executes the body of a <A REL=DEFINITION HREF="#lambda_expression"><I>lambda expression</I></A> in the <A REL=DEFINITION HREF="#lexical_environment"><I>lexical environment</I></A> that was captured at the time of the creation of the <A REL=DEFINITION HREF="#lexical_closure"><I>lexical closure</I></A>, augmented by <A REL=DEFINITION HREF="26_glo_b.htm#binding"><I>bindings</I></A> of the <A REL=DEFINITION HREF="26_glo_f.htm#function"><I>function</I></A>'s <A REL=DEFINITION HREF="26_glo_p.htm#parameter"><I>parameters</I></A> to the corresponding <A REL=DEFINITION HREF="26_glo_a.htm#argument"><I>arguments</I></A>. <P>
|
|
<P><A NAME="lexical_environment"><B>lexical environment</B></A> <I>n.</I> that part of the <A REL=DEFINITION HREF="26_glo_e.htm#environment"><I>environment</I></A> that contains <A REL=DEFINITION HREF="26_glo_b.htm#binding"><I>bindings</I></A> whose names have <A REL=DEFINITION HREF="#lexical_scope"><I>lexical scope</I></A>. A <A REL=DEFINITION HREF="#lexical_environment"><I>lexical environment</I></A> contains, among other things: ordinary <A REL=DEFINITION HREF="26_glo_b.htm#binding"><I>bindings</I></A> of <A REL=DEFINITION HREF="26_glo_v.htm#variable"><I>variable</I></A> <A REL=DEFINITION HREF="26_glo_n.htm#name"><I>names</I></A> to <A REL=DEFINITION HREF="26_glo_v.htm#value"><I>values</I></A>, lexically <I>established</I> <A REL=DEFINITION HREF="26_glo_b.htm#binding"><I>bindings</I></A> of <A REL=DEFINITION HREF="26_glo_f.htm#function_name"><I>function names</I></A> to <A REL=DEFINITION HREF="26_glo_f.htm#function"><I>functions</I></A>, <A REL=DEFINITION HREF="26_glo_m.htm#macro"><I>macros</I></A>, <A REL=DEFINITION HREF="26_glo_s.htm#symbol_macro"><I>symbol macros</I></A>, <A REL=DEFINITION HREF="26_glo_b.htm#block"><I>blocks</I></A>, <A REL=DEFINITION HREF="26_glo_t.htm#tag"><I>tags</I></A>, and <A REL=DEFINITION HREF="#local_declaration"><I>local declarations</I></A> (see <A REL=DEFINITION HREF="s_declar.htm#declare"><B>declare</B></A>). <P>
|
|
<P><A NAME="lexical_scope"><B>lexical scope</B></A> <I>n.</I> <A REL=DEFINITION HREF="26_glo_s.htm#scope"><I>scope</I></A> that is limited to a spatial or textual region within the establishing <A REL=DEFINITION HREF="26_glo_f.htm#form"><I>form</I></A>. ``The names of parameters to a function normally are lexically scoped.'' <P>
|
|
<P><A NAME="lexical_variable"><B>lexical variable</B></A> <I>n.</I> a <A REL=DEFINITION HREF="26_glo_v.htm#variable"><I>variable</I></A> the <A REL=DEFINITION HREF="26_glo_b.htm#binding"><I>binding</I></A> for which is in the <A REL=DEFINITION HREF="#lexical_environment"><I>lexical environment</I></A>. <P>
|
|
<P><A NAME="lisp_image"><B>Lisp image</B></A> <I>n.</I> a running instantiation of a Common Lisp <A REL=DEFINITION HREF="26_glo_i.htm#implementation"><I>implementation</I></A>. A <A REL=DEFINITION HREF="#lisp_image"><I>Lisp image</I></A> is characterized by a single address space in which any <A REL=DEFINITION HREF="26_glo_o.htm#object"><I>object</I></A> can directly refer to any another in conformance with this specification, and by a single, common, <A REL=DEFINITION HREF="26_glo_g.htm#global_environment"><I>global environment</I></A>. (External operating systems sometimes call this a ``core image,'' ``fork,'' ``incarnation,'' ``job,'' or ``process.'' Note however, that the issue of a ``process'' in such an operating system is technically orthogonal to the issue of a <A REL=DEFINITION HREF="#lisp_image"><I>Lisp image</I></A> being defined here. Depending on the operating system, a single ``process'' might have multiple <A REL=DEFINITION HREF="#lisp_image"><I>Lisp images</I></A>, and multiple ``processes'' might reside in a single <A REL=DEFINITION HREF="#lisp_image"><I>Lisp image</I></A>. Hence, it is the idea of a fully shared address space for direct reference among all <A REL=DEFINITION HREF="26_glo_o.htm#object"><I>objects</I></A> which is the defining characteristic. Note, too, that two ``processes'' which have a communication area that permits the sharing of some but not all <A REL=DEFINITION HREF="26_glo_o.htm#object"><I>objects</I></A> are considered to be distinct <A REL=DEFINITION HREF="#lisp_image"><I>Lisp images</I></A>.) <P>
|
|
<P><A NAME="lisp_printer"><B>Lisp printer</B></A> <I>n.</I> <I>Trad.</I> the procedure that prints the character representation of an <A REL=DEFINITION HREF="26_glo_o.htm#object"><I>object</I></A> onto a <A REL=DEFINITION HREF="26_glo_s.htm#stream"><I>stream</I></A>. (This procedure is implemented by the <A REL=DEFINITION HREF="26_glo_f.htm#function"><I>function</I></A> <A REL=DEFINITION HREF="f_wr_pr.htm#write"><B>write</B></A>.) <P>
|
|
<P><A NAME="lisp_read-eval-print_loop"><B>Lisp read-eval-print loop</B></A> <I>n.</I> <I>Trad.</I> an endless loop that <A REL=DEFINITION HREF="26_glo_r.htm#read"><I>reads</I></A>[2] a <A REL=DEFINITION HREF="26_glo_f.htm#form"><I>form</I></A>, <A REL=DEFINITION HREF="26_glo_e.htm#evaluate"><I>evaluates</I></A> it, and prints (i.e., <A REL=DEFINITION HREF="26_glo_w.htm#write"><I>writes</I></A>[2]) the results. In many <A REL=DEFINITION HREF="26_glo_i.htm#implementation"><I>implementations</I></A>, the default mode of interaction with Common Lisp during program development is through such a loop. <P>
|
|
<P><A NAME="lisp_reader"><B>Lisp reader</B></A> <I>n.</I> <I>Trad.</I> the procedure that parses character representations of <A REL=DEFINITION HREF="26_glo_o.htm#object"><I>objects</I></A> from a <A REL=DEFINITION HREF="26_glo_s.htm#stream"><I>stream</I></A>, producing <A REL=DEFINITION HREF="26_glo_o.htm#object"><I>objects</I></A>. (This procedure is implemented by the <A REL=DEFINITION HREF="26_glo_f.htm#function"><I>function</I></A> <A REL=DEFINITION HREF="f_rd_rd.htm#read"><B>read</B></A>.) <P>
|
|
<P><A NAME="list"><B>list</B></A> <I>n.</I> 1. a chain of <A REL=DEFINITION HREF="26_glo_c.htm#cons"><I>conses</I></A> in which the <A REL=DEFINITION HREF="26_glo_c.htm#car"><I>car</I></A> of each <A REL=DEFINITION HREF="26_glo_c.htm#cons"><I>cons</I></A> is an <A REL=DEFINITION HREF="26_glo_e.htm#element"><I>element</I></A> of the <A REL=DEFINITION HREF="#list"><I>list</I></A>, and the <A REL=DEFINITION HREF="26_glo_c.htm#cdr"><I>cdr</I></A> of each <A REL=DEFINITION HREF="26_glo_c.htm#cons"><I>cons</I></A> is either the next link in the chain or a terminating <A REL=DEFINITION HREF="26_glo_a.htm#atom"><I>atom</I></A>. See also <A REL=DEFINITION HREF="26_glo_p.htm#proper_list"><I>proper list</I></A>, <A REL=DEFINITION HREF="26_glo_d.htm#dotted_list"><I>dotted list</I></A>, or <A REL=DEFINITION HREF="26_glo_c.htm#circular_list"><I>circular list</I></A>. 2. the <A REL=DEFINITION HREF="26_glo_t.htm#type"><I>type</I></A> that is the union of <A REL=DEFINITION HREF="t_null.htm#null"><B>null</B></A> and <A REL=DEFINITION HREF="t_cons.htm#cons"><B>cons</B></A>. <P>
|
|
<P><A NAME="list_designator"><B>list designator</B></A> <I>n.</I> a <A REL=DEFINITION HREF="26_glo_d.htm#designator"><I>designator</I></A> for a <A REL=DEFINITION HREF="#list"><I>list</I></A> of <A REL=DEFINITION HREF="26_glo_o.htm#object"><I>objects</I></A>; that is, an <A REL=DEFINITION HREF="26_glo_o.htm#object"><I>object</I></A> that denotes a <A REL=DEFINITION HREF="#list"><I>list</I></A> and that is one of: a <A REL=DEFINITION HREF="26_glo_n.htm#non-nil"><I>non-nil</I></A> <A REL=DEFINITION HREF="26_glo_a.htm#atom"><I>atom</I></A> (denoting a <A REL=DEFINITION HREF="26_glo_s.htm#singleton"><I>singleton</I></A> <A REL=DEFINITION HREF="#list"><I>list</I></A> whose <A REL=DEFINITION HREF="26_glo_e.htm#element"><I>element</I></A> is that <A REL=DEFINITION HREF="26_glo_n.htm#non-nil"><I>non-nil</I></A> <A REL=DEFINITION HREF="26_glo_a.htm#atom"><I>atom</I></A>) or a <A REL=DEFINITION HREF="26_glo_p.htm#proper_list"><I>proper list</I></A> (denoting itself). <P>
|
|
<P><A NAME="list_structure"><B>list structure</B></A> <I>n.</I> (of a <A REL=DEFINITION HREF="#list"><I>list</I></A>) the set of <A REL=DEFINITION HREF="26_glo_c.htm#cons"><I>conses</I></A> that make up the <A REL=DEFINITION HREF="#list"><I>list</I></A>. Note that while the <A REL=DEFINITION HREF="26_glo_c.htm#car"><I>car</I></A>[1b] component of each such <A REL=DEFINITION HREF="26_glo_c.htm#cons"><I>cons</I></A> is part of the <A REL=DEFINITION HREF="#list_structure"><I>list structure</I></A>, the <A REL=DEFINITION HREF="26_glo_o.htm#object"><I>objects</I></A> that are <A REL=DEFINITION HREF="26_glo_e.htm#element"><I>elements</I></A> of the <A REL=DEFINITION HREF="#list"><I>list</I></A> (i.e., the <A REL=DEFINITION HREF="26_glo_o.htm#object"><I>objects</I></A> that are the <A REL=DEFINITION HREF="26_glo_c.htm#car"><I>cars</I></A>[2] of each <A REL=DEFINITION HREF="26_glo_c.htm#cons"><I>cons</I></A> in the <A REL=DEFINITION HREF="#list"><I>list</I></A>) are not themselves part of its <A REL=DEFINITION HREF="#list_structure"><I>list structure</I></A>, even if they are <A REL=DEFINITION HREF="26_glo_c.htm#cons"><I>conses</I></A>, except in the (<A REL=DEFINITION HREF="26_glo_c.htm#circular"><I>circular</I></A>[2]) case where the <A REL=DEFINITION HREF="#list"><I>list</I></A> actually contains one of its <A REL=DEFINITION HREF="26_glo_t.htm#tail"><I>tails</I></A> as an <A REL=DEFINITION HREF="26_glo_e.htm#element"><I>element</I></A>. (The <A REL=DEFINITION HREF="#list_structure"><I>list structure</I></A> of a <A REL=DEFINITION HREF="#list"><I>list</I></A> is sometimes redundantly referred to as its ``top-level list structure'' in order to emphasize that any <A REL=DEFINITION HREF="26_glo_c.htm#cons"><I>conses</I></A> that are <A REL=DEFINITION HREF="26_glo_e.htm#element"><I>elements</I></A> of the <A REL=DEFINITION HREF="#list"><I>list</I></A> are not involved.) <P>
|
|
<P><A NAME="literal"><B>literal</B></A> <I>adj.</I> (of an <A REL=DEFINITION HREF="26_glo_o.htm#object"><I>object</I></A>) referenced directly in a program rather than being computed by the program; that is, appearing as data in a <A REL=DEFINITION HREF="s_quote.htm#quote"><B>quote</B></A> <A REL=DEFINITION HREF="26_glo_f.htm#form"><I>form</I></A>, or, if the <A REL=DEFINITION HREF="26_glo_o.htm#object"><I>object</I></A> is a <A REL=DEFINITION HREF="26_glo_s.htm#self-evaluating_object"><I>self-evaluating object</I></A>, appearing as unquoted data. ``In the form <TT>(cons "one" '("two"))</TT>, the expressions <TT>"one"</TT>, <TT>("two")</TT>, and <TT>"two"</TT> are literal objects.'' <P>
|
|
<P><A NAME="load"><B>load</B></A> <I>v.t.</I> (a <A REL=DEFINITION HREF="26_glo_f.htm#file"><I>file</I></A>) to cause the <A REL=DEFINITION HREF="26_glo_c.htm#code"><I>code</I></A> contained in the <A REL=DEFINITION HREF="26_glo_f.htm#file"><I>file</I></A> to be <I>executed</I>. See the <A REL=DEFINITION HREF="26_glo_f.htm#function"><I>function</I></A> <A REL=DEFINITION HREF="f_load.htm#load"><B>load</B></A>. <P>
|
|
<P><A NAME="load_time"><B>load time</B></A> <I>n.</I> the duration of time that the loader is <I>loading</I> <A REL=DEFINITION HREF="26_glo_c.htm#compiled_code"><I>compiled code</I></A>. <P>
|
|
<P><A NAME="load_time_value"><B>load time value</B></A> <I>n.</I> an <A REL=DEFINITION HREF="26_glo_o.htm#object"><I>object</I></A> referred to in <A REL=DEFINITION HREF="26_glo_c.htm#code"><I>code</I></A> by a <A REL=DEFINITION HREF="s_ld_tim.htm#load-time-value"><B>load-time-value</B></A> <A REL=DEFINITION HREF="26_glo_f.htm#form"><I>form</I></A>. The <A REL=DEFINITION HREF="26_glo_v.htm#value"><I>value</I></A> of such a <A REL=DEFINITION HREF="26_glo_f.htm#form"><I>form</I></A> is some specific <A REL=DEFINITION HREF="26_glo_o.htm#object"><I>object</I></A> which can only be computed in the run-time <A REL=DEFINITION HREF="26_glo_e.htm#environment"><I>environment</I></A>. In the case of <A REL=DEFINITION HREF="26_glo_f.htm#file"><I>file</I></A> <A REL=DEFINITION HREF="26_glo_c.htm#compilation"><I>compilation</I></A>, the <A REL=DEFINITION HREF="26_glo_v.htm#value"><I>value</I></A> is computed once as part of the process of <I>loading</I> the <A REL=DEFINITION HREF="26_glo_c.htm#compiled_file"><I>compiled file</I></A>, and not again. See the <A REL=DEFINITION HREF="26_glo_s.htm#special_operator"><I>special operator</I></A> <A REL=DEFINITION HREF="s_ld_tim.htm#load-time-value"><B>load-time-value</B></A>. <P>
|
|
<P><A NAME="loader"><B>loader</B></A> <I>n.</I> a facility that is part of Lisp and that <A REL=DEFINITION HREF="#load"><I>loads</I></A> a <A REL=DEFINITION HREF="26_glo_f.htm#file"><I>file</I></A>. See the <A REL=DEFINITION HREF="26_glo_f.htm#function"><I>function</I></A> <A REL=DEFINITION HREF="f_load.htm#load"><B>load</B></A>. <P>
|
|
<P><A NAME="local_declaration"><B>local declaration</B></A> <I>n.</I> an <A REL=DEFINITION HREF="26_glo_e.htm#expression"><I>expression</I></A> which may appear only in specially designated positions of certain <A REL=DEFINITION HREF="26_glo_f.htm#form"><I>forms</I></A>, and which provides information about the code contained within the containing <A REL=DEFINITION HREF="26_glo_f.htm#form"><I>form</I></A>; that is, a <A REL=DEFINITION HREF="s_declar.htm#declare"><B>declare</B></A> <A REL=DEFINITION HREF="26_glo_e.htm#expression"><I>expression</I></A>. <P>
|
|
<P><A NAME="local_precedence_order"><B>local precedence order</B></A> <I>n.</I> (of a <A REL=DEFINITION HREF="26_glo_c.htm#class"><I>class</I></A>) a <A REL=DEFINITION HREF="#list"><I>list</I></A> consisting of the <A REL=DEFINITION HREF="26_glo_c.htm#class"><I>class</I></A> followed by its <A REL=DEFINITION HREF="26_glo_d.htm#direct_superclass"><I>direct superclasses</I></A> in the order mentioned in the defining <A REL=DEFINITION HREF="26_glo_f.htm#form"><I>form</I></A> for the <A REL=DEFINITION HREF="26_glo_c.htm#class"><I>class</I></A>. <P>
|
|
<P><A NAME="local_slot"><B>local slot</B></A> <I>n.</I> (of a <A REL=DEFINITION HREF="26_glo_c.htm#class"><I>class</I></A>) a <A REL=DEFINITION HREF="26_glo_s.htm#slot"><I>slot</I></A> <A REL=DEFINITION HREF="26_glo_a.htm#accessible"><I>accessible</I></A> in only one <A REL=DEFINITION HREF="26_glo_i.htm#instance"><I>instance</I></A>, namely the <A REL=DEFINITION HREF="26_glo_i.htm#instance"><I>instance</I></A> in which the <A REL=DEFINITION HREF="26_glo_s.htm#slot"><I>slot</I></A> is allocated. <P>
|
|
<P><A NAME="logical_block"><B>logical block</B></A> <I>n.</I> a conceptual grouping of related output used by the <A REL=DEFINITION HREF="26_glo_p.htm#pretty_printer"><I>pretty printer</I></A>. See the <A REL=DEFINITION HREF="26_glo_m.htm#macro"><I>macro</I></A> <A REL=DEFINITION HREF="m_ppr_lo.htm#pprint-logical-block"><B>pprint-logical-block</B></A> and <A REL=CHILD HREF="22_baa.htm">Section 22.2.1.1 (Dynamic Control of the Arrangement of Output)</A>. <P>
|
|
<P><A NAME="logical_host"><B>logical host</B></A> <I>n.</I> an <A REL=DEFINITION HREF="26_glo_o.htm#object"><I>object</I></A> of <A REL=DEFINITION HREF="26_glo_i.htm#implementation-dependent"><I>implementation-dependent</I></A> nature that is used as the representation of a ``host'' in a <A REL=DEFINITION HREF="#logical_pathname"><I>logical pathname</I></A>, and that has an associated set of translation rules for converting <A REL=DEFINITION HREF="#logical_pathname"><I>logical pathnames</I></A> belonging to that host into <A REL=DEFINITION HREF="26_glo_p.htm#physical_pathname"><I>physical pathnames</I></A>. See <A REL=CHILD HREF="19_c.htm">Section 19.3 (Logical Pathnames)</A>. <P>
|
|
<P><A NAME="logical_host_designator"><B>logical host designator</B></A> <I>n.</I> a <A REL=DEFINITION HREF="26_glo_d.htm#designator"><I>designator</I></A> for a <A REL=DEFINITION HREF="#logical_host"><I>logical host</I></A>; that is, an <A REL=DEFINITION HREF="26_glo_o.htm#object"><I>object</I></A> that denotes a <A REL=DEFINITION HREF="#logical_host"><I>logical host</I></A> and that is one of: a <A REL=DEFINITION HREF="26_glo_s.htm#string"><I>string</I></A> (denoting the <A REL=DEFINITION HREF="#logical_host"><I>logical host</I></A> that it names), or a <A REL=DEFINITION HREF="#logical_host"><I>logical host</I></A> (denoting itself). (Note that because the representation of a <A REL=DEFINITION HREF="#logical_host"><I>logical host</I></A> is <A REL=DEFINITION HREF="26_glo_i.htm#implementation-dependent"><I>implementation-dependent</I></A>, it is possible that an <A REL=DEFINITION HREF="26_glo_i.htm#implementation"><I>implementation</I></A> might represent a <A REL=DEFINITION HREF="#logical_host"><I>logical host</I></A> as the <A REL=DEFINITION HREF="26_glo_s.htm#string"><I>string</I></A> that names it.) <P>
|
|
<P><A NAME="logical_pathname"><B>logical pathname</B></A> <I>n.</I> an <A REL=DEFINITION HREF="26_glo_o.htm#object"><I>object</I></A> of <A REL=DEFINITION HREF="26_glo_t.htm#type"><I>type</I></A> <A REL=DEFINITION HREF="t_logica.htm#logical-pathname"><B>logical-pathname</B></A>. <P>
|
|
<P><A NAME="long_float"><B>long float</B></A> <I>n.</I> an <A REL=DEFINITION HREF="26_glo_o.htm#object"><I>object</I></A> of <A REL=DEFINITION HREF="26_glo_t.htm#type"><I>type</I></A> <A REL=DEFINITION HREF="t_short_.htm#long-float"><B>long-float</B></A>. <P>
|
|
<P><A NAME="loop_keyword"><B>loop keyword</B></A> <I>n.</I> <I>Trad.</I> a symbol that is a specially recognized part of the syntax of an extended <A REL=DEFINITION HREF="m_loop.htm#loop"><B>loop</B></A> <A REL=DEFINITION HREF="26_glo_f.htm#form"><I>form</I></A>. Such symbols are recognized by their <A REL=DEFINITION HREF="26_glo_n.htm#name"><I>name</I></A> (using <A REL=DEFINITION HREF="f_stgeq_.htm#stringEQ"><B>string=</B></A>), not by their identity; as such, they may be in any package. A <A REL=DEFINITION HREF="#loop_keyword"><I>loop keyword</I></A> is not a <A REL=DEFINITION HREF="26_glo_k.htm#keyword"><I>keyword</I></A>. <P>
|
|
<P><A NAME="lowercase"><B>lowercase</B></A> <I>adj.</I> (of a <A REL=DEFINITION HREF="26_glo_c.htm#character"><I>character</I></A>) being among <A REL=DEFINITION HREF="26_glo_s.htm#standard_character"><I>standard characters</I></A> corresponding to the small letters <TT>a</TT> through <TT>z</TT>, or being some other <A REL=DEFINITION HREF="26_glo_i.htm#implementation-defined"><I>implementation-defined</I></A> <A REL=DEFINITION HREF="26_glo_c.htm#character"><I>character</I></A> that is defined by the <A REL=DEFINITION HREF="26_glo_i.htm#implementation"><I>implementation</I></A> to be <A REL=DEFINITION HREF="#lowercase"><I>lowercase</I></A>. See <A REL=CHILD HREF="13_adc.htm">Section 13.1.4.3 (Characters With Case)</A>. <P>
|
|
<HR>
|
|
|
|
<A REL=NAVIGATOR HREF="../Front/StartPts.htm"><IMG WIDTH=80 HEIGHT=40 ALT="[Starting Points]" SRC="../Graphics/StartPts.gif" ALIGN=Bottom></A><A REL=TOC HREF="../Front/Contents.htm"><IMG WIDTH=80 HEIGHT=40 ALT="[Contents]" SRC="../Graphics/Contents.gif" ALIGN=Bottom></A><A REL=INDEX HREF="../Front/X_Master.htm"><IMG WIDTH=80 HEIGHT=40 ALT="[Index]" SRC="../Graphics/Index.gif" ALIGN=Bottom></A><A REL=INDEX HREF="../Front/X_Symbol.htm"><IMG WIDTH=80 HEIGHT=40 ALT="[Symbols]" SRC="../Graphics/Symbols.gif" ALIGN=Bottom></A><A REL=GLOSSARY HREF="../Body/26_a.htm"><IMG WIDTH=80 HEIGHT=40 ALT="[Glossary]" SRC="../Graphics/Glossary.gif" ALIGN=Bottom></A><A HREF="../Front/X3J13Iss.htm"><IMG WIDTH=80 HEIGHT=40 ALT="[Issues]" SRC="../Graphics/Issues.gif" ALIGN=Bottom></A><BR>
|
|
|
|
<A REL=COPYRIGHT HREF="../Front/Help.htm#Legal"><I>Copyright 1996-2005, LispWorks Ltd. All rights reserved.</I></A><P>
|
|
</BODY>
|
|
</HTML>
|