SIGPLAN

Last updated

SIGPLAN is the Association for Computing Machinery's Special Interest Group (SIG) on programming languages. This SIG explores programming language concepts and tools, focusing on design, implementation, practice, and theory. Its members are programming language developers, educators, implementers, researchers, theoreticians, and users.

Contents

Conferences

Associated journals

Newsletters

Awards

Programming Languages Achievement Award

Recognizes an individual or individuals who has made a significant and lasting contribution to the field of programming languages. [2] [3]

Robin Milner Young Researcher Award

Recognizes outstanding contributions by young researchers in the area of programming languages. [5] The award is named after the computer scientist Robin Milner.

Programming Languages Software Award

Given to an institution or individual(s) to recognize the development of a software system that has had a significant impact on programming language research, implementations, and tools. [6]

SIGPLAN Doctoral Dissertation Award

The full name of this award is the John C. Reynolds Doctoral Dissertation Award, after the computer scientist John C. Reynolds. It is "presented annually to the author of the outstanding doctoral dissertation in the area of Programming Languages." [17]

SIGPLAN Distinguished Service Award

Most Influential PLDI Paper Award

Most Influential POPL Paper Award

Most Influential OOPSLA Paper Award

Most Influential ICFP Paper Award

See also

Related Research Articles

In computer science, functional programming is a programming paradigm where programs are constructed by applying and composing functions. It is a declarative programming paradigm in which function definitions are trees of expressions that map values to other values, rather than a sequence of imperative statements which update the running state of the program.

In computer programming, a type system is a logical system comprising a set of rules that assigns a property called a type to every term. Usually the terms are various language constructs of a computer program, such as variables, expressions, functions, or modules. A type system dictates the operations that can be performed on a term. For variables, the type system determines the allowed values of that term.

In computing, just-in-time (JIT) compilation is compilation during execution of a program rather than before execution. This may consist of source code translation but is more commonly bytecode translation to machine code, which is then executed directly. A system implementing a JIT compiler typically continuously analyses the code being executed and identifies parts of the code where the speedup gained from compilation or recompilation would outweigh the overhead of compiling that code.

The Glasgow Haskell Compiler (GHC) is a native or machine code compiler for the functional programming language Haskell. It provides a cross-platform software environment for writing and testing Haskell code and supports many extensions, libraries, and optimisations that streamline the process of generating and executing code. GHC is the most commonly used Haskell compiler. It is free and open-source software released under a BSD license.

C-- is a C-like programming language, designed to be generated mainly by compilers for high-level languages rather than written by human programmers. It was created by functional programming researchers Simon Peyton Jones and Norman Ramsey. Unlike many other intermediate languages, it is represented in plain ASCII text, not bytecode or another binary format.

<span class="mw-page-title-main">Philip Wadler</span> American computer scientist

Philip Lee Wadler is a UK-based American computer scientist known for his contributions to programming language design and type theory. He is holds the position of Personal Chair of theoretical computer science at the Laboratory for Foundations of Computer Science at the School of Informatics, University of Edinburgh. He has contributed to the theory behind functional programming and the use of monads; and the designs of the purely functional language Haskell and the XQuery declarative query language. In 1984, he created the Orwell language. Wadler was involved in adding generic types to Java 5.0. He is also author of "Theorems for free!", a paper that gave rise to much research on functional language optimization.

<span class="mw-page-title-main">Simon Peyton Jones</span> British computer scientist (born 1958)

Simon Peyton Jones is a British computer scientist who researches the implementation and applications of functional programming languages, particularly lazy functional programming.

In computer science, a type class is a type system construct that supports ad hoc polymorphism. This is achieved by adding constraints to type variables in parametrically polymorphic types. Such a constraint typically involves a type class T and a type variable a, and means that a can only be instantiated to a type whose members support the overloaded operations associated with T.

In functional programming, a generalized algebraic data type is a generalization of a parametric algebraic data type (ADT).

Thread Level Speculation (TLS), also known as Speculative Multi-threading, or Speculative Parallelization, is a technique to speculatively execute a section of computer code that is anticipated to be executed later in parallel with the normal execution on a separate independent thread. Such a speculative thread may need to make assumptions about the values of input variables. If these prove to be invalid, then the portions of the speculative thread that rely on these input variables will need to be discarded and squashed. If the assumptions are correct the program can complete in a shorter time provided the thread was able to be scheduled efficiently.

In the theory of programming languages in computer science, deforestation is a program transformation to eliminate intermediate lists or tree structures that are created and then immediately consumed by a program.

