chad-fast - [no description]

	Commit message (Collapse)	Author	Age
...
*	Differentiate Replicate	Tom Smeding	2024-10-22
\|
*	Tests	Tom Smeding	2024-10-21
\|
*	WIP testing neural	Tom Smeding	2024-10-18
\|
*	We can differentiate id	Tom Smeding	2024-10-15
\|
*	More towards test suite	Tom Smeding	2024-10-14
\|
*	Towards a test suite	Tom Smeding	2024-10-07
\|
*	Reverse-by-forward, and checking neural (it's wrong)	Tom Smeding	2024-10-01
\|
*	Dual-numbers forward AD	Tom Smeding	2024-09-28
\|
*	The size of the empty shape is 1, not 0	Tom Smeding	2024-09-26
\|
*	Test neural	Tom Smeding	2024-09-25
\|
*	Add some missing cases	Tom Smeding	2024-09-22
\|
*	Interpreter typechecks, at the cost of compositionality of RepAc	Tom Smeding	2024-09-22
\|
*	Stuff	Tom Smeding	2024-09-22
\|
*	Some hacking	Tom Smeding	2024-09-22
\|
*	A little interpreter accum progress	Tom Smeding	2024-09-16
\|
*	WIP Accum stuff	Tom Smeding	2024-09-15
\|
*	WIP better zero/plus, fixing Accum (...)	Tom Smeding	2024-09-13
\| \| \| \| \| \| \| \| \| \| \| \| \|	The accumulator implementation was wrong because it forgot (in accumAdd) to take into account that values may be variably-sized. Furthermore, it was also complexity-inefficient because it did not build up a sparse value. Thus let's go for the Haskell-interpreter-equivalent of what a real, fast, compiled implementation would do: just a tree with mutable variables. In practice one can decide to indeed flatten parts of that tree, i.e. using a tree representation for nested pairs is bad, but that should have been done _before_ execution and for _all_ occurrences of that type fragment, not live at runtime by the accumulator implementation.
*	Towards neural	Tom Smeding	2024-09-12
\|
*	Interpreter, some operations	Tom Smeding	2024-09-12
\|
*	Finish Accum implementation	Tom Smeding	2024-09-11
\|
*	More WIP interpreter	Tom Smeding	2024-09-11
\|
*	WIP interpreter	Tom Smeding	2024-09-06
\|
*	Named source language	Tom Smeding	2024-09-06
\|
*	WIP better frontend	Tom Smeding	2024-09-05
\|
*	A simple embedded frontend	Tom Smeding	2024-09-05
\|
*	Simple Build1 seems to work	Tom Smeding	2024-09-05
\|
*	Generic accumulators	Tom Smeding	2024-09-05
\|
*	WIP	Tom Smeding	2024-09-04
\|
*	Some work	Tom Smeding	2024-09-03
\|
*	Inching towards drev of build	Tom Smeding	2024-09-03
\|
*	autoWeak: Handle closed source environments	Tom Smeding	2024-09-03
\|
*	accumPromote	Tom Smeding	2024-09-02
\|
*	WSwap needs no env singleton	Tom Smeding	2024-09-02
\|
*	Code cleanup, and OverloadedLabels for LSeg	Tom Smeding	2024-09-02
\|
*	Autoweak!	Tom Smeding	2024-09-02
\|
*	WIP autoWeak	Tom Smeding	2024-09-02
\|
*	WIP Build1	Tom Smeding	2024-08-30
\|
*	Style	Tom Smeding	2024-08-30
\|
*	Implement weakenExpr using subst	Tom Smeding	2024-08-30
\| \| \| \|	This saves one traversal function.
*	Migrate to accumulators (mostly removing EVM code)	Tom Smeding	2024-08-30
\|
*	rules: Attempt at merge/accum parameterised transformationevm	Tom Smeding	2024-08-29
\|
*	Generalise freezeRet a little bit	Tom Smeding	2024-08-29
\|
*	Type up some of the rules in LaTeX	Tom Smeding	2024-08-29
\|
*	Add missing import	Tom Smeding	2024-02-15
\|
*	Ramblings in Compile	Tom Smeding	2024-01-27
\|
*	Move some definitions from AST to Data	Tom Smeding	2024-01-27
\|
*	Less default case	Tom Smeding	2024-01-27
\|
*	Linear-time tape reconstruction	Tom Smeding	2024-01-26
\| \| \| \|	A tutorial of the method here: https://play.haskell.org/saved/uHuGLfHZ
*	Embrace the PartialTypeSignatures	Tom Smeding	2024-01-25
\|
*	Finish rewrite	Tom Smeding	2024-01-25
\|