System Labels - Revision history

WikiSysop at 00:53, 19 September 2022

2022-09-19T00:53:36Z

← Older revision		Revision as of 20:53, 18 September 2022
Line 13:		Line 13:

	<tr>		<tr>
			<td valign="top"><apll>⎕INV:</apll></td>
			<td></td>
			<td></td>
			<td>is called when an inverse function is needed as in <apll>foo⍣¯1 R</apll>.</td>
			</tr>

			<tr>
	<td valign="top"><apll>⎕MS:</apll></td>		<td valign="top"><apll>⎕MS:</apll></td>
	<td></td>		<td></td>
	<td></td>		<td></td>
	<td>is called when an AFOH/UDFOH is invoked by the [[Multisets\|Multiset Operator]].</td>		<td>is called when an AFOH/UDFOH is invoked by the [[Multisets\|Multiset Operator]] as in <apll>foo⍦R</apll>.</td>
	</tr>		</tr>

Line 36:		Line 43:
	[1] Z←L,R ⋄ →0		[1] Z←L,R ⋄ →0
	[2] ⎕ID :Z←'Identity' ,(⎕NC 'L'),(⎕NC 'R') ⋄ →0		[2] ⎕ID :Z←'Identity' ,(⎕NC 'L'),(⎕NC 'R') ⋄ →0
	[3] ⎕MS :Z←'Multiset' ,(⎕NC 'L'),(⎕NC 'R') ⋄ →0		[3] ⎕INV:Z←'Inverse' ,(⎕NC 'L'),(⎕NC 'R') ⋄ →0
	[4] ⎕PRO:Z←'Prototype',(⎕NC 'L'),(⎕NC 'R') ⋄ →0		[4] ⎕MS :Z←'Multiset' ,(⎕NC 'L'),(⎕NC 'R') ⋄ →0
			[5] ⎕PRO:Z←'Prototype',(⎕NC 'L'),(⎕NC 'R') ⋄ →0
	∇		∇
	</pre></apll>		</pre></apll>
Line 47:		Line 55:
	<span style="color:blue;">➥</span>0:⍺←0 ⋄ ⍺,⍵		<span style="color:blue;">➥</span>0:⍺←0 ⋄ ⍺,⍵
	<span style="color:blue;">➥</span>⋄ ⎕ID :'Identity' ,(⎕NC '⍺'),⎕NC '⍵'		<span style="color:blue;">➥</span>⋄ ⎕ID :'Identity' ,(⎕NC '⍺'),⎕NC '⍵'
			<span style="color:blue;">➥</span>⋄ ⎕INV:'Inverse' ,(⎕NC '⍺'),⎕NC '⍵'
	<span style="color:blue;">➥</span>⋄ ⎕MS :'Multiset' ,(⎕NC '⍺'),⎕NC '⍵'		<span style="color:blue;">➥</span>⋄ ⎕MS :'Multiset' ,(⎕NC '⍺'),⎕NC '⍵'
	<span style="color:blue;">➥</span>⋄ ⎕PRO:'Prototype',(⎕NC '⍺'),⎕NC '⍵'}		<span style="color:blue;">➥</span>⋄ ⎕PRO:'Prototype',(⎕NC '⍺'),⎕NC '⍵'}
	~~⎕FMT~~ foo/⍬		)BOX ON
			Was OFF
			foo/⍬
	┌──────────────┐		┌──────────────┐
	│┌8───────────┐│		│┌8───────────┐│
Line 59:		Line 70:
	{⍺+÷⍵ ⋄ ⎕ID:∞}\7⍴1		{⍺+÷⍵ ⋄ ⎕ID:∞}\7⍴1
	1 2 1.5 1.666666667 1.6 1.625 1.615384615		1 2 1.5 1.666666667 1.6 1.625 1.615384615

			foo⍣¯1 1
			┌9───────────┐
			│ Inverse 0 2│
			└+───────────┘

	foo⍦ 1		foo⍦ 1
	Multiset 0 2		Multiset 0 2
	2 foo⍦ 1		2 foo⍦ 1
	Multiset 2 2		Multiset 2 2
	~~⎕FMT~~ 1 foo¨⍬		1 foo¨⍬
	┌0──────────────┐		┌0──────────────┐
	│┌11───────────┐│		│┌11───────────┐│
