Difference between revisions of "Abbreviations"
Jump to navigation
Jump to search
m |
(→An overview of Haskell related abbreviations: Updated links) |
||
(20 intermediate revisions by 2 users not shown) | |||
Line 1: | Line 1: | ||
== An overview of Haskell related abbreviations == |
== An overview of Haskell related abbreviations == |
||
− | Note: if there is an abbreviation you cannot find here, it might be the name of a package, so check the [http://hackage.haskell.org/packages/ |
+ | Note: if there is an abbreviation you cannot find here, it might be the name of a package, so check the [http://hackage.haskell.org/packages/ Hackage package list]. For GHC related abbreviations, see [https://ghc.haskell.org/trac/ghc/wiki/Commentary/Abbreviations GHC Source Code Abbreviations]. The abbreviation might also indicate a [[Conferences | conference]]. |
{| |
{| |
||
| ABI |
| ABI |
||
− | | [ |
+ | | [https://en.wikipedia.org/wiki/Application_binary_interface Application Binary Interface] |
|- |
|- |
||
| ADP |
| ADP |
||
− | | [ |
+ | | [https://bibiserv.cebitec.uni-bielefeld.de/adp/ Algebraic Dynamic Programming] |
|- |
|- |
||
| ADT |
| ADT |
||
Line 36: | Line 36: | ||
| alist |
| alist |
||
| Association list, a list of key-value pairs, [(key, value)] |
| Association list, a list of key-value pairs, [(key, value)] |
||
+ | |- |
||
+ | | AMP |
||
+ | | [http://www.haskell.org/haskellwiki/Functor-Applicative-Monad_Proposal Applicative-Monad Proposal] |
||
|- |
|- |
||
| ANN |
| ANN |
||
− | | ANNouncement / [ |
+ | | ANNouncement / [https://en.wikipedia.org/wiki/Artificial_neural_network Artificial Neural Network] |
|- |
|- |
||
| API |
| API |
||
− | | [ |
+ | | [https://en.wikipedia.org/wiki/Application_programming_interface Application Programming Interface] |
|- |
|- |
||
| aPToP |
| aPToP |
||
Line 49: | Line 52: | ||
| As Soon As Possible |
| As Soon As Possible |
||
|- |
|- |
||
+ | | AST |
||
+ | | [https://en.wikipedia.org/wiki/Abstract_syntax_tree Abstract syntax tree] |
||
+ | |- |
||
| AT |
| AT |
||
| [[Abstract data type | Abstract (Data) Type]] / [http://nattermorphisms.blogspot.com/2008/10/2-minute-intro-to-associated-types-type.html Associated (Data) Type] (see also [http://www.cse.unsw.edu.au/~chak/papers/CKPM05.html Associated types with class]) |
| [[Abstract data type | Abstract (Data) Type]] / [http://nattermorphisms.blogspot.com/2008/10/2-minute-intro-to-associated-types-type.html Associated (Data) Type] (see also [http://www.cse.unsw.edu.au/~chak/papers/CKPM05.html Associated types with class]) |
||
|- |
|- |
||
| BE |
| BE |
||
− | | [ |
+ | | [https://en.wikipedia.org/wiki/Endianness Big Endian] |
|- |
|- |
||
| BSD |
| BSD |
||
− | | [ |
+ | | [https://en.wikipedia.org/wiki/BSD_license Berkeley Software Distributions (license)] |
|- |
|- |
||
| Cabal |
| Cabal |
||
Line 68: | Line 74: | ||
|- |
|- |
||
| CFG |
| CFG |
||
− | | [ |
+ | | [https://en.wikipedia.org/wiki/Context-free_grammar Context-Free Grammar] |
|- |
|- |
||
| CFP |
| CFP |
||
| Call For Papers - request to send material for a symposium |
| Call For Papers - request to send material for a symposium |
||
|- |
|- |
||
+ | | CLC |
||
+ | | [[Core Libraries Committee]] |
||
+ | |- |
||
| CPR |
| CPR |
||
− | | [ |
+ | | [https://www.microsoft.com/en-us/research/publication/constructed-product-result-analysis-haskell/ Constructed Product Result] (analysis) |
|- |
|- |
||
| CPS |
| CPS |
||
Line 80: | Line 89: | ||
|- |
|- |
||
| CSE |
| CSE |
||
− | | [ |
+ | | [https://en.wikipedia.org/wiki/Common_subexpression_elimination Common subexpression elimination] |
|- |
|- |
||
| CUFP |
| CUFP |
||
− | | [http://cufp. |
+ | | [http://cufp.org/ Commercial Users of Functional Programming] |
|- |
|- |
||
| DAG |
| DAG |
||
− | | [ |
+ | | [https://en.wikipedia.org/wiki/Directed_acyclic_graph Directed acyclic graph] |
|- |
|- |
||
| DFA |
| DFA |
||
− | | [ |
+ | | [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 95: | Line 104: | ||
|- |
|- |
||
| DRY |
| DRY |
||
− | | [ |
+ | | [https://en.wikipedia.org/wiki/Don't_repeat_yourself Don't repeat yourself] |
|- |
|- |
||
| DSEL |
| DSEL |
||
Line 105: | Line 114: | ||
| DVCS |
| DVCS |
||
− | | [ |
+ | | [https://en.wikipedia.org/wiki/Distributed_version_control_system Distributed Version Control System] |
|- |
|- |
||
| EDSL |
| EDSL |
||
Line 126: | Line 135: | ||
|- |
|- |
||
| FHM |
| FHM |
||
− | | [http://db.inf.uni-tuebingen.de/team/ |
+ | | [http://db.inf.uni-tuebingen.de/team/GeorgeGiorgidze.html Functional Hybrid Modeling] |
|- |
|- |
||
| FPL |
| FPL |
||
| [http://www.haskell.org Functional Programming Language] |
| [http://www.haskell.org Functional Programming Language] |
||
− | |- |
+ | |- |
+ | | FTFY |
||
+ | | Fixed That For You |
||
+ | |- |
||
| FRP |
| FRP |
||
| [[Functional Reactive Programming]] |
| [[Functional Reactive Programming]] |
||
Line 136: | Line 148: | ||
| FSF |
| FSF |
||
| [http://www.fsf.org/ Free Software Foundation] |
| [http://www.fsf.org/ Free Software Foundation] |
||
+ | |- |
||
+ | | FTP |
||
+ | | [[Foldable Traversable In Prelude | Foldable/Traversable in Prelude proposal]] |
||
|- |
|- |
||
| FTW |
| FTW |
||
− | | [ |
+ | | [https://en.wiktionary.org/wiki/FTW For The World / For The Win] |
|- |
|- |
||
| FunDeps |
| FunDeps |
||
Line 147: | Line 162: | ||
|- |
|- |
||
| GCC |
| GCC |
||
− | | [http://gcc.gnu.org/ GNU |
+ | | [http://gcc.gnu.org/ GNU Compiler Collection] |
|- |
|- |
||
| GHC |
| GHC |
||
Line 162: | Line 177: | ||
|- |
|- |
||
| GSoC |
| GSoC |
||
− | | [ |
+ | | [https://developers.google.com/open-source/gsoc/?csw=1 Google Summer of Code] |
|- |
|- |
||
| GUI |
| GUI |
||
− | | [ |
+ | | [https://en.wikipedia.org/wiki/Graphical_User_Interface Graphical User Interface] |
|- |
|- |
||
| HaLVM |
| HaLVM |
||
Line 179: | Line 194: | ||
| [http://www.haskell.org/haskellwiki/Haskell_Communities_and_Activities_Report Haskell Communities and Activities Report] |
| [http://www.haskell.org/haskellwiki/Haskell_Communities_and_Activities_Report Haskell Communities and Activities Report] |
||
|- |
|- |
||
+ | | HIE |
||
+ | | [https://github.com/haskell/haskell-ide-engine Haskell IDE Engine] |
||
+ | |- |
||
| HNF |
| HNF |
||
| [http://encyclopedia2.thefreedictionary.com/head+normal+form Head Normal Form] |
| [http://encyclopedia2.thefreedictionary.com/head+normal+form Head Normal Form] |
||
|- |
|- |
||
| HOAS |
| HOAS |
||
− | | [ |
+ | | [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 189: | Line 207: | ||
|- |
|- |
||
| HPC |
| HPC |
||
− | | [[Haskell program coverage | Haskell Program Coverage]], a tool-kit to record and display Haskell program coverage |
+ | | [[Haskell program coverage | Haskell Program Coverage]], a tool-kit to record and display Haskell program coverage / [https://prime.haskell.org/wiki/Committee Haskell Prime Committee] / High Performance Computing |
+ | |- |
||
+ | | HPFFP |
||
+ | | [http://haskellbook.com/ Haskell Programming From First Principles] (book) |
||
|- |
|- |
||
| HSE |
| HSE |
||
Line 198: | Line 219: | ||
|- |
|- |
||
| HTML |
| HTML |
||
− | | [ |
+ | | [https://en.wikipedia.org/wiki/HTML HyperText Markup Language] |
|- |
|- |
||
| HUGS |
| HUGS |
||
Line 261: | Line 282: | ||
|- |
|- |
||
| JVM |
| JVM |
||
− | | [ |
+ | | [https://en.wikipedia.org/wiki/Java_Virtual_Machine Java Virtual Machine] |
|- |
|- |
||
| LE |
| LE |
||
− | | [ |
+ | | [https://en.wikipedia.org/wiki/Endianness Little Endian] |
|- |
|- |
||
| LGPL |
| LGPL |
||
Line 270: | Line 291: | ||
|- |
|- |
||
| LHC |
| LHC |
||
− | | [ |
+ | | [https://github.com/Lemmih/lhc LLVM Haskell Compiler]. LHC is a whole-program optimizing backend for the Glorious Glasgow Haskell Compiler |
|- |
|- |
||
| LHS |
| LHS |
||
Line 277: | Line 298: | ||
| LLVM |
| LLVM |
||
| [[LLVM | Low-Level Virtual Machine]] |
| [[LLVM | Low-Level Virtual Machine]] |
||
+ | |- |
||
+ | | LSP |
||
+ | | [https://en.wikipedia.org/wiki/Language_Server_Protocol Language Server Protocol] (used by the Haskell IDE Engine) |
||
|- |
|- |
||
| LtU |
| LtU |
||
| [http://lambda-the-ultimate.org/ Lambda the Ultimate] (Website) |
| [http://lambda-the-ultimate.org/ Lambda the Ultimate] (Website) |
||
+ | |- |
||
+ | | LYH |
||
+ | | [http://learnyouahaskell.com/ Learn You a Haskell for Great Good!] |
||
|- |
|- |
||
| LYAH |
| LYAH |
||
Line 286: | Line 313: | ||
| LYAHFGG |
| LYAHFGG |
||
| [http://learnyouahaskell.com/ Learn You a Haskell for Great Good!] |
| [http://learnyouahaskell.com/ Learn You a Haskell for Great Good!] |
||
+ | |- |
||
+ | | MFP |
||
+ | | [[MonadFail Proposal]] |
||
|- |
|- |
||
| ML |
| ML |
||
− | | A [ |
+ | | A [https://en.wikipedia.org/wiki/ML_(programming_language) programming language] / Mailing List / Machine Learning |
|- |
|- |
||
| MMR |
| MMR |
||
Line 298: | Line 328: | ||
| MR |
| MR |
||
| [[Monomorphism Restriction]] |
| [[Monomorphism Restriction]] |
||
+ | |- |
||
+ | | MRP |
||
+ | | [https://mail.haskell.org/pipermail/libraries/2015-September/026121.html Monad of no `return` Proposal (MRP)]: Moving `return` out of `Monad` |
||
|- |
|- |
||
| MTL |
| MTL |
||
− | | [http://hackage.haskell.org |
+ | | [http://hackage.haskell.org/package/mtl Monad Transformer Library] |
|- |
|- |
||
| NCG |
| NCG |
||
− | | [ |
+ | | [https://ghc.haskell.org/trac/ghc/wiki/Commentary/Compiler/Backends/NCG Native Code Generator], a GHC backend |
|- |
|- |
||
| NF |
| NF |
||
− | | [http://encyclopedia2.thefreedictionary.com/Normal+Form Normal Form], in addition to the [ |
+ | | [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 333: | Line 366: | ||
|- |
|- |
||
| POPL |
| POPL |
||
− | | [ |
+ | | [https://en.wikipedia.org/wiki/POPL Principles of Programming Languages, Symposium on] |
|- |
|- |
||
| POV |
| POV |
||
Line 341: | Line 374: | ||
| People |
| People |
||
|- |
|- |
||
+ | | PR |
||
+ | | [https://help.github.com/articles/using-pull-requests/ Pull Request] |
||
+ | |- |
||
| PRNG |
| PRNG |
||
− | | [ |
+ | | [https://en.wikipedia.org/wiki/Pseudorandom_number_generator Pseudorandom number generator] |
|- |
|- |
||
| PVP |
| PVP |
||
Line 348: | Line 384: | ||
|- |
|- |
||
| RDP |
| RDP |
||
− | | [ |
+ | | [https://awelonblue.wordpress.com/2011/05/21/comparing-frp-to-rdp/ Reactive Demand Programming] |
|- |
|- |
||
| RFC |
| RFC |
||
− | | [ |
+ | | [https://en.wikipedia.org/wiki/Request_For_Comment Request For Comments] |
|- |
|- |
||
| RHS |
| RHS |
||
Line 357: | Line 393: | ||
|- |
|- |
||
| RNG |
| RNG |
||
− | | [ |
+ | | [https://en.wikipedia.org/wiki/Random_number_generator Random number generator] |
|- |
|- |
||
| RWH |
| RWH |
||
− | | [http:// |
+ | | [http://book.realworldhaskell.org/ Real World Haskell], a book about Haskell |
|- |
|- |
||
| SAT |
| SAT |
||
− | | [ |
+ | | [https://en.wikipedia.org/wiki/Boolean_satisfiability_problem SATisfiability problem] |
|- |
|- |
||
| SEC |
| SEC |
||
Line 372: | Line 408: | ||
|- |
|- |
||
| SICP |
| SICP |
||
− | | [ |
+ | | [https://mitpress.mit.edu/sicp/full-text/book/book.html Structure and Interpretation of Computer Programs] |
|- |
|- |
||
| SML |
| SML |
||
− | | [ |
+ | | [https://en.wikipedia.org/wiki/Standard_ML Standard ML, a programming language] |
|- |
|- |
||
| SMP |
| SMP |
||
− | | [ |
+ | | [https://en.wikipedia.org/wiki/Symmetric_multiprocessing Symmetric Multi-Processing] |
|- |
|- |
||
| SMT |
| SMT |
||
− | | [ |
+ | | [https://en.wikipedia.org/wiki/Satisfiability_Modulo_Theories Satisfiability Modulo Theories] |
|- |
|- |
||
| SO |
| SO |
||
− | | [ |
+ | | [https://stackoverflow.com/ StackOverflow], a programming question and answer site |
|- |
|- |
||
| SOE |
| SOE |
||
Line 390: | Line 426: | ||
|- |
|- |
||
| SORF |
| SORF |
||
− | | [ |
+ | | [https://ghc.haskell.org/trac/ghc/wiki/Records/OverloadedRecordFields Simple Overloaded Record Fields] |
|- |
|- |
||
| SPJ |
| SPJ |
||
− | | [ |
+ | | [https://www.microsoft.com/en-us/research/people/simonpj/ Simon Peyton Jones] |
|- |
|- |
||
| SPOJ |
| SPOJ |
||
Line 399: | Line 435: | ||
|- |
|- |
||
| SQL |
| SQL |
||
− | | [ |
+ | | [https://en.wikipedia.org/wiki/SQL Structured Query Language] |
|- |
|- |
||
| STG machine |
| STG machine |
||
− | | [ |
+ | | [https://www.microsoft.com/en-us/research/publication/implementing-lazy-functional-languages-on-stock-hardware-the-spineless-tagless-g-machine/ Spineless Tagless G-machine] |
|- |
|- |
||
| STLC |
| STLC |
||
− | | [ |
+ | | [https://en.wikipedia.org/wiki/Simply_typed_lambda_calculus Simply Typed Lambda Calculus] |
|- |
|- |
||
| STM |
| STM |
||
Line 420: | Line 456: | ||
|- |
|- |
||
| TCO |
| TCO |
||
− | | [ |
+ | | [https://en.wikipedia.org/wiki/Tail_call_optimization Tail-Call Optimization] |
|- |
|- |
||
| TDNR |
| TDNR |
||
− | | [ |
+ | | [https://prime.haskell.org/wiki/TypeDirectedNameResolution Type Directed Name Resolution] |
|- |
|- |
||
| TF |
| TF |
||
Line 456: | Line 492: | ||
|- |
|- |
||
| UHC |
| UHC |
||
− | | [http:// |
+ | | [http://foswiki.cs.uu.nl/foswiki/UHC Utrecht Haskell Compiler] |
|- |
|- |
||
| UTF8 |
| UTF8 |
||
Line 462: | Line 498: | ||
|- |
|- |
||
| VCS |
| VCS |
||
− | | [ |
+ | | [https://en.wikipedia.org/wiki/Version_Control_System Version Control System] |
|- |
|- |
||
| VPS |
| VPS |
||
− | | [ |
+ | | [https://en.wikipedia.org/wiki/Virtual_Private_Server Virtual Private Server], a virtual machine for hosting a website |
|- |
|- |
||
| WHNF |
| WHNF |
||
Line 474: | Line 510: | ||
|- |
|- |
||
| XML |
| XML |
||
− | | [ |
+ | | [https://en.wikipedia.org/wiki/XML eXtensible Markup Language] |
|- |
|- |
||
| YAHT |
| YAHT |
||
− | | [ |
+ | | [https://en.wikibooks.org/wiki/Haskell/YAHT Yet Another Haskell Tutorial] |
|- |
|- |
||
| YHC |
| YHC |
||
Line 483: | Line 519: | ||
|- |
|- |
||
| YMMV |
| YMMV |
||
− | | [ |
+ | | [https://en.wiktionary.org/wiki/your_mileage_may_vary Your Mileage May Vary] |
|- |
|- |
||
|} |
|} |
Revision as of 10:40, 22 July 2017
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.