Category:Programming Languages: Difference between revisions
No edit summary |
|||
Line 7: | Line 7: | ||
'''Note:''' Because this category is used for automated administration, it should contain only categories that represent individual languages, not groups of languages. |
'''Note:''' Because this category is used for automated administration, it should contain only categories that represent individual languages, not groups of languages. |
||
Here is a sample sorting program. |
|||
<lang CafeOB> |
|||
mod! SORTING-NAT { |
|||
pr(NAT) |
|||
[Nat < Strg ] |
|||
-- Simple list structure |
|||
op nil : -> Strg |
|||
op _._ : Strg Strg -> Strg { assoc id: nil } |
|||
vars N N' : Nat |
|||
-- A very short sorting program using transitions in POA logic, which is a type of rewrite logic |
|||
ctrans [swap] : (N . N') => (N' . N) if N' <= N . |
|||
} |
|||
**> Sorting natural numbers using exec command |
|||
open SORTING-NAT |
|||
exec (3 . 2 . 1) . |
|||
**> Sorting natural numbers using search command |
|||
**> we can use (show path N) with this command, where N is the nuber of possible states. |
|||
red (3 . 2 . 1) =(1,1)=>* (1 . 2 . 3) . |
|||
red (3 . 2 . 1) =(1,2)=>* (1 . 2 . 3) . |
|||
red (3 . 2 . 1) =(1,3)=>* (1 . 2 . 3) . |
|||
**> search for any number of solutions at any depth |
|||
red (3 . 2 . 1) =(*,*)=>* (1 . 2 . 3) . |
|||
**> print the transitions from initial to goal state |
|||
show path 5 |
|||
eof |
|||
</lang> |
Revision as of 11:10, 13 October 2013
A programming language is a symbolic representation of a specification for computer behavior.
A side-by-side comparison of many of the languages on Rosetta Code can be seen here.
These are the programming languages that are mentioned throughout Rosetta Code. If you know a language not listed here then suggest or add it.
Note: Because this category is used for automated administration, it should contain only categories that represent individual languages, not groups of languages.
Here is a sample sorting program. <lang CafeOB> mod! SORTING-NAT { pr(NAT) [Nat < Strg ] -- Simple list structure op nil : -> Strg op _._ : Strg Strg -> Strg { assoc id: nil }
vars N N' : Nat -- A very short sorting program using transitions in POA logic, which is a type of rewrite logic ctrans [swap] : (N . N') => (N' . N) if N' <= N . }
- > Sorting natural numbers using exec command
open SORTING-NAT exec (3 . 2 . 1) .
- > Sorting natural numbers using search command
- > we can use (show path N) with this command, where N is the nuber of possible states.
red (3 . 2 . 1) =(1,1)=>* (1 . 2 . 3) . red (3 . 2 . 1) =(1,2)=>* (1 . 2 . 3) . red (3 . 2 . 1) =(1,3)=>* (1 . 2 . 3) .
- > search for any number of solutions at any depth
red (3 . 2 . 1) =(*,*)=>* (1 . 2 . 3) .
- > print the transitions from initial to goal state
show path 5 eof </lang>
Subcategories
This category has the following 200 subcategories, out of 939 total.
(previous page) (next page)D
E
F
- FBSL (56 P)
- Fe (13 P)
- Fermat (91 P)
- Fexl (6 P)
- Fhidwfe (4 P)
- FLORA-2 (empty)
- Florid (empty)
- FOCAL (63 P)
- FormulaOne (1 P)
- Frege (11 P)
- FRISC Assembly (1 P)
- FTCBASIC (11 P)
- FunL (90 P)
- Furor (22 P)
- FurryScript (2 P)
- Futhark (37 P)
- FUZE BASIC (7 P)