In computer programming, profile-guided optimization, also known as profile-directed feedback (PDF) or feedback-directed optimization (FDO), is the compiler optimization technique of using prior analyses of software artifacts or behaviors ("profiling") to improve the expected runtime performance of the program.

<span class="mw-page-title-main">Aspect weaver</span> Software programming utility

An aspect weaver is a metaprogramming utility for aspect-oriented languages designed to take instructions specified by aspects and generate the final implementation code. The weaver integrates aspects into the locations specified by the software as a pre-compilation step. By merging aspects and classes, the weaver generates a woven class.

Haskell is a general-purpose, statically-typed, purely functional programming language with type inference and lazy evaluation. Designed for teaching, research, and industrial applications, Haskell has pioneered several programming language features such as type classes, which enable type-safe operator overloading, and monadic input/output (IO). It is named after logician Haskell Curry. Haskell's main implementation is the Glasgow Haskell Compiler (GHC).

In computer programming, one of the many ways that programming languages are colloquially classified is whether the language's type system makes it strongly typed or weakly typed. However, there is no precise technical definition of what the terms mean and different authors disagree about the implied meaning of the terms and the relative rankings of the "strength" of the type systems of mainstream programming languages. For this reason, writers who wish to write unambiguously about type systems often eschew the terms "strong typing" and "weak typing" in favor of specific expressions such as "type safety".

In computer science, a type family associates data types with other data types, using a type-level function defined by an open-ended collection of valid instances of input types and the corresponding output types.

Simon Marlow is a British computer scientist, programmer, author, and co-developer of the Glasgow Haskell Compiler (GHC) for the programming language Haskell. He and Simon Peyton Jones won the SIGPLAN Programming Languages Software Award in 2011 for their work on GHC. Marlow's book Parallel and Concurrent Programming in Haskell was published in July 2013.

The Computer Language Benchmarks Game is a free software project for comparing how a given subset of simple algorithms can be implemented in various popular programming languages.

<span class="mw-page-title-main">PureScript</span> Strongly-typed language that compiles to JavaScript

PureScript is a strongly-typed, purely-functional programming language that transpiles to JavaScript, C++11, Erlang, and Go. It can be used to develop web applications, server side apps, and also desktop applications with use of Electron or via C++11 and Go compilers with suitable libraries. Its syntax is mostly comparable to that of Haskell. In addition, it introduces row polymorphism and extensible records. Also, contrary to Haskell, the PureScript language is defined as having a strict evaluation strategy, although there are non-conforming back-ends which implement a lazy evaluation strategy.

References

  1. "SIGPLAN Programming Languages Achievement Award". ACM SIGPLAN.
  2. This link provides information on all awardees. [1]
  3. "SIGPLAN Programming Languages Achievement Award". ACM SIGPLAN. Archived from the original on 2024-02-22.
  4. "SIGPLAN Robin Milner Young Researcher Award". www.sigplan.org. ACM SIGPLAN. Retrieved 2024-07-08.
  5. This link provides information on all awardees. [4]
  6. "SIGPLAN Programming Languages Software Award". ACM SIGPLAN. Archived from the original on 2024-06-05.
  7. "Programming Languages Software Award" . Retrieved 2024-07-12.
  8. "Programming Languages Software Award" . Retrieved 2022-10-27.
  9. 1 2 "Programming Languages Software Award" . Retrieved 2021-10-05.
  10. Luterbacher, Celia (25 June 2019). "Scala programming language wins SIGPLAN award" . Retrieved 2019-06-25.
  11. 1 2 3 4 "Programming Languages Software Award". www.sigplan.org. Retrieved 2018-12-02.
  12. 2013: The Coq proof assistant Archived 2013-07-03 at the Wayback Machine . SIGPLAN. Retrieved on 2013-08-20.
  13. 2012: Jikes Research Virtual Machine (RVM) Archived 2013-07-03 at the Wayback Machine . SIGPLAN. Retrieved on 2013-08-20.
  14. 2011: Simon Peyton Jones and Simon Marlow. SIGPLAN. Retrieved on 2013-08-20.
  15. 2010: Chris Lattner. SIGPLAN. Retrieved on 2013-08-20.
  16. ACM SIGPLAN Programming Languages Software Award in 2010 in recognition of his work on LLVM.
  17. "John C. Reynolds Doctoral Dissertation Award". www.sigplan.org. Retrieved 2017-01-16.