|
|
Line 5: |
Line 5: |
|
{| |
|
{| |
|
| ABI |
|
| ABI |
− |
| [http://en.wikipedia.org/wiki/Application_binary_interface Application Binary Interface] |
+ |
| [https://en.wikipedia.org/wiki/Application_binary_interface Application Binary Interface] |
|
|- |
|
|- |
|
| ADP |
|
| ADP |
Line 41: |
Line 41: |
|
|- |
|
|- |
|
| ANN |
|
| ANN |
− |
| ANNouncement / [http://en.wikipedia.org/wiki/Artificial_neural_network Artificial Neural Network] |
+ |
| ANNouncement / [https://en.wikipedia.org/wiki/Artificial_neural_network Artificial Neural Network] |
|
|- |
|
|- |
|
| API |
|
| API |
− |
| [http://en.wikipedia.org/wiki/Application_programming_interface Application Programming Interface] |
+ |
| [https://en.wikipedia.org/wiki/Application_programming_interface Application Programming Interface] |
|
|- |
|
|- |
|
| aPToP |
|
| aPToP |
Line 53: |
Line 53: |
|
|- |
|
|- |
|
| AST |
|
| AST |
− |
| [http://en.wikipedia.org/wiki/Abstract_syntax_tree Abstract syntax tree] |
+ |
| [https://en.wikipedia.org/wiki/Abstract_syntax_tree Abstract syntax tree] |
|
|- |
|
|- |
|
| AT |
|
| AT |
Line 59: |
Line 59: |
|
|- |
|
|- |
|
| BE |
|
| BE |
− |
| [http://en.wikipedia.org/wiki/Endianness Big Endian] |
+ |
| [https://en.wikipedia.org/wiki/Endianness Big Endian] |
|
|- |
|
|- |
|
| BSD |
|
| BSD |
− |
| [http://en.wikipedia.org/wiki/BSD_license Berkeley Software Distributions (license)] |
+ |
| [https://en.wikipedia.org/wiki/BSD_license Berkeley Software Distributions (license)] |
|
|- |
|
|- |
|
| Cabal |
|
| Cabal |
Line 74: |
Line 74: |
|
|- |
|
|- |
|
| CFG |
|
| CFG |
− |
| [http://en.wikipedia.org/wiki/Context-free_grammar Context-Free Grammar] |
+ |
| [https://en.wikipedia.org/wiki/Context-free_grammar Context-Free Grammar] |
|
|- |
|
|- |
|
| CFP |
|
| CFP |
Line 89: |
Line 89: |
|
|- |
|
|- |
|
| CSE |
|
| CSE |
− |
| [http://en.wikipedia.org/wiki/Common_subexpression_elimination Common subexpression elimination] |
+ |
| [https://en.wikipedia.org/wiki/Common_subexpression_elimination Common subexpression elimination] |
|
|- |
|
|- |
|
| CUFP |
|
| CUFP |
Line 95: |
Line 95: |
|
|- |
|
|- |
|
| DAG |
|
| DAG |
− |
| [http://en.wikipedia.org/wiki/Directed_acyclic_graph Directed acyclic graph] |
+ |
| [https://en.wikipedia.org/wiki/Directed_acyclic_graph Directed acyclic graph] |
|
|- |
|
|- |
|
| DFA |
|
| DFA |
− |
| [http://en.wikipedia.org/wiki/Deterministic_finite_automaton Deterministic Finite Automaton], [http://en.wikipedia.org/wiki/Data_flow_analysis Data Flow Analysis], [http://en.wikipedia.org/wiki/Differential_fault_analysis Differential Fault Analysis] or [http://en.wikipedia.org/wiki/Dual_Factor_Authentication Dual Factor Authentication] |
+ |
| [https://en.wikipedia.org/wiki/Deterministic_finite_automaton Deterministic Finite Automaton], [https://en.wikipedia.org/wiki/Data_flow_analysis Data Flow Analysis], [https://en.wikipedia.org/wiki/Differential_fault_analysis Differential Fault Analysis] or [https://en.wikipedia.org/wiki/Dual_Factor_Authentication Dual Factor Authentication] |
|
|- |
|
|- |
|
| DPH |
|
| DPH |
Line 104: |
Line 104: |
|
|- |
|
|- |
|
| DRY |
|
| DRY |
− |
| [http://en.wikipedia.org/wiki/Don't_repeat_yourself Don't repeat yourself] |
+ |
| [https://en.wikipedia.org/wiki/Don't_repeat_yourself Don't repeat yourself] |
|
|- |
|
|- |
|
| DSEL |
|
| DSEL |
Line 114: |
Line 114: |
|
|
|
|
|
| DVCS |
|
| DVCS |
− |
| [http://en.wikipedia.org/wiki/Distributed_version_control_system Distributed Version Control System] |
+ |
| [https://en.wikipedia.org/wiki/Distributed_version_control_system Distributed Version Control System] |
|
|- |
|
|- |
|
| EDSL |
|
| EDSL |
Line 180: |
Line 180: |
|
|- |
|
|- |
|
| GUI |
|
| GUI |
− |
| [http://en.wikipedia.org/wiki/Graphical_User_Interface Graphical User Interface] |
+ |
| [https://en.wikipedia.org/wiki/Graphical_User_Interface Graphical User Interface] |
|
|- |
|
|- |
|
| HaLVM |
|
| HaLVM |
Line 198: |
Line 198: |
|
|- |
|
|- |
|
| HOAS |
|
| HOAS |
− |
| [http://en.wikipedia.org/wiki/Higher-order_abstract_syntax Higher-Order Abstract Syntax] (using binding in the host language to represent binding in the embedded language) |
+ |
| [https://en.wikipedia.org/wiki/Higher-order_abstract_syntax Higher-Order Abstract Syntax] (using binding in the host language to represent binding in the embedded language) |
|
|- |
|
|- |
|
| HOF |
|
| HOF |
Line 216: |
Line 216: |
|
|- |
|
|- |
|
| HTML |
|
| HTML |
− |
| [http://en.wikipedia.org/wiki/HTML HyperText Markup Language] |
+ |
| [https://en.wikipedia.org/wiki/HTML HyperText Markup Language] |
|
|- |
|
|- |
|
| HUGS |
|
| HUGS |
Line 279: |
Line 279: |
|
|- |
|
|- |
|
| JVM |
|
| JVM |
− |
| [http://en.wikipedia.org/wiki/Java_Virtual_Machine Java Virtual Machine] |
+ |
| [https://en.wikipedia.org/wiki/Java_Virtual_Machine Java Virtual Machine] |
|
|- |
|
|- |
|
| LE |
|
| LE |
− |
| [http://en.wikipedia.org/wiki/Endianness Little Endian] |
+ |
| [https://en.wikipedia.org/wiki/Endianness Little Endian] |
|
|- |
|
|- |
|
| LGPL |
|
| LGPL |
Line 312: |
Line 312: |
|
|- |
|
|- |
|
| ML |
|
| ML |
− |
| A [http://en.wikipedia.org/wiki/ML_(programming_language) programming language] / Mailing List / Machine Learning |
+ |
| A [https://en.wikipedia.org/wiki/ML_(programming_language) programming language] / Mailing List / Machine Learning |
|
|- |
|
|- |
|
| MMR |
|
| MMR |
Line 333: |
Line 333: |
|
|- |
|
|- |
|
| NF |
|
| NF |
− |
| [http://encyclopedia2.thefreedictionary.com/Normal+Form Normal Form], in addition to the [http://en.wikipedia.org/wiki/Normal_form explanations in the Wikipedia article], a fully evaluated expression |
+ |
| [http://encyclopedia2.thefreedictionary.com/Normal+Form Normal Form], in addition to the [https://en.wikipedia.org/wiki/Normal_form explanations in the Wikipedia article], a fully evaluated expression |
|
|- |
|
|- |
|
| nhc98 |
|
| nhc98 |
Line 360: |
Line 360: |
|
|- |
|
|- |
|
| POPL |
|
| POPL |
− |
| [http://en.wikipedia.org/wiki/POPL Principles of Programming Languages, Symposium on] |
+ |
| [https://en.wikipedia.org/wiki/POPL Principles of Programming Languages, Symposium on] |
|
|- |
|
|- |
|
| POV |
|
| POV |
Line 372: |
Line 372: |
|
|- |
|
|- |
|
| PRNG |
|
| PRNG |
− |
| [http://en.wikipedia.org/wiki/Pseudorandom_number_generator Pseudorandom number generator] |
+ |
| [https://en.wikipedia.org/wiki/Pseudorandom_number_generator Pseudorandom number generator] |
|
|- |
|
|- |
|
| PVP |
|
| PVP |
Line 381: |
Line 381: |
|
|- |
|
|- |
|
| RFC |
|
| RFC |
− |
| [http://en.wikipedia.org/wiki/Request_For_Comment Request For Comments] |
+ |
| [https://en.wikipedia.org/wiki/Request_For_Comment Request For Comments] |
|
|- |
|
|- |
|
| RHS |
|
| RHS |
Line 387: |
Line 387: |
|
|- |
|
|- |
|
| RNG |
|
| RNG |
− |
| [http://en.wikipedia.org/wiki/Random_number_generator Random number generator] |
+ |
| [https://en.wikipedia.org/wiki/Random_number_generator Random number generator] |
|
|- |
|
|- |
|
| RWH |
|
| RWH |
Line 393: |
Line 393: |
|
|- |
|
|- |
|
| SAT |
|
| SAT |
− |
| [http://en.wikipedia.org/wiki/Boolean_satisfiability_problem SATisfiability problem] |
+ |
| [https://en.wikipedia.org/wiki/Boolean_satisfiability_problem SATisfiability problem] |
|
|- |
|
|- |
|
| SEC |
|
| SEC |
Line 405: |
Line 405: |
|
|- |
|
|- |
|
| SML |
|
| SML |
− |
| [http://en.wikipedia.org/wiki/Standard_ML Standard ML, a programming language] |
+ |
| [https://en.wikipedia.org/wiki/Standard_ML Standard ML, a programming language] |
|
|- |
|
|- |
|
| SMP |
|
| SMP |
− |
| [http://en.wikipedia.org/wiki/Symmetric_multiprocessing Symmetric Multi-Processing] |
+ |
| [https://en.wikipedia.org/wiki/Symmetric_multiprocessing Symmetric Multi-Processing] |
|
|- |
|
|- |
|
| SMT |
|
| SMT |
− |
| [http://en.wikipedia.org/wiki/Satisfiability_Modulo_Theories Satisfiability Modulo Theories] |
+ |
| [https://en.wikipedia.org/wiki/Satisfiability_Modulo_Theories Satisfiability Modulo Theories] |
|
|- |
|
|- |
|
| SO |
|
| SO |
Line 429: |
Line 429: |
|
|- |
|
|- |
|
| SQL |
|
| SQL |
− |
| [http://en.wikipedia.org/wiki/SQL Structured Query Language] |
+ |
| [https://en.wikipedia.org/wiki/SQL Structured Query Language] |
|
|- |
|
|- |
|
| STG machine |
|
| STG machine |
Line 435: |
Line 435: |
|
|- |
|
|- |
|
| STLC |
|
| STLC |
− |
| [http://en.wikipedia.org/wiki/Simply_typed_lambda_calculus Simply Typed Lambda Calculus] |
+ |
| [https://en.wikipedia.org/wiki/Simply_typed_lambda_calculus Simply Typed Lambda Calculus] |
|
|- |
|
|- |
|
| STM |
|
| STM |
Line 450: |
Line 450: |
|
|- |
|
|- |
|
| TCO |
|
| TCO |
− |
| [http://en.wikipedia.org/wiki/Tail_call_optimization Tail-Call Optimization] |
+ |
| [https://en.wikipedia.org/wiki/Tail_call_optimization Tail-Call Optimization] |
|
|- |
|
|- |
|
| TDNR |
|
| TDNR |
Line 492: |
Line 492: |
|
|- |
|
|- |
|
| VCS |
|
| VCS |
− |
| [http://en.wikipedia.org/wiki/Version_Control_System Version Control System] |
+ |
| [https://en.wikipedia.org/wiki/Version_Control_System Version Control System] |
|
|- |
|
|- |
|
| VPS |
|
| VPS |
− |
| [http://en.wikipedia.org/wiki/Virtual_Private_Server Virtual Private Server], a virtual machine for hosting a website |
+ |
| [https://en.wikipedia.org/wiki/Virtual_Private_Server Virtual Private Server], a virtual machine for hosting a website |
|
|- |
|
|- |
|
| WHNF |
|
| WHNF |
Line 504: |
Line 504: |
|
|- |
|
|- |
|
| XML |
|
| XML |
− |
| [http://en.wikipedia.org/wiki/XML eXtensible Markup Language] |
+ |
| [https://en.wikipedia.org/wiki/XML eXtensible Markup Language] |
|
|- |
|
|- |
|
| YAHT |
|
| YAHT |
− |
| [http://en.wikibooks.org/wiki/Haskell/YAHT Yet Another Haskell Tutorial] |
+ |
| [https://en.wikibooks.org/wiki/Haskell/YAHT Yet Another Haskell Tutorial] |
|
|- |
|
|- |
|
| YHC |
|
| YHC |
Note: if there is an abbreviation you cannot find here, it might be the name of a package, so check the Hackage package list. For GHC related abbreviations, see GHC Source Code Abbreviations. The abbreviation might also indicate a conference.
ABI
|
Application Binary Interface
|
ADP
|
Algebraic Dynamic Programming
|
ADT
|
Abstract Data Type / Algebraic Data Type
|
AFAIC
|
As Far As I'm Concerned / As Far As I Can
|
AFAICS
|
As Far As I Can See
|
AFAICT
|
As Far As I Can Tell
|
AFAIK
|
As Far As I Know
|
AFAIU
|
As Far As I Understand
|
AFRP
|
Arrows-based Functional Reactive Programming
|
AKA
|
Also Known As
|
alist
|
Association list, a list of key-value pairs, [(key, value)]
|
AMP
|
Applicative-Monad Proposal
|
ANN
|
ANNouncement / Artificial Neural Network
|
API
|
Application Programming Interface
|
aPToP
|
A practical theory of programming
|
ASAP
|
As Soon As Possible
|
AST
|
Abstract syntax tree
|
AT
|
Abstract (Data) Type / Associated (Data) Type (see also Associated types with class)
|
BE
|
Big Endian
|
BSD
|
Berkeley Software Distributions (license)
|
Cabal
|
Common Architecture for Building Applications and Libraries
|
CAF
|
Constant Applicative Form
|
CAML
|
A programming language
|
CFG
|
Context-Free Grammar
|
CFP
|
Call For Papers - request to send material for a symposium
|
CLC
|
Core Libraries Committee
|
CPR
|
Constructed Product Result (analysis)
|
CPS
|
Continuation-Passing Style
|
CSE
|
Common subexpression elimination
|
CUFP
|
Commercial Users of Functional Programming
|
DAG
|
Directed acyclic graph
|
DFA
|
Deterministic Finite Automaton, Data Flow Analysis, Differential Fault Analysis or Dual Factor Authentication
|
DPH
|
Data Parallel Haskell
|
DRY
|
Don't repeat yourself
|
DSEL
|
Domain-Specific Embedded Language
|
DSL
|
Domain-Specific Language
|
DVCS
|
Distributed Version Control System
|
EDSL
|
Embedded Domain-Specific Language
|
EHC
|
The Essential Haskell Compiler
|
elt
|
Element (of a list/set/...)
|
FAQ
|
Frequently Asked Questions
|
FD
|
Functional Dependencies
|
FFI
|
Foreign Function Interface
|
FHM
|
Functional Hybrid Modeling
|
FPL
|
Functional Programming Language
|
FTFY
|
Fixed That For You
|
FRP
|
Functional Reactive Programming
|
FSF
|
Free Software Foundation
|
FTP
|
Foldable/Traversable in Prelude proposal
|
FTW
|
For The World / For The Win
|
FunDeps
|
Functional Dependencies
|
FWIW
|
For what it's worth
|
GCC
|
GNU Compiler Collection
|
GHC
|
Glasgow Haskell Compiler
|
GPL
|
GNU General Public License
|
GPL2
|
GNU General Public License, Version 2
|
GPL3
|
GNU General Public License, Version 3
|
GSoC
|
Google Summer of Code
|
GUI
|
Graphical User Interface
|
HaLVM
|
Haskell Lightweight Virtual Machine
|
HBC
|
Haskell-B Compiler
|
HBI
|
Haskell-B Interpreter
|
HCAR
|
Haskell Communities and Activities Report
|
HNF
|
Head Normal Form
|
HOAS
|
Higher-Order Abstract Syntax (using binding in the host language to represent binding in the embedded language)
|
HOF
|
Higher-Order Functions
|
HPC
|
Haskell Program Coverage, a tool-kit to record and display Haskell program coverage / Haskell Prime Committee / High Performance Computing
|
HPFFP
|
Haskell Programming From First Principles (book)
|
HSE
|
Haskell-Source with Extensions (a package on Hackage, haskell-src-exts); an extension of the standard haskell-src package
|
HTH
|
Hope This Helps
|
HTML
|
HyperText Markup Language
|
HUGS
|
Haskell User's Gofer System
|
HWN
|
Haskell Weekly News
|
I18n
|
Internationalization / Internationalisation (which shows why the abbreviation is useful)
|
IANAL
|
I Am Not A Lawyer
|
ICFP
|
International Conference on Functional Programming
|
IFL
|
Implementation and Application of Functional Languages, symposium
|
IHG
|
Industrial Haskell Group
|
IIRC
|
If I Recall Correctly
|
IIUIC
|
If I Understand It Correctly
|
IIUC
|
If I Understand Correctly
|
IME
|
In My Experience
|
IMHO
|
In My Humble Opinion
|
IMNSHO
|
In My Not So Humble Opinion
|
IMO
|
In My Opinion
|
IOW
|
In Other Words
|
IR
|
Intermediate Representation in a two-phase compiler
|
IRC
|
Internet Relay Chat
|
ISTR
|
I Seem To Recall
|
JFYI
|
Just For Your Information
|
JHC
|
John's Haskell Compiler. Compiles to efficient C programs via whole program analysis and other optimizations.
|
JVM
|
Java Virtual Machine
|
LE
|
Little Endian
|
LGPL
|
GNU Lesser General Public License
|
LHC
|
Luxurious Haskell Compiler. LHC is a whole-program optimizing backend for the Glorious Glasgow Haskell Compiler
|
LHS
|
Left-Hand Side (of a statement)
|
LLVM
|
Low-Level Virtual Machine
|
LtU
|
Lambda the Ultimate (Website)
|
LYH
|
Learn You a Haskell for Great Good!
|
LYAH
|
Learn You a Haskell for Great Good!
|
LYAHFGG
|
Learn You a Haskell for Great Good!
|
MFP
|
MonadFail Proposal
|
ML
|
A programming language / Mailing List / Machine Learning
|
MMR
|
MonoMorphism Restriction
|
MPTC
|
Multi-Parameter Type Class
|
MR
|
Monomorphism Restriction
|
MRP
|
Monad of no `return` Proposal (MRP): Moving `return` out of `Monad`
|
MTL
|
Monad Transformer Library
|
NCG
|
Native Code Generator, a GHC backend
|
NF
|
Normal Form, in addition to the explanations in the Wikipedia article, a fully evaluated expression
|
nhc98
|
Nearly a Haskell Compiler
|
NLP
|
Natural Language Processing
|
OCAML
|
Objective Caml (A programming language)
|
OOM
|
Out Of Memory
|
OP
|
Original Poster (who sent the first e-mail of the current thread) or Original Post (the first e-mail of the current thread)
|
OT
|
Off-Topic
|
PADL
|
Practical Aspects of Declarative Languages, symposium
|
PM
|
Personal Message, a message to someone on a message board, that no one else can read
|
POPL
|
Principles of Programming Languages, Symposium on
|
POV
|
Point Of View
|
ppl
|
People
|
PR
|
Pull Request
|
PRNG
|
Pseudorandom number generator
|
PVP
|
Package versioning policy
|
RDP
|
Reactive Demand Programming
|
RFC
|
Request For Comments
|
RHS
|
Right-Hand Side (of a statement)
|
RNG
|
Random number generator
|
RWH
|
Real World Haskell, a book about Haskell
|
SAT
|
SATisfiability problem
|
SEC
|
Semantic editor combinator
|
SHE
|
Strathclyde Haskell Enhancement, an experimental preprocessor for the Glasgow Haskell Compiler
|
SICP
|
Structure and Interpretation of Computer Programs
|
SML
|
Standard ML, a programming language
|
SMP
|
Symmetric Multi-Processing
|
SMT
|
Satisfiability Modulo Theories
|
SO
|
StackOverflow, a programming question and answer site
|
SOE
|
Haskell School Of Expression (title of a book)
|
SORF
|
Simple Overloaded Record Fields
|
SPJ
|
Simon Peyton Jones
|
SPOJ
|
Sphere Online Judge, an online judge system with over 9000 problems. The solution to problems can be submitted in over 40 languages, including Haskell
|
SQL
|
Structured Query Language
|
STG machine
|
Spineless Tagless G-machine (the link points to a .ps.gz file)
|
STLC
|
Simply Typed Lambda Calculus
|
STM
|
Software transactional memory
|
SYB
|
Scrap Your Boilerplate
|
TaPL
|
Types and Programming Languages (book)
|
TCM
|
Type Class Morphism
|
TCO
|
Tail-Call Optimization
|
TDNR
|
Type Directed Name Resolution
|
TF
|
Type families
|
TFP
|
Trends in Functional Programming, symposium
|
TH
|
Template Haskell
|
TIA
|
Thanks In Advance
|
TIL
|
Today I Learned
|
tl;dr
|
Too Long; Didn't Read
|
TLDR
|
Too Long; Didn't Read
|
TMI
|
Too Much Information
|
TMR
|
The Monad.Reader
|
TTBOMK
|
To the best of my knowledge
|
UHC
|
Utrecht Haskell Compiler
|
UTF8
|
Unicode Transformation Format, byte-oriented (also written as UTF-8)
|
VCS
|
Version Control System
|
VPS
|
Virtual Private Server, a virtual machine for hosting a website
|
WHNF
|
Weak Head Normal Form
|
wrt
|
With Respect To, or With Regard To
|
XML
|
eXtensible Markup Language
|
YAHT
|
Yet Another Haskell Tutorial
|
YHC
|
York Haskell Compiler
|
YMMV
|
Your Mileage May Vary
|