Annotated lambda diagram - Revision history

Apm: added links to page control flow multiverse

2024-12-27T19:04:25Z

added links to page control flow multiverse

← Older revision		Revision as of 21:04, 27 December 2024
Line 102:		Line 102:
	= Add live-coding to ALDs =		= Add live-coding to ALDs =

	The dependency graph (not tree!) of a codebase is basically a multiverse of all possible controlflow-paths that <br>		The dependency graph (not tree!) of a codebase is basically a [[control flow multiverse\|multiverse of all possible controlflow-paths]] that <br>
	an execution of this codebase can possibly take. <br>		an execution of this codebase can possibly take. <br>
	Since ALDs lay out controlflow-path-branching case-expressions in space <br>		Since ALDs lay out controlflow-path-branching case-expressions in space <br>
Line 158:		Line 158:

	{\| style="margin-left: auto; margin-left: 0px;"		{\| style="margin-left: auto; margin-left: 0px;"
	\|[[File:AnnoLamDiag ControlFlowMultiverse.jpeg\|1024px\|thumb\|left\|'''Peering into the entirety of the control flow multiverse while it's running live.''' The lines highlighted in dark blue mark the control flow path that is active at the current moment of execution time (possibly paused). A bright cyan background marks the active case-of-branches. – The "demo" function performs constructive corecursion with dataconstructors. The "showBinFancily" function performs deconstructive recursion with the case of construct. {{Todo\|Investigate avoiding recursive definitions alltogether. See Book: "The Little Typer"}}]]		\|[[File:AnnoLamDiag ControlFlowMultiverse.jpeg\|1024px\|thumb\|left\|'''Peering into the entirety of the [[control flow multiverse]] while it's running live.''' The lines highlighted in dark blue mark the control flow path that is active at the current moment of execution time (possibly paused). A bright cyan background marks the active case-of-branches. – The "demo" function performs constructive corecursion with dataconstructors. The "showBinFancily" function performs deconstructive recursion with the case of construct. {{Todo\|Investigate avoiding recursive definitions alltogether. See Book: "The Little Typer"}}]]
	\|}		\|}

Line 263:		Line 263:
	'''Other nice properties:'''		'''Other nice properties:'''

	* Seeing the whole code multiverse at a glance – and and the live running state as a literal "red thread" within.		* Seeing the whole [[control flow multiverse\|code multiverse]] at a glance – and and the live running state as a literal "red thread" within.
	* Browsing the codebase in all dimensions without detours and disruptive jumps <br> Human mental RAM is limited, it shouldn't be used for pointless navigation hurdles.		* Browsing the codebase in all dimensions without detours and disruptive jumps <br> Human mental RAM is limited, it shouldn't be used for pointless navigation hurdles.

Apm: /* Related / added link to new page Annotated lambda diagrams visual rules

2024-12-03T13:47:19Z

Related: added link to new page * Annotated lambda diagrams visual rules

← Older revision		Revision as of 15:47, 3 December 2024
Line 382:		Line 382:
	* [[Projectional editors]]		* [[Projectional editors]]
	* [[Software]]		* [[Software]]
			----
			* [[Annotated lambda diagrams visual rules]]
	----		----
	* [[The problem with current day programming and its causes]]		* [[The problem with current day programming and its causes]]

Apm: /* ALDs are not a "node editor" */ link to yet unwritten page node editor

2024-08-18T08:39:29Z

ALDs are not a "node editor": link to yet unwritten page node editor

← Older revision		Revision as of 10:39, 18 August 2024
Line 20:		Line 20:

	While there are visual line and box elements, <br>		While there are visual line and box elements, <br>
	ALDs are not a node editor simply because they do not feature nodes. <br>		ALDs are not a [[node editor]] simply because they do not feature nodes. <br>
	What may look like nodes are merely tags/annotations of the lines. <br>		What may look like nodes are merely tags/annotations of the lines. <br>
	As such there is no need to decide		As such there is no need to decide

Apm at 08:44, 5 May 2024

2024-05-05T08:44:08Z

← Older revision		Revision as of 10:44, 5 May 2024
Line 400:		Line 400:

	[[Category:Programming]]		[[Category:Programming]]
			[[Category:Software]]

Apm at 18:41, 19 November 2021

2021-11-19T18:41:02Z

← Older revision		Revision as of 20:41, 19 November 2021
Line 223:		Line 223:
	Except one little "+" or something as the starting point for [[progressive disclosure]]. <br>		Except one little "+" or something as the starting point for [[progressive disclosure]]. <br>
	A [[progressive disclosure]] step opens up the ALD that corresponds to the visual element (a Tangible Value). <br>		A [[progressive disclosure]] step opens up the ALD that corresponds to the visual element (a Tangible Value). <br>
	From there the "end-user" (now elevated to status of "deveuser") can trace the codebase to non-displayed or even non-visual code elements. <br>		From there the "end-user" (now elevated to status of "[[deveuser]]") can trace the codebase to non-displayed or even non-visual code elements. <br>
	Tracing the codebase entails tracing the nicely visually traceable lines in the ALDs. <br>		Tracing the codebase entails tracing the nicely visually traceable lines in the ALDs. <br>

Apm: /* Further important properties */ added numbering to the rest too to have it consistent

2021-10-30T08:46:46Z

Further important properties: added numbering to the rest too to have it consistent

