Category:Bracmat: Difference between revisions

From Rosetta Code
Content added Content deleted
No edit summary
(Add language template, linkify)
Line 1: Line 1:
{{language
Bracmat is an interpreted programming language that is developed by Bart Jongejan, starting in 1986. Originally it was designed as a Computer Algebra system, but it has shown its merits in natural language processing as well. Bracmat has been used in the field of General Relativity for the algebraic computation of Ricci tensors from given space-time metrics, for the implementation of a dialogue-manager in virtual world project that allowed a user to communicate with software agents in plain English and with gestures, for the analysis of texts in a "Controlled Language"-project and for automatic error correction of hundreds of html-pages. Bracmat has also shown its utility in some real-world applications: for example to identify persons, companies etc. in pre-tagged texts that must be anonymised. The to date most advanced application of Bracmat is as workflow planner and executor. Instead of letting the user choose between software tools, which the user may not know very well, the planner asks the user to specify what kind of output she wants. With this information the planner computes all (not necessarily sequential) combinations of tools and their parameter settings that combine into workflows that are guaranteed to produce the specified output from the given input. The computed list is condensed into a short format that highlights the differences between the workflows for the user and leaves out all that is of less importance.
|exec=interpreted}}Bracmat is an interpreted programming language that is developed by Bart Jongejan, starting in 1986. Originally it was designed as a Computer Algebra system, but it has shown its merits in natural language processing as well. Bracmat has been used in the field of General Relativity for the algebraic computation of Ricci tensors from given space-time metrics, for the implementation of a dialogue-manager in virtual world project that allowed a user to communicate with software agents in plain English and with gestures, for the analysis of texts in a "Controlled Language"-project and for automatic error correction of hundreds of [[HTML]] pages. Bracmat has also shown its utility in some real-world applications: for example to identify persons, companies etc. in pre-tagged texts that must be anonymised. The to date most advanced application of Bracmat is as workflow planner and executor. Instead of letting the user choose between software tools, which the user may not know very well, the planner asks the user to specify what kind of output she wants. With this information the planner computes all (not necessarily sequential) combinations of tools and their parameter settings that combine into workflows that are guaranteed to produce the specified output from the given input. The computed list is condensed into a short format that highlights the differences between the workflows for the user and leaves out all that is of less importance.


Bracmat's strength is pattern matching, in strings as well as in tree structures.
Bracmat's strength is [[pattern matching]], in strings as well as in tree structures.


Bracmat is inspired by Snobol (pattern matching, success/failure), by Lisp (Bracmat programs are made of the same stuff as Bracmat data), by Prolog (backtracking) and a little bit by object oriented languages.
Bracmat is inspired by [[SNOBOL]] (pattern matching, success/failure), by [[Lisp]] (Bracmat programs are made of the same stuff as Bracmat data), by [[Prolog]] (backtracking) and a little bit by [[object-oriented]] languages.


The Bracmat-interpreter is written in Standard C and can be compiled for many platforms, such as Epoc, Windows, Mac OS, Linux and Unix. The compiled code measures about 130 KB (statically linked), depending on the platform. The runtime is not very memory hungry, as compared to e.g. Java.
The Bracmat-interpreter is written in Standard [[C]] and can be compiled for many platforms, such as Epoc, [[Windows]], [[Mac OS]], [[Linux]] and [[Unix]]. The compiled code measures about 130 KB (statically linked), depending on the platform. The runtime is not very memory hungry, as compared to e.g. [[Java]].

Revision as of 13:07, 5 October 2011

Language
Bracmat
This programming language may be used to instruct a computer to perform a task.
Execution method: Interpreted
See Also:


Listed below are all of the tasks on Rosetta Code which have been solved using Bracmat.

Bracmat is an interpreted programming language that is developed by Bart Jongejan, starting in 1986. Originally it was designed as a Computer Algebra system, but it has shown its merits in natural language processing as well. Bracmat has been used in the field of General Relativity for the algebraic computation of Ricci tensors from given space-time metrics, for the implementation of a dialogue-manager in virtual world project that allowed a user to communicate with software agents in plain English and with gestures, for the analysis of texts in a "Controlled Language"-project and for automatic error correction of hundreds of HTML pages. Bracmat has also shown its utility in some real-world applications: for example to identify persons, companies etc. in pre-tagged texts that must be anonymised. The to date most advanced application of Bracmat is as workflow planner and executor. Instead of letting the user choose between software tools, which the user may not know very well, the planner asks the user to specify what kind of output she wants. With this information the planner computes all (not necessarily sequential) combinations of tools and their parameter settings that combine into workflows that are guaranteed to produce the specified output from the given input. The computed list is condensed into a short format that highlights the differences between the workflows for the user and leaves out all that is of less importance.

Bracmat's strength is pattern matching, in strings as well as in tree structures.

Bracmat is inspired by SNOBOL (pattern matching, success/failure), by Lisp (Bracmat programs are made of the same stuff as Bracmat data), by Prolog (backtracking) and a little bit by object-oriented languages.

The Bracmat-interpreter is written in Standard C and can be compiled for many platforms, such as Epoc, Windows, Mac OS, Linux and Unix. The compiled code measures about 130 KB (statically linked), depending on the platform. The runtime is not very memory hungry, as compared to e.g. Java.

Subcategories

This category has the following 3 subcategories, out of 3 total.

Pages in category "Bracmat"

The following 200 pages are in this category, out of 305 total.

(previous page) (next page)
(previous page) (next page)