X-Git-Url: https://git.stderr.nl/gitweb?p=matthijs%2Fmaster-project%2Freport.git;a=blobdiff_plain;f=Outline;h=bbcf46ad914c0e12a0a8615ef1786b1ff3c53db7;hp=0825321c66cf5b6bd53a1aa0a4c240cee33bf9c7;hb=e1224b075420c7bb5508121b694e8b315b835534;hpb=06f9b8afcdca6cc6cd82af650666c9d1faf27b98

diff --git a/Outline b/Outline
index 0825321..bbcf46a 100644
--- a/Outline
+++ b/Outline
@@ -1,43 +1,62 @@
-Context
-  Other FHDLs (short, Christiaan has details)
-
-  Advantages of clash / why clash?
-
-  VHDL / Verilog / EDIF etc. Why VHDL?
+Introduction
+*       Goals
+*       Outline
 
+*Context
+*       Other FHDLs (short, Christiaan has details)
+*       Advantages of clash / why clash?
 
 Haskell as hardware
-        Simple function -> component interpretation (Model: Structure)
-        Model: State
-          Explicit vs implicit passing of state (e.g, delay)
-          Explicit vs implicit marking
-        Interpret: Polymorphism
-        Interpret: Higher order
-	Need: Dependent types
-	Impossible things: Infinite recursion, higher order expressions
+*       Simple function -> component interpretation (Model: Structure)
+*       Choice / Case
+*       Types
+*       Partial application
+*       Model: State
+*         Explicit vs implicit passing of state (e.g, delay)
+*         Explicit vs implicit marking
+*       Interpret: Polymorphism
+*       Interpret: Higher order
+*       Recursion
 
 Prototype
-        Choice of Haskell
-        Core - description of the language (appendix?)
-	Stages (-> Core, Normalization, -> VHDL)
-        Implementation issues
-
-        Haskell language coverage / constraints
-                Recursion
-                Builtin types
-                Custom types (Sum types, product types)
-                Function types / higher order expressions
+*       Choice of Haskell
+*       VHDL / Verilog / EDIF etc. Why VHDL?
+*	Stages (-> Core, Normalization, -> VHDL)
+.       Core - description of the language
+*         Expressions
+          Typing
+        Implementation issues -- Which?
+        State annotations
 
 Normalization
-	Normal form
-	Rules used
-	Completeness / conditions on input
-	Termination
-	Casts
+*	Normal form
+*	Rules used
+.	Properties / Proofs (termination, soundness, completeness, determinism)
 
 Future work
-	Boilerplate reduction (State distribution & pipelining)
-	Recursion
-	Multiple time domains (Events)
-	Multiple cycle descriptions
-        Higher order state
+*	Boilerplate reduction (State distribution & pipelining)
+*	Recursion
+*       Multiple time domains (Events) -- Also, clock line optimization /
+                                       -- write enable
+*	Multiple cycle descriptions
+*       Higher order state
+*       New language
+*       Don't care
+
+TODO: Define user / developer
+TODO: Hardware description / model vs program
+TODO: Separate compilation / Prelude
+TODO: User-defined type classes (future work?)
+TODO: Entity / Architecture / Component vs Function?
+TODO: Expand on "representable"
+TODO: Register
+TODO: Variable vs binder
+TODO: simplification -> Normalisation?
+TODO: Use saturated (application) instead of complete (application)?
+TODO: core => Core
+TODO: Say something about implementation differences with transformation specs
+TODO: Say something about the builtin functions somewhere (ref: christiaan)
+TODO: Future work: Use Cλash
+TODO: Abstract
+TODO: Preface
+TODO: Top level function -> top level binder