Symbolic language (programming): Difference between revisions

Revision as of 04:34, 16 June 2023

Latest revision as of 08:04, 25 May 2025

(3 intermediate revisions by 3 users not shown)

Line 1:

In [[computer science]], a '''symbolic language''', or assembly language, is a language that uses [[Character (computing)|characters]] or [[symbols]] to represent concepts, such as [[Operation (mathematics)|mathematical operations]] and the entities (or [[operands]]) on which these operations are performed.<ref name="pc">{{Cite web|url=https://www.pcmag.com/encyclopedia/term/52338/symbolic-language|title=symbolic language Definition from PC Magazine Encyclopedia|website=www.pcmag.com|access-date=2019-03-23}}</ref>

Modern [[programming languages]] use symbols to represent concepts and/or data and are, therefore, examples of symbolic languages.<ref name="pc" />

Some programming languages (such as [[Lisp (programming language)|Lisp]] and [[Wolfram Mathematica|Mathematica]]) make it easy to represent higher-level [[Abstraction (computer science)|abstractions]] as [[Expression (computer science)|expressions]] in the language, enabling [[symbolic programming]].,<ref>{{Cite web|url=http://worrydream.com/#!2/LadderOfAbstraction|title=Bret Victor, beast of burden|website=worrydream.com|access-date=2019-03-23}}</ref><ref>{{Cite web|url=https://blog.wolfram.com/2007/05/13/symbolic-programming-visualized/|title=Symbolic Programming Visualized—Wolfram Blog|date=13 May 2007 |language=en|access-date=2019-03-23}}</ref>

A recursive symbolic structure is adopted to preserve ψ-alignment and entropy invariance during ordering transformations, rooted in a generalized recursively structured symbolic system. <ref>{{Cite web | url=https://arxiv.org/pdf/2505.11927 | title=Symbolic structure in ordering transformations | website=arxiv.org | date=2025-05-17 | access-date=2025-05-18}}</ref>

==See also==

Line 24 ⟶ 26:

[[Category:Mathematical notation]]

[[Category:Programming constructs]]

[[Category:Writing systems]]