Differences

This shows you the differences between two versions of the page.

--- history:start [2024/03/26 10:14] – rajit
+++ history:start [2025/01/27 12:16] (current) – rajit
@@ Line 23: / Line 23: @@
 define f (node a)
 {  node p, q;
-    prs {
+   prs {
-        p -> q+
+       p -> q+
-     }
+    }
-    a = p;
+   a = p;
  }
 f();
@@ Line 35: / Line 35: @@
    * 1998-2003 Development continued at Caltech, including embedding CAST-like syntax within the Modula-3 language. This version was used to design the Lutonium processor.
    * 2004 A language that provided the same functionality as CAST but with syntax for new features (not implemented) was developed at Cornell by Rajit Manohar, based on lessons from using CAST for chip design. This was called ACT (version 0; 0 because the new features were not supported yet)
-   * 2005-2008 ACT v0 was used by Achronix Semiconductor, a startup company founded by Rajit Manohar along with some of his Ph.D. students.
+   * 2005-2008 ACT v0 was used by Achronix Semiconductor, a startup company founded by Rajit Manohar along with some of his Ph.D. students. The same example above would be specified as follows in ACT v0.
+<code>
+defproc f (bool a)
+{  bool p, q;
+   prs {
+       p -> q+
+    }
+   a = p;
+ }
+f dummy;
+</code>
    * 2005-2010 An open-source (GPLed) implementation of an ACT v0 variant (called "HACKT") was developed by David Fang (student in Rajit Manohar's group) as part of his Ph.D. dissertation.
    * 2005-2014: ACT was used to implement a large number of asynchronous chips, including microprocessors, FPGAs, a GPS baseband engine, digital circuits in continuous-time signal processing hardware, neuromorphic hardware, etc.
@@ Line 42: / Line 52: @@
    * 2012, Intel acquires Fulcrum Microsystems, as well as the version of the CAST tools developed by Fulcrum.
    * 2017, actual implementation of the new features started at Yale with a fresh implementation of the entire system.
-   * 2018, Most features of ACT v1 ready
+   * 2018, Most features of ACT v1 ready. The example above would be defined as follows:
+<code act>
+defproc f (bool? a)
+{  bool p, q;
+   prs {
+       p -> q+
+    }
+   a = p;
+ }
+f dummy;
+</code>
    * 1/2019, first [[http://github.com/asyncvlsi/act|open-source release]]
    * 4/2019, documentation effort initiated
+ACT Language features (current version):
+  * 1/2019: support for production rules and netlist generation