Category:Picat
This programming language may be used to instruct a computer to perform a task.
| See Also: |
|
|---|
Picat is a simple, and yet powerful, logic-based multi-paradigm programming language aimed for general-purpose applications, including non-determinism, tabling, constraint solving (Constraint Programming, SAT, and MIP), planning, functions, list comprehensions, and general imperative constructs such as for loops, while loops, and re-assignments. Picat is available via http://picat-lang.org/ .
There are quite a few Picat examples at http://hakank.org/picat/ .
Todo
Reports:Tasks_not_implemented_in_Picat
References
<references>
Pages in category "Picat"
The following 135 pages are in this category, out of 335 total.
(previous page) (next page)P
- Palindrome detection
- Pangram checker
- Parse command-line arguments
- Partition function P
- Pascal's triangle
- Pascal's triangle/Puzzle
- Pentomino tiling
- Perfect numbers
- Perfect shuffle
- Permutations
- Permutations/Derangements
- Pernicious numbers
- Phrase reversals
- Pi
- Pick random element
- Playing cards
- Poker hand analyser
- Population count
- Price fraction
- Primality by trial division
- Prime conspiracy
- Prime decomposition
- Priority queue
- Program termination
- Proper divisors
- Pythagorean triples
R
- Random Latin squares
- Random numbers
- Range extraction
- Read a configuration file
- Read a file line by line
- Read entire file
- Real constants and functions
- Remove vowels from a string
- Rep-string
- Return multiple values
- Rock-paper-scissors
- Roman numerals/Decode
- Roman numerals/Encode
- Rot-13
- Round-robin tournament schedule
- Run-length encoding
S
- Sailors, coconuts and a monkey problem
- Sattolo cycle
- Search a list
- Self-describing numbers
- Send an unknown method call
- Sequence of non-squares
- Set puzzle
- Sierpinski carpet
- Sierpinski triangle
- Sieve of Eratosthenes
- Smallest multiple
- Smallest square that begins with n
- Solve a Hidato puzzle
- Solve a Holy Knight's tour
- Solve a Hopido puzzle
- Solve a Numbrix puzzle
- Solve hanging lantern problem
- Solve the no connection puzzle
- Solve triangle solitaire puzzle
- Sorting algorithms/Heapsort
- Sorting algorithms/Merge sort
- Sorting algorithms/Pancake sort
- Sorting algorithms/Quicksort
- Sorting algorithms/Shell sort
- Soundex
- Strange plus numbers
- String append
- String case
- String comparison
- String concatenation
- String interpolation (included)
- String matching
- String prepend
- Strip a set of characters from a string
- Strip whitespace from a string/Top and tail
- Subset sum problem
- Substitution cipher
- Substring
- Substring primes
- Substring/Top and tail
- Successive prime differences
- Sudoku
- Sum and product of an array
- Sum and product puzzle
- Sum digits of an integer
- Sum multiples of 3 and 5
- Sum of a series
- Sum of squares
- Sum to 100
- Symmetric difference
T
- Terminal control/Display an extended character
- Ternary logic
- Text processing/1
- Text processing/2
- Text processing/Max licenses in use
- The Name Game
- The Twelve Days of Christmas
- Time a function
- Tokenize a string
- Top rank per group
- Topological sort
- Topswops
- Towers of Hanoi
- Trabb Pardo–Knuth algorithm
- Twelve statements
- Two identical strings