Skip to content

Commit

Permalink
Merge pull request #258 from xanovsky/master
Browse files Browse the repository at this point in the history
Awards edits
  • Loading branch information
sampsyo authored Nov 3, 2024
2 parents ac39d41 + 2f9493c commit 07c23e9
Show file tree
Hide file tree
Showing 3 changed files with 18 additions and 1 deletion.
5 changes: 4 additions & 1 deletion Cares/previous.md
Original file line number Diff line number Diff line change
@@ -1,4 +1,7 @@
### Former SIGPLAN CARES Committee Members
---
layout: default
title: "Former SIGPLAN CARES Committee Members"
---

<table style="width:100%" border="0">
<tr>
Expand Down
7 changes: 7 additions & 0 deletions _data/ICFP.yaml
Original file line number Diff line number Diff line change
@@ -1,3 +1,10 @@
2024:
- Awardee: Niki Vazou, Eric L. Seidel, Ranjit Jhala, Dimitrios Vytiniotis, Simon Peyton-Jones
Other: |
(for 2014) _[Refinement Types for Haskell](https://dl.acm.org/doi/10.1145/2628136.2628161)_
Citation: |
This paper integrated refinement types in Haskell through the proposal of Liquid Types, a specific form of refinement types that balance expressiveness with decidability. Liquid Types provide a practical and powerful tool for ensuring program correctness. The paper has had significant impact on both academic research and practical programming, inspiring further work on refinement types in other languages and in applications such as program synthesis and software contracts.
2023:
- Awardee: Ohad Kammar, Sam Lindley and Nicolas Oury
Other: |
Expand Down
7 changes: 7 additions & 0 deletions _data/OOPSLA.yaml
Original file line number Diff line number Diff line change
@@ -1,3 +1,10 @@
2024:
- Awardee: Terence Parr, Sam Harwell, Kathleen Fisher
Other: |
(for 2014) _[Adaptive LL(*) parsing: the power of dynamic analysis](https://dl.acm.org/doi/10.1145/2714064.2660202)_
Citation: |
This paper introduces the ALL(*) parsing algorithm, which maintains the simple implementation strategies of top-down parsers while extending their expressiveness to any non-left-recursive grammar and providing linear-time performance in practice. ALL(*) is the foundation of the widely used ANTLR 4 parser generator, representing a major advancement in ANTLR's capabilities compared to earlier versions. The algorithm and ANTLR itself continue to be actively developed and improved over time. The awarded work has had a significant impact on both academic research and practical programming, as ANTLR is widely used to build languages, tools, and frameworks.
2023:
- Awardee: Leo Meyerovich and Ariel Rabkin
Other: |
Expand Down

0 comments on commit 07c23e9

Please sign in to comment.