compact language
41Pro-drop language — Linguistic typology Morphological Isolating Synthetic Polysynthetic Fusional Agglutinative Morphosyntactic Alig …
42Dynamic Language Runtime — Developer(s) Microsoft Dynamic Language Runtime Team Stable release 1.0 / April 16, 2010 Operating system Microsoft Windows, Debian, Ubuntu Platform …
43Forth (programming language) — infobox programming language name = Forth paradigm = Procedural, stack oriented year = 1970s designer = Charles H. Moore typing = typeless dialects = colorForth, Open Firmware implementations = Forth, Inc., GNU Forth, MPE influenced by =… …
44F Sharp (programming language) — The correct title of this article is F#. The substitution or omission of the # sign is because of technical restrictions. F# Paradigm(s) multi paradigm: functional, imperative, object oriented Appeared in 2002 (2002) …
45Clarion (programming language) — For other uses, see Clarion. Clarion Developer(s) JPI, Clarion International, SoftVelocity Stable release 8.0 / August 30, 2011; 2 months ago (2011 08 30) Operating system …
46K (programming language) — Infobox programming language name = K logo = paradigm = array, functional year = 1993 designer = Arthur Whitney developer = Kx Systems latest release version = latest release date = typing = dynamic, strong implementations = dialects = influenced …
47Neo (constructed language) — This article is about the constructed language. For other uses, see Neo (disambiguation). Neo Created by Arturo Alfandari Date created 1961 …
48Mark-compact algorithm — In computer science, a mark compact algorithm is a type of garbage collection algorithm used to reclaim unreachable memory. Mark compact algorithms can be regarded as a combination of the mark sweep algorithm and Cheney s copying algorithm. First …
49Cat (programming language) — Infobox programming language name = Cat paradigm = multi paradigm: functional, stack oriented year = 2006 designer = [http://www.cat language.com Christopher Diggins] latest release version = 0.10.3 latest release date = April 3, 2007 typing =… …
50Unary language — In computational complexity theory, a unary language or tally language is a formal language (a set of strings) where all strings have the form 1 k , where 1 can be any fixed symbol. For example, the language {1, 111, 1111} is unary, as is the… …