← Older revision		Revision as of 10:46, 30 October 2021
Line 297:		Line 297:
	* (1b) ... start writing program fragments at arbitrary "floating" place that are neither top-most nor bottom-most		* (1b) ... start writing program fragments at arbitrary "floating" place that are neither top-most nor bottom-most
	* (1c) ... deliberately cross invalid states since that is the fastest path to valid states again		* (1c) ... deliberately cross invalid states since that is the fastest path to valid states again

			[[Structural editors]] provide huge opportunies in improvement in
			* (2) ... management of code versions at the single edit level
			* (3) ... seeing as much of all the code processing phases as possible (gradual typing ...)

	=== (0) Allow to type normally – highly advisable ===		=== (0) Allow to type normally – highly advisable ===
Line 312:		Line 316:
	The solution seem to be to treat holes in the program as explicit formal entities that carry transformation rules. As [[typed holes]]. <br>		The solution seem to be to treat holes in the program as explicit formal entities that carry transformation rules. As [[typed holes]]. <br>

	=== Treat user edits formally ===		=== (2) Treat user edits formally ===

	Treat program transformations that are executed by the programmer during programming (aka user edits during "edit-time") formally. <br>		Treat program transformations that are executed by the programmer during programming (aka user edits during "edit-time") formally. <br>
Line 329:		Line 333:
	(The hole process seems analogous to a Taylor series.)		(The hole process seems analogous to a Taylor series.)

	=== From batch-processed "times" to interleaved "phases" ===		=== (3) From batch-processed "times" to interleaved "phases" ===

	Have edit-time, compile-time, and run-time all happening at the same time in different parts of the program. <br>		Have edit-time, compile-time, and run-time all happening at the same time in different parts of the program. <br>

Apm: /* Treat user edits formally */ added link to yet unwritten page discovered rather than invented

2021-10-30T08:17:23Z

Treat user edits formally: added link to yet unwritten page discovered rather than invented

← Older revision		Revision as of 10:17, 30 October 2021
Line 317:		Line 317:
	Ideally record them in the same (or extended) formal framework in which the program transformations during code execution (compile-time and run-time) happen. <br>		Ideally record them in the same (or extended) formal framework in which the program transformations during code execution (compile-time and run-time) happen. <br>

	There might be an elegant (~~dicovered~~ rather than invented) way to efficiently store code changes (versions with undo history) via <br>		There might be an elegant ([[discovered rather than invented]]) way to efficiently store code changes (versions with undo history) via <br>
	formally differentiating the datastructures in which the code is represented in. <br>		formally differentiating the datastructures in which the code is represented in. <br>
	In fact the edit calculus might be derivable from that. <br>		In fact the edit calculus might be derivable from that. <br>

Apm: /* (1) Do not create insurmountable obstacles for code-changes – mandatory */ added missing "this"

2021-10-30T08:15:24Z

(1) Do not create insurmountable obstacles for code-changes – mandatory: added missing "this"

← Older revision		Revision as of 10:15, 30 October 2021
Line 308:		Line 308:
	=== (1) Do not create insurmountable obstacles for code-changes – mandatory ===		=== (1) Do not create insurmountable obstacles for code-changes – mandatory ===

	(1) If not averted does, in contrast to (0), pose a fundamental limitation to programming UI system since <br>		(1) If not averted this does, in contrast to (0), pose a fundamental limitation to programming UI system since <br>
	some essentially important program transformation pathways are fundamentally blocked. This absolutely must not be the case. <br>		some essentially important program transformation pathways are fundamentally blocked. This absolutely must not be the case. <br>
	The solution seem to be to treat holes in the program as explicit formal entities that carry transformation rules. As [[typed holes]]. <br>		The solution seem to be to treat holes in the program as explicit formal entities that carry transformation rules. As [[typed holes]]. <br>

Apm: /* Further important properties */ or => nor & added dashes

2021-10-30T08:14:17Z

Further important properties: or => nor & added dashes

← Older revision		Revision as of 10:14, 30 October 2021
Line 295:		Line 295:
	* (0) ... [[type normally]] and thus presenting new users with a steep learning curve to a novel experimental system that might no even be worth learning.		* (0) ... [[type normally]] and thus presenting new users with a steep learning curve to a novel experimental system that might no even be worth learning.
	* (1a) ... extend program fragments in both directions (code upstream and code downstream)		* (1a) ... extend program fragments in both directions (code upstream and code downstream)
	* (1b) ... start writing program fragments at arbitrary "floating" place that are neither ~~topmost or bottommost~~		* (1b) ... start writing program fragments at arbitrary "floating" place that are neither top-most nor bottom-most
	* (1c) ... deliberately cross invalid states since that is the fastest path to valid states again		* (1c) ... deliberately cross invalid states since that is the fastest path to valid states again

Apm: /* (0) Allow to type normally – highly advisable */ removed doubled not

2021-10-30T08:13:34Z

(0) Allow to type normally – highly advisable: removed doubled not

← Older revision		Revision as of 10:13, 30 October 2021
Line 300:		Line 300:
	=== (0) Allow to type normally – highly advisable ===		=== (0) Allow to type normally – highly advisable ===

	(0) Is heavily hampering adoption rate but does ~~not~~ not necessarily pose a fundamental limitation to the programming UI system. <br>		(0) Is heavily hampering adoption rate but does not necessarily pose a fundamental limitation to the programming UI system. <br>
	Perhaps there really ''is'' a better way to program than to [[type normally]]. That remains to be shown though. <br>		Perhaps there really ''is'' a better way to program than to [[type normally]]. That remains to be shown though. <br>
	Perhaps for small form-factor touchscreen-only type devices. <br>		Perhaps for small form-factor touchscreen-only type devices. <br>