Skip to content
Category

Academic programming languages

page 1
Q81571
programming language
Lisp
functional programming language based on the lambda calculus
Q34010
Haskell () is a general-purpose, statically typed, purely functional programming language with type inference and lazy evaluation. Haskell pioneered several programming language features including type classes for 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).
Q187560
dialect of the Lisp programming language
ML
functional programming language
CLU
programming language
ALGOL 68
programming language
Racket
functional and contractual programming language, with strong, dynamic and reflective typing, derived from Scheme
ALGOL 60
member of the ALGOL family of computer programming languages
Curry
programming language
Agda
dependently typed, purely functional programming language and proof assistant
SETL
SETL (SET Language) is a very high-level programming language based on the mathematical theory of sets. It was originally developed at the New York University (NYU) Courant Institute of Mathematical Sciences in the late 1960s, by a group including (Jack) Jacob T. Schwartz, R.B.K. Dewar, and E. Schonberg. Schwartz is credited with designing the language.
ISWIM
ISWIM (If you See What I Mean) is an abstract computer programming language (or a family of languages) devised by Peter Landin and first described in his article "The Next 700 Programming Languages", published in the Communications of the ACM in 1966.
FP
programming language
Joy
programming language
ABSYS
Absys was an early declarative programming language from the University of Aberdeen. It anticipated a number of features of Prolog such as negation as failure, aggregation operators, the central role of backtracking and constraint solving. Absys was the first implementation of a logic programming language.
P′′
P′′ (P double prime) is a primitive computer programming language created by Corrado Böhm in 1964 to describe a family of Turing machines. It provided one of the earliest formulations of the single-entry single-exit principle central to structured programming.
Turing
programming language
Lucid
programming language
FL
programming language
Hope
functional programming language