constructive mathematics, realizability, computability
propositions as types, proofs as programs, computational trinitarianism
A programming language is called domain specific if it is designed for a specific kind (domain) of applications, in contrast to general purpose programming languages.
If a domain specific language is realized inside a general-purpose language, one speaks of domain specific embedded programming language.
Wikipedia, Domain specific language
Haskell Wiki, Research papers/Domain specific languages
Paul Hudak, Building Domain-Specific Embedded Languages, ACM Computing Surveys 28 4e (1996) 196–es [doi:10.1145/242224.242477, web]
Paul Hudak, Domain Specific Languages, Chapter 3 (pp. 39–60) in: Peter H. Salas (ed), Handbook of Programming Languages, Vol. III: Little Languages and Tools, MacMillan (1998) [pdf, pdf]
Paul Hudak, Modular Domain Specific Languages and Tools, in: Proceedings of Fifth International Conference on Software Reuse, IEEE Computer Society Press (1998) [pdf, doi:10.5555/551789.853532]
Last revised on March 8, 2023 at 11:24:50. See the history of this page for a list of all contributions to it.