update sorting

Author: co-dan

_data/projects.json

@@ -249,7 +249,7 @@ Additional reading:
 
 - [Lecture Notes on Bidirectional Typechecking](https://www.cs.cmu.edu/~fp/courses/15312-f04/handouts/15-bidirectional.pdf)
 ",
-        "tags": ["type systems", "programming languages"],
+        "tags": ["type theory", "programming languages"],
         "category": "BSc",
         "available": 1
     },
@@ -278,7 +278,7 @@ Potential improvements/extensions are:
 
 - Conversaion between Fitch-style and Gentzen-style proof systems
 ",
-        "tags": ["logic", "programming"],
+        "tags": ["logic", "implementation"],
         "category": "BSc",
         "available": 1
     },
@@ -308,7 +308,7 @@ Here are some more links that contextualize the project:
 
 - See also the [previous student projects](past-projects.html) on this topic.
 ",
-        "tags": ["logic", "functional programming", "verification"],
+        "tags": ["logic", "functional programming", "formal verification"],
         "category": "BSc",
         "available": 2
     },
@@ -405,7 +405,7 @@ See <https://www.jperez.nl/teaching/projects> for a list of suggested pointers.
 **Deliverables:**
 A written report, in the style of a scientific paper, that surveys in a self-contained manner different characterizations of client-sever interactions using linear logic.
 ",
-        "tags": ["type systems", "concurrency", "logic"],
+        "tags": ["type theory", "concurrency", "logic"],
         "category": "BSc",
         "available": 1
     },
@@ -432,7 +432,7 @@ See <https://www.jperez.nl/teaching/projects> for a list of suggested pointers.
 A written report, in the style of a scientific paper, that presents your verified implementation of the Dining Philosophers problem in APCP. 
 
 ",
-        "tags": ["concurrency", "type systems", "formal verification"],
+        "tags": ["concurrency", "type theory", "formal verification"],
         "category": "BSc",
         "available": 1
     },
@@ -458,7 +458,7 @@ See <https://www.jperez.nl/teaching/projects> for a list of suggested pointers.
 **Deliverables:**
 A written report, in the style of a scientific paper, that presents your formal analysis (definitions and proofs) for the upper bound of buffers in APCP. 
 ",
-        "tags": ["concurrency", "type systems", "formal verification", "logic"],
+        "tags": ["concurrency", "type theory", "formal verification", "logic"],
         "category": "BSc",
         "available": 1
     },

_includes/project-list.html

@@ -1,6 +1,9 @@
 {% assign projects = include.projects | default: site.data.projects %}
+{% assign projects = projects | group_by: "supervisor.name" | sort: "name" %}
 {% if projects and projects.size > 0 %}
   <ul class="project-grid">
+    {% for project_group in projects %}
+    {% assign projects = project_group.items | sort: "title" %}
     {% for project in projects %}
       {% assign project_id = project.title | slugify | append: '-' | append: forloop.index0 %}
       {% assign normalized_tags = '' %}
@@ -74,6 +77,7 @@ <h2>{{ project.title }}</h2>
         {% endif %}
       </li>
     {% endfor %}
+    {% endfor %}
   </ul>
 {% else %}
   <p>No projects are listed yet. Check back soon!</p>