Line 77:		Line 94:
	* <p>In the Identity element case, the AFOH/UDFOH is called with the Reduction function's right argument '''prototype''' as the right argument to the AFOH/UDFOH; the left argument is undefined. For example, in <apll>foo/3 0⍴⊂⍳4</apll>, the (right) argument passed to the <apll>⎕ID:</apll> entry point is <apll>0 0 0 0</apll>. The return value from the AFOH/UDFOH is used as the common item in the result. Thus, the <apll>⎕ID</apll> entry point is called only once even though the result may have multiple copies of the return value.</p>		* <p>In the Identity element case, the AFOH/UDFOH is called with the Reduction function's right argument '''prototype''' as the right argument to the AFOH/UDFOH; the left argument is undefined. For example, in <apll>foo/3 0⍴⊂⍳4</apll>, the (right) argument passed to the <apll>⎕ID:</apll> entry point is <apll>0 0 0 0</apll>. The return value from the AFOH/UDFOH is used as the common item in the result. Thus, the <apll>⎕ID</apll> entry point is called only once even though the result may have multiple copies of the return value.</p>

	* <p>In the Multiset case, the AFOH/UDFOH is called with the same argument(s) as the Multiset derived function.</p>		* <p>In the Inverse case, the AFOH/UDFOH is called with the same argument(s) as the Inverse-derived function.</p>

			* <p>In the Multiset case, the AFOH/UDFOH is called with the same argument(s) as the Multiset-derived function.</p>

	* <p>In the Prototype case, the AFOH/UDFOH is called with arguments that are the '''prototypes''' of the respective arguments; in the monadic case, the left argument is undefined.</p>		* <p>In the Prototype case, the AFOH/UDFOH is called with arguments that are the '''prototypes''' of the respective arguments; in the monadic case, the left argument is undefined.</p>

	* <p>For the moment, if two or more system labels would be called at the same time (such as the last example above), a <apll>NONCE ERROR</apll> is signaled.</p>		* <p>For the moment, if two or more system labels would be called at the same time (such as the last example above, which needs both a Prototype and Identity element), a <apll>NONCE ERROR</apll> is signaled. Eventually, this case will be handled by placing all appropriate System Labels on the same line as in <apll>⎕ID:⎕PRO:</apll>.</p>

	* This idea was taken from the paper by David A. Rabenhorst, "[http://portal.acm.org/citation.cfm?id=801228 APL function variants and system labels]", ACM SIGAPL APL Quote Quad, APL83, Volume 13, Issue 3 (March 1983), pp. 281-284.		* This idea was taken from the paper by David A. Rabenhorst, "[http://portal.acm.org/citation.cfm?id=801228 APL function variants and system labels]", ACM SIGAPL APL Quote Quad, APL83, Volume 13, Issue 3 (March 1983), pp. 281-284.

WikiSysop at 14:08, 19 March 2019

2019-03-19T14:08:28Z

← Older revision		Revision as of 10:08, 19 March 2019
Line 1:		Line 1:
	<p>Normally, execution of an [[Anonymous_Functions/Operators\|Anonymous Function/Operator]] (~~AFO~~) or User-Defined Function/Operator (~~UDFO~~) starts execution at line one. However, in certain contexts, execution may start at a different place depending upon the context and the presence of a <b>System Label</b>. These special labels start with a quad symbol so as to distinguish them from normal labels. The following table lists the system labels defined so far and the special context in which they are used.</p>		<p>Normally, execution of an [[Anonymous_Functions/Operators/Hyperators\|Anonymous Function/Operator/Hyperator]] (AFOH) or User-Defined Function/Operator/Hyperator (UDFOH) starts execution at line one. However, in certain contexts, execution may start at a different place depending upon the context and the presence of a <b>System Label</b>. These special labels start with a quad symbol so as to distinguish them from normal labels. The following table lists the system labels defined so far and the special context in which they are used.</p>

	<table border="1" cellpadding="5" cellspacing="0" rules="none" summary="">		<table border="1" cellpadding="5" cellspacing="0" rules="none" summary="">
Line 16:		Line 16:
	<td></td>		<td></td>
	<td></td>		<td></td>
	<td>is called when an ~~AFO~~/~~UDFO~~ is invoked by the [[Multisets\|Multiset Operator]].</td>		<td>is called when an AFOH/UDFOH is invoked by the [[Multisets\|Multiset Operator]].</td>
	</tr>		</tr>

Line 30:		Line 30:
	</table>		</table>
	<br />		<br />
	<p>For example, as a ~~UDFO~~</p>		<p>For example, as a UDFOH</p>

	<apll><pre>		<apll><pre>
Line 41:		Line 41:
	</pre></apll>		</pre></apll>

	or equivalently as an ~~AFO~~		or equivalently as an AFOH

	<apll><pre>		<apll><pre>
Line 75:		Line 75:
	</pre></apll>		</pre></apll>

	* <p>In the Identity element case, the ~~AFO~~/~~UDFO~~ is called with the Reduction function's right argument '''prototype''' as the right argument to the ~~AFO~~/~~UDFO~~; the left argument is undefined. For example, in <apll>foo/3 0⍴⊂⍳4</apll>, the (right) argument passed to the <apll>⎕ID:</apll> entry point is <apll>0 0 0 0</apll>. The return value from the ~~AFO~~/~~UDFO~~ is used as the common item in the result. Thus, the <apll>⎕ID</apll> entry point is called only once even though the result may have multiple copies of the return value.</p>		* <p>In the Identity element case, the AFOH/UDFOH is called with the Reduction function's right argument '''prototype''' as the right argument to the AFOH/UDFOH; the left argument is undefined. For example, in <apll>foo/3 0⍴⊂⍳4</apll>, the (right) argument passed to the <apll>⎕ID:</apll> entry point is <apll>0 0 0 0</apll>. The return value from the AFOH/UDFOH is used as the common item in the result. Thus, the <apll>⎕ID</apll> entry point is called only once even though the result may have multiple copies of the return value.</p>

	* <p>In the Multiset case, the ~~AFO~~/~~UDFO~~ is called with the same argument(s) as the Multiset derived function.</p>		* <p>In the Multiset case, the AFOH/UDFOH is called with the same argument(s) as the Multiset derived function.</p>

	* <p>In the Prototype case, the ~~AFO~~/~~UDFO~~ is called with arguments that are the '''prototypes''' of the respective arguments; in the monadic case, the left argument is undefined.</p>		* <p>In the Prototype case, the AFOH/UDFOH is called with arguments that are the '''prototypes''' of the respective arguments; in the monadic case, the left argument is undefined.</p>

	* <p>For the moment, if two or more system labels would be called at the same time (such as the last example above), a <apll>NONCE ERROR</apll> is signaled.</p>		* <p>For the moment, if two or more system labels would be called at the same time (such as the last example above), a <apll>NONCE ERROR</apll> is signaled.</p>

	* This idea was taken from the paper by David A. Rabenhorst, "[http://portal.acm.org/citation.cfm?id=801228 APL function variants and system labels]", ACM SIGAPL APL Quote Quad, APL83, Volume 13, Issue 3 (March 1983), pp. 281-284.		* This idea was taken from the paper by David A. Rabenhorst, "[http://portal.acm.org/citation.cfm?id=801228 APL function variants and system labels]", ACM SIGAPL APL Quote Quad, APL83, Volume 13, Issue 3 (March 1983), pp. 281-284.

WikiSysop at 16:36, 28 April 2018

2018-04-28T16:36:26Z

← Older revision		Revision as of 12:36, 28 April 2018
Line 32:		Line 32:
	<p>For example, as a UDFO</p>		<p>For example, as a UDFO</p>

	<apll>~~    ~~∇ Z←{L} foo R~~<br />~~		<apll><pre>
	[1]~~   ~~Z←L,R ⋄ →0~~<br />~~		∇ Z←{L} foo R
	[2]~~   ~~⎕ID :Z←'Identity' ,(⎕NC 'L'),(⎕NC 'R') ⋄ →0~~<br />~~		[1] Z←L,R ⋄ →0
	[3]~~   ~~⎕MS :Z←'Multiset' ,(⎕NC 'L'),(⎕NC 'R') ⋄ →0~~<br />~~		[2] ⎕ID :Z←'Identity' ,(⎕NC 'L'),(⎕NC 'R') ⋄ →0
	[4]~~   ~~⎕PRO:Z←'Prototype',(⎕NC 'L'),(⎕NC 'R') ⋄ →0~~<br />~~		[3] ⎕MS :Z←'Multiset' ,(⎕NC 'L'),(⎕NC 'R') ⋄ →0
	~~    ~~∇<br /></apll>		[4] ⎕PRO:Z←'Prototype',(⎕NC 'L'),(⎕NC 'R') ⋄ →0
			∇
			</pre></apll>

	or equivalently as an AFO		or equivalently as an AFO

	<apll>~~      ~~foo←{~~<br />~~		<apll><pre>
	<span style="color:blue;">➥</span>0:⍺←0 ⋄ ⍺,⍵~~<br />~~		foo←{
	<span style="color:blue;">➥</span>⋄ ⎕ID :'Identity' ,(⎕NC '⍺'),⎕NC '⍵'~~<br />~~		<span style="color:blue;">➥</span>0:⍺←0 ⋄ ⍺,⍵
	<span style="color:blue;">➥</span>⋄ ⎕MS :'Multiset' ,(⎕NC '⍺'),⎕NC '⍵'~~<br />~~		<span style="color:blue;">➥</span>⋄ ⎕ID :'Identity' ,(⎕NC '⍺'),⎕NC '⍵'
	<span style="color:blue;">➥</span>⋄ ⎕PRO:'Prototype',(⎕NC '⍺'),⎕NC '⍵'}~~<br />~~		<span style="color:blue;">➥</span>⋄ ⎕MS :'Multiset' ,(⎕NC '⍺'),⎕NC '⍵'
	~~      ⎕fmt~~ foo/⍬~~<br />~~		<span style="color:blue;">➥</span>⋄ ⎕PRO:'Prototype',(⎕NC '⍺'),⎕NC '⍵'}
	┌──────────────┐~~<br />~~		⎕FMT foo/⍬
	│┌8───────────┐│~~<br />~~		┌──────────────┐
	││Identity 0 2││~~<br />~~		│┌8───────────┐│
	│└────────────┘2~~<br />~~		││Identity 0 2││
	└∊─────────────┘~~<br />~~		│└────────────┘2
	~~      ~~{⍺+÷⍵ ⋄ ⎕ID:∞}/⍬~~<br />~~		└∊─────────────┘
	∞~~<br />~~		{⍺+÷⍵ ⋄ ⎕ID:∞}/⍬
	~~      ~~{⍺+÷⍵ ⋄ ⎕ID:∞}\7⍴1~~<br />~~		∞
	1 2 1.5 1.666666667 1.6 1.625 1.615384615~~<br />~~		{⍺+÷⍵ ⋄ ⎕ID:∞}\7⍴1
	~~      ~~foo⍦ 1~~<br />~~		1 2 1.5 1.666666667 1.6 1.625 1.615384615
	Multiset 0 2~~<br />~~		foo⍦ 1
	~~      ~~2 foo⍦ 1~~<br />~~		Multiset 0 2
	Multiset 2 2~~<br />~~		2 foo⍦ 1
	~~      ⎕fmt~~ 1 foo¨⍬~~<br />~~		Multiset 2 2
	┌0──────────────┐~~<br />~~		⎕FMT 1 foo¨⍬
	│┌11───────────┐│~~<br />~~		┌0──────────────┐
	││~~         ~~ 0 0││~~<br />~~		│┌11───────────┐│
	│└─────────────┘2~~<br />~~		││ 0 0││
	└∊──────────────┘~~<br />~~		│└─────────────┘2
	~~      ~~foo/¨0⍴⊂⍬~~<br />~~		└∊──────────────┘
	NONCE ERROR~~<br />~~		foo/¨0⍴⊂⍬
	~~      ~~foo/¨0⍴⊂⍬<br />		NONCE ERROR
	~~         ∧~~</apll>		foo/¨0⍴⊂⍬
			∧
			</pre></apll>

	* <p>In the Identity element case, the AFO/UDFO is called with the Reduction function's right argument '''prototype''' as the right argument to the AFO/UDFO; the left argument is undefined. For example, in <apll>foo/3 0⍴⊂⍳4</apll>, the (right) argument passed to the <apll>⎕ID:</apll> entry point is <apll>0 0 0 0</apll>. The return value from the AFO/UDFO is used as the common item in the result. Thus, the <apll>⎕ID</apll> entry point is called only once even though the result may have multiple copies of the return value.</p>		* <p>In the Identity element case, the AFO/UDFO is called with the Reduction function's right argument '''prototype''' as the right argument to the AFO/UDFO; the left argument is undefined. For example, in <apll>foo/3 0⍴⊂⍳4</apll>, the (right) argument passed to the <apll>⎕ID:</apll> entry point is <apll>0 0 0 0</apll>. The return value from the AFO/UDFO is used as the common item in the result. Thus, the <apll>⎕ID</apll> entry point is called only once even though the result may have multiple copies of the return value.</p>

WikiSysop at 22:18, 20 April 2017

2017-04-20T22:18:15Z

← Older revision		Revision as of 18:18, 20 April 2017
Line 1:		Line 1:
	<p>Normally, execution of ~~a user~~-~~defined function~~/~~operator~~ starts execution at line one. However, in certain contexts, execution may start at a different ~~line~~ depending upon the context and the presence of a <b>System Label</b>. These special labels start with a quad symbol so as to ~~present no confusion with~~ normal labels. The following table lists the system labels defined so far and the special context in which they are used.</p>		<p>Normally, execution of an [[Anonymous_Functions/Operators\|Anonymous Function/Operator]] (AFO) or User-Defined Function/Operator (UDFO) starts execution at line one. However, in certain contexts, execution may start at a different place depending upon the context and the presence of a <b>System Label</b>. These special labels start with a quad symbol so as to distinguish them from normal labels. The following table lists the system labels defined so far and the special context in which they are used.</p>

	<table border="1" cellpadding="5" cellspacing="0" rules="none" summary="">		<table border="1" cellpadding="5" cellspacing="0" rules="none" summary="">
Line 16:		Line 16:
	<td></td>		<td></td>
	<td></td>		<td></td>
	<td>is called when ~~a user-defined function~~/~~operator~~ is invoked by the [[Multisets\|Multiset Operator]].</td>		<td>is called when an AFO/UDFO is invoked by the [[Multisets\|Multiset Operator]].</td>
	</tr>		</tr>

Line 30:		Line 30:
	</table>		</table>
	<br />		<br />
	<p>For example,</p>		<p>For example, as a UDFO</p>

	<apll>    ∇ Z←{L} foo R<br />		<apll>    ∇ Z←{L} foo R<br />
Line 39:		Line 39:
	∇<br /></apll>		∇<br /></apll>

	<apll>      ⎕fmt foo/⍬<br />		or equivalently as an AFO

			<apll>      foo←{<br />
			<span style="color:blue;">➥</span>0:⍺←0 ⋄ ⍺,⍵<br />
			<span style="color:blue;">➥</span>⋄ ⎕ID :'Identity' ,(⎕NC '⍺'),⎕NC '⍵'<br />
			<span style="color:blue;">➥</span>⋄ ⎕MS :'Multiset' ,(⎕NC '⍺'),⎕NC '⍵'<br />
			<span style="color:blue;">➥</span>⋄ ⎕PRO:'Prototype',(⎕NC '⍺'),⎕NC '⍵'}<br />
			⎕fmt foo/⍬<br />
	┌──────────────┐<br />		┌──────────────┐<br />
	│┌8───────────┐│<br />		│┌8───────────┐│<br />
Line 45:		Line 52:
	│└────────────┘2<br />		│└────────────┘2<br />
	└∊─────────────┘<br />		└∊─────────────┘<br />
			{⍺+÷⍵ ⋄ ⎕ID:∞}/⍬<br />
			∞<br />
			{⍺+÷⍵ ⋄ ⎕ID:∞}\7⍴1<br />
			1 2 1.5 1.666666667 1.6 1.625 1.615384615<br />
	foo⍦ 1<br />		foo⍦ 1<br />
	Multiset 0 2<br />		Multiset 0 2<br />
Line 60:		Line 71:
	∧</apll>		∧</apll>

	* <p>In the Identity element case, the ~~function~~ is called with the ~~reduction~~ function's right argument prototype as the right argument to the ~~user-defined function~~/~~operator~~; the left argument is undefined. For example, in <apll>foo/3 0⍴⊂⍳4</apll>, the (right) argument passed to the ~~function~~ is <apll>0 0 0 0</apll>. The return value from the ~~function~~ is used as the common item in the result. Thus, the <apll>⎕ID</apll> entry point is called only once even though the result may have multiple copies of the return value.</p>		* <p>In the Identity element case, the AFO/UDFO is called with the Reduction function's right argument '''prototype''' as the right argument to the AFO/UDFO; the left argument is undefined. For example, in <apll>foo/3 0⍴⊂⍳4</apll>, the (right) argument passed to the <apll>⎕ID:</apll> entry point is <apll>0 0 0 0</apll>. The return value from the AFO/UDFO is used as the common item in the result. Thus, the <apll>⎕ID</apll> entry point is called only once even though the result may have multiple copies of the return value.</p>

	* <p>In the Multiset case, the ~~user-defined function~~/~~operator~~ is called with the same argument(s) as the ~~multiset~~ derived function.</p>		* <p>In the Multiset case, the AFO/UDFO is called with the same argument(s) as the Multiset derived function.</p>

	* <p>In the Prototype case, the ~~user-defined function~~/~~operator~~ is called with arguments that are the prototypes of the respective arguments; in the monadic case, the left argument is undefined.</p>		* <p>In the Prototype case, the AFO/UDFO is called with arguments that are the '''prototypes''' of the respective arguments; in the monadic case, the left argument is undefined.</p>

	* <p>For the moment, if two or more system labels would be called at the same time (such as the last example above), a <apll>NONCE ERROR</apll> is signaled.</p>		* <p>For the moment, if two or more system labels would be called at the same time (such as the last example above), a <apll>NONCE ERROR</apll> is signaled.</p>

	* This idea was taken from the paper by David A. Rabenhorst, "[http://portal.acm.org/citation.cfm?id=801228 APL function variants and system labels]", ACM SIGAPL APL Quote Quad, APL83, Volume 13, Issue 3 (March 1983), pp. 281-284.		* This idea was taken from the paper by David A. Rabenhorst, "[http://portal.acm.org/citation.cfm?id=801228 APL function variants and system labels]", ACM SIGAPL APL Quote Quad, APL83, Volume 13, Issue 3 (March 1983), pp. 281-284.

WikiSysop at 03:38, 1 September 2014

2014-09-01T03:38:42Z

← Older revision		Revision as of 23:38, 31 August 2014
Line 42:		Line 42:
	┌──────────────┐<br />		┌──────────────┐<br />
	│┌8───────────┐│<br />		│┌8───────────┐│<br />
	││Identity 2 2││<br />		││Identity 0 2││<br />
	│└────────────┘2<br />		│└────────────┘2<br />
	└∊─────────────┘<br />		└∊─────────────┘<br />

WikiSysop at 14:44, 22 April 2014

2014-04-22T14:44:09Z

← Older revision		Revision as of 10:44, 22 April 2014
Line 6:		Line 6:
	<table border="0" cellpadding="5" cellspacing="0" summary="">		<table border="0" cellpadding="5" cellspacing="0" summary="">
	<tr>		<tr>
	<td valign="top"><apll>~~⎕PRO~~:</apll></td>		<td valign="top"><apll>⎕ID:</apll></td>
			<td></td>
			<td></td>
			<td>is called when an identity element is needed as in <apll>foo/R</apll> where <apll>R</apll> is empty.</td>
			</tr>

			<tr>
			<td valign="top"><apll>⎕MS:</apll></td>
	<td></td>		<td></td>
	<td></td>		<td></td>
	<td>is called ~~where~~ a ~~prototype element is needed as in <apll>foo¨R</apll> where <apll>R<~~/~~apll>~~ is ~~empty, or <apll>L foo¨R</apll> where one of both of <apll>L</apll> or <apll>R</apll> is empty and~~ the ~~other is conformable~~.</td>		<td>is called when a user-defined function/operator is invoked by the [[Multisets\|Multiset Operator]].</td>
	</tr>		</tr>

	<tr>		<tr>
	<td valign="top"><apll>~~⎕ID~~:</apll></td>		<td valign="top"><apll>⎕PRO:</apll></td>
	<td></td>		<td></td>
	<td></td>		<td></td>
	<td>is called ~~where an identity~~ element is needed as in <apll>~~foo~~/R</apll> where <apll>R</apll> is empty.</td>		<td>is called when a prototype element is needed as in <apll>foo¨R</apll> where <apll>R</apll> is empty, or <apll>L foo¨R</apll> where one of both of <apll>L</apll> or <apll>R</apll> is empty and the other is conformable.</td>
	</tr>		</tr>
	</table>		</table>
Line 24:		Line 32:
	<p>For example,</p>		<p>For example,</p>

	<apll>    ∇ ~~Z←L~~ foo R<br />		<apll>    ∇ Z←{L} foo R<br />
	[1]   Z←L,R ⋄ →0<br />		[1]   Z←L,R ⋄ →0<br />
	[2]   ~~⎕PRO~~:Z←'~~Prototype~~' ⋄ →0<br />		[2]   ⎕ID :Z←'Identity' ,(⎕NC 'L'),(⎕NC 'R') ⋄ →0<br />
	[3]   ~~⎕ID~~:Z←'~~Identity~~'<br />		[3]   ⎕MS :Z←'Multiset' ,(⎕NC 'L'),(⎕NC 'R') ⋄ →0<br />
			[4]   ⎕PRO:Z←'Prototype',(⎕NC 'L'),(⎕NC 'R') ⋄ →0<br />
	∇<br /></apll>		∇<br /></apll>

	<apll>      ⎕fmt foo/⍬<br />		<apll>      ⎕fmt foo/⍬<br />
	~~┌──────────┐~~<br />		┌──────────────┐<br />
	~~│┌8───────┐│~~<br />		│┌8───────────┐│<br />
	~~││Identity││~~<br />		││Identity 2 2││<br />
	~~│└────────┘2~~<br />		│└────────────┘2<br />
	~~└∊─────────┘~~<br />		└∊─────────────┘<br />
			foo⍦ 1<br />
			Multiset 0 2<br />
			2 foo⍦ 1<br />
			Multiset 2 2<br />
	⎕fmt 1 foo¨⍬<br />		⎕fmt 1 foo¨⍬<br />
	~~┌0──────────┐~~<br />		┌0──────────────┐<br />
	~~│┌9────────┐│~~<br />		│┌11───────────┐│<br />
	││         ││<br />		││          0 0││<br />
	~~│└─────────┘2~~<br />		│└─────────────┘2<br />
	~~└∊──────────┘~~<br />		└∊──────────────┘<br />
	foo/¨0⍴⊂⍬<br />		foo/¨0⍴⊂⍬<br />
	NONCE ERROR<br />		NONCE ERROR<br />
Line 48:		Line 61:

	* <p>In the Identity element case, the function is called with the reduction function's right argument prototype as the right argument to the user-defined function/operator; the left argument is undefined. For example, in <apll>foo/3 0⍴⊂⍳4</apll>, the (right) argument passed to the function is <apll>0 0 0 0</apll>. The return value from the function is used as the common item in the result. Thus, the <apll>⎕ID</apll> entry point is called only once even though the result may have multiple copies of the return value.</p>		* <p>In the Identity element case, the function is called with the reduction function's right argument prototype as the right argument to the user-defined function/operator; the left argument is undefined. For example, in <apll>foo/3 0⍴⊂⍳4</apll>, the (right) argument passed to the function is <apll>0 0 0 0</apll>. The return value from the function is used as the common item in the result. Thus, the <apll>⎕ID</apll> entry point is called only once even though the result may have multiple copies of the return value.</p>

			* <p>In the Multiset case, the user-defined function/operator is called with the same argument(s) as the multiset derived function.</p>

	* <p>In the Prototype case, the user-defined function/operator is called with arguments that are the prototypes of the respective arguments; in the monadic case, the left argument is undefined.</p>		* <p>In the Prototype case, the user-defined function/operator is called with arguments that are the prototypes of the respective arguments; in the monadic case, the left argument is undefined.</p>

WikiSysop at 22:56, 29 August 2010

2010-08-29T22:56:01Z

← Older revision		Revision as of 18:56, 29 August 2010
Line 52:		Line 52:

	* <p>For the moment, if two or more system labels would be called at the same time (such as the last example above), a <apll>NONCE ERROR</apll> is signaled.</p>		* <p>For the moment, if two or more system labels would be called at the same time (such as the last example above), a <apll>NONCE ERROR</apll> is signaled.</p>

			* This idea was taken from the paper by David A. Rabenhorst, "[http://portal.acm.org/citation.cfm?id=801228 APL function variants and system labels]", ACM SIGAPL APL Quote Quad, APL83, Volume 13, Issue 3 (March 1983), pp. 281-284.

WikiSysop at 22:49, 29 August 2010

2010-08-29T22:49:50Z

← Older revision		Revision as of 18:49, 29 August 2010
Line 51:		Line 51:
	* <p>In the Prototype case, the user-defined function/operator is called with arguments that are the prototypes of the respective arguments; in the monadic case, the left argument is undefined.</p>		* <p>In the Prototype case, the user-defined function/operator is called with arguments that are the prototypes of the respective arguments; in the monadic case, the left argument is undefined.</p>

	* <p>For the moment, if two or more ~~System Labels~~ would be called at the same time (such as the last example above), a <apll>NONCE ERROR</apll> is signaled.</p>		* <p>For the moment, if two or more system labels would be called at the same time (such as the last example above), a <apll>NONCE ERROR</apll> is signaled.</p>

WikiSysop at 22:49, 29 August 2010

2010-08-29T22:49:06Z

← Older revision		Revision as of 18:49, 29 August 2010
Line 6:		Line 6:
	<table border="0" cellpadding="5" cellspacing="0" summary="">		<table border="0" cellpadding="5" cellspacing="0" summary="">
	<tr>		<tr>
	<td valign="top"><apll>~~⎕PROTOTYPE~~:</apll></td>		<td valign="top"><apll>⎕PRO:</apll></td>
	<td></td>		<td></td>
	<td></td>		<td></td>
Line 12:		Line 12:
	</tr>		</tr>
	<tr>		<tr>
	<td valign="top"><apll>~~⎕IDENTITY~~:</apll></td>		<td valign="top"><apll>⎕ID:</apll></td>
	<td></td>		<td></td>
	<td></td>		<td></td>
Line 26:		Line 26:
	<apll>    ∇ Z←L foo R<br />		<apll>    ∇ Z←L foo R<br />
	[1]   Z←L,R ⋄ →0<br />		[1]   Z←L,R ⋄ →0<br />
	[2]   ~~⎕PROTOTYPE~~:Z←'Prototype' ⋄ →0<br />		[2]   ⎕PRO:Z←'Prototype' ⋄ →0<br />
	[3]   ~~⎕IDENTITY~~:Z←'Identity'<br />		[3]   ⎕ID:Z←'Identity'<br />
	∇<br /></apll>		∇<br /></apll>

	<apll>      ⎕fmt foo/⍳0<br />		<apll>      ⎕fmt foo/⍬<br />
	┌──────────┐<br />		┌──────────┐<br />
	│┌8───────┐│<br />		│┌8───────┐│<br />
Line 39:		Line 39:
	┌0──────────┐<br />		┌0──────────┐<br />
	│┌9────────┐│<br />		│┌9────────┐│<br />
	~~││Prototype││~~<br />		││         ││<br />
	│└─────────┘2<br />		│└─────────┘2<br />
	└∊──────────┘<br /></apll>		└∊──────────┘<br />
			foo/¨0⍴⊂⍬<br />
			NONCE ERROR<br />
			foo/¨0⍴⊂⍬<br />
			∧</apll>

	* <p>In the Identity element case, the function is called with the reduction function's right argument prototype as the right argument to the user-defined function/operator; the left argument is undefined. For example, in <apll>foo/3 0⍴⊂⍳4</apll>, the (right) argument passed to the function is <apll>0 0 0 0</apll>. The return value from the function is used as the common item in the result. Thus, the <apll>~~⎕IDENTITY~~</apll> entry point is called only once even though the result may have multiple copies of the return value.</p>		* <p>In the Identity element case, the function is called with the reduction function's right argument prototype as the right argument to the user-defined function/operator; the left argument is undefined. For example, in <apll>foo/3 0⍴⊂⍳4</apll>, the (right) argument passed to the function is <apll>0 0 0 0</apll>. The return value from the function is used as the common item in the result. Thus, the <apll>⎕ID</apll> entry point is called only once even though the result may have multiple copies of the return value.</p>

	* <p>In the Prototype case, the user-defined function/operator is called with arguments that are the prototypes of the respective arguments; in the monadic case, the left argument is undefined.</p>		* <p>In the Prototype case, the user-defined function/operator is called with arguments that are the prototypes of the respective arguments; in the monadic case, the left argument is undefined.</p>

			* <p>For the moment, if two or more System Labels would be called at the same time (such as the last example above), a <apll>NONCE ERROR</apll> is signaled.</p>

WikiSysop at 00:48, 18 May 2010

2010-05-18T00:48:46Z

← Older revision		Revision as of 20:48, 17 May 2010
Line 9:		Line 9:
	<td></td>		<td></td>
	<td></td>		<td></td>
	<td>is called where a prototype element is needed as in <apll>foo¨R</apll> where <apll>R</apll> is empty.</td>		<td>is called where a prototype element is needed as in <apll>foo¨R</apll> where <apll>R</apll> is empty, or <apll>L foo¨R</apll> where one of both of <apll>L</apll> or <apll>R</apll> is empty and the other is conformable.</td>
	</tr>		</tr>
	<tr>		<tr>
Line 45:		Line 45:
	* <p>In the Identity element case, the function is called with the reduction function's right argument prototype as the right argument to the user-defined function/operator; the left argument is undefined. For example, in <apll>foo/3 0⍴⊂⍳4</apll>, the (right) argument passed to the function is <apll>0 0 0 0</apll>. The return value from the function is used as the common item in the result. Thus, the <apll>⎕IDENTITY</apll> entry point is called only once even though the result may have multiple copies of the return value.</p>		* <p>In the Identity element case, the function is called with the reduction function's right argument prototype as the right argument to the user-defined function/operator; the left argument is undefined. For example, in <apll>foo/3 0⍴⊂⍳4</apll>, the (right) argument passed to the function is <apll>0 0 0 0</apll>. The return value from the function is used as the common item in the result. Thus, the <apll>⎕IDENTITY</apll> entry point is called only once even though the result may have multiple copies of the return value.</p>

	* <p>In the Prototype case, the user-defined function/operator is called with arguments that are the prototypes of the respective arguments.</p>		* <p>In the Prototype case, the user-defined function/operator is called with arguments that are the prototypes of the respective arguments; in the monadic case, the left argument is undefined.</p>