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), and general imperative constructs. Picat is available via http://picat-lang.org/ .
There are quite a few Picat examples at http://hakank.org/picat/ .
References
<references>
Pages in category "Picat"
The following 200 pages are in this category, out of 335 total.
(previous page) (next page)A
- A* search algorithm
- A+B
- Abbreviations, automatic
- Abbreviations, easy
- ABC problem
- Abundant, deficient and perfect number classifications
- Ackermann function
- Additive primes
- AKS test for primes
- Algebraic data types
- Align columns
- Aliquot sequence classifications
- Almost prime
- Alternade words
- Amb
- Amicable pairs
- Anagrams
- Anagrams/Deranged anagrams
- Anti-primes
- Apply a callback to an array
- Arbitrary-precision integers (included)
- Arithmetic evaluation
- Arithmetic-geometric mean
- Arithmetic/Integer
- Arithmetic/Rational
- Array concatenation
- Array length
- Arrays
- Ascending primes
- Assertions
- Associative array/Creation
- Associative array/Iteration
- Averages/Arithmetic mean
- Averages/Median
- Averages/Root mean square
- Averages/Simple moving average
- AVL tree
B
C
- Caesar cipher
- Casting out nines
- Catalan numbers
- Character codes
- Chinese zodiac
- Chowla numbers
- Code Golf: Code Golf
- Collections
- Colorful numbers
- Combinations
- Command-line arguments
- Comments
- Compare a list of strings
- Conditional structures
- Continued fraction
- Conway's Game of Life
- Copy a string
- Count how many vowels and consonants occur in a string
- Count in octal
- Count occurrences of a substring
- Count the coins
- Create a two-dimensional array at runtime
D
E
F
- Factorial
- Factors of an integer
- Farey sequence
- Fibonacci sequence
- Fibonacci word
- Filter
- Find common directory path
- Find palindromic numbers in both binary and ternary bases
- Find the intersection of a line with a plane
- Find the missing permutation
- Five weekends
- FizzBuzz
- Floyd's triangle
- Forward difference
- Function definition
- Fusc sequence
G
H
- Hailstone sequence
- Hamming numbers
- Happy numbers
- Hash from two arrays
- Hello world/Line printer
- Hello world/Newline omission
- Hello world/Standard error
- Hello world/Text
- Higher-order functions
- Hofstadter Q sequence
- Hofstadter-Conway $10,000 sequence
- Horner's rule for polynomial evaluation
- Huffman coding
I
K
L
- Largest int from concatenated ints
- Largest proper divisor of n
- Last Friday of each month
- Last letter-first letter
- Latin Squares in reduced form
- Leap year
- Least common multiple
- Legendre prime counting function
- Leonardo numbers
- Letter frequency
- Levenshtein distance
- Linear congruential generator
- List comprehensions
- Literals/Floating point
- Literals/Integer
- Literals/String
- Long primes
- Longest common subsequence
- Longest increasing subsequence
- Look-and-say sequence
- Loop over multiple arrays simultaneously
- Loops/Continue
- Loops/Do-while
- Loops/For
- Loops/While
- Loops/With multiple ranges
- Ludic numbers
- Luhn test of credit card numbers
- Lychrel numbers
- LZW compression