Category:Prolog
This programming language may be used to instruct a computer to perform a task.
| Execution method: | Interpreted or compiled |
|---|---|
| Garbage collected: | Yes |
| Parameter passing methods: | By value |
| Type strength: | Strong |
| Type compatibility: | Structural |
| Type checking: | Dynamic |
| See Also: |
|
Prolog is a logic programming language. It is programmed declaratively, using resolution and backtracking to confirm propositions based on declared facts and rules.
Subcategories
This category has the following 3 subcategories, out of 3 total.
@
- Prolog Implementations (4 P)
- Prolog User (72 P)
Pages in category "Prolog"
The following 200 pages are in this category, out of 484 total.
(previous page) (next page)H
- Hailstone sequence
- Hamming numbers
- Happy numbers
- Harmonic series
- Harshad or Niven series
- Hash from two arrays
- Hash join
- Hello world/Graphical
- Hello world/Line printer
- Hello world/Text
- Hello world/Web server
- Higher-order functions
- Hofstadter Figure-Figure sequences
- Honeycombs
- Horner's rule for polynomial evaluation
- HTTP
- Huffman coding
- Hunt the Wumpus
I
K
L
- Lah numbers
- Langton's ant
- Largest int from concatenated ints
- Largest number divisible by its digits
- Largest prime factor
- Last letter-first letter
- Law of cosines - triples
- Leap year
- Least common multiple
- Left factorials
- Letter frequency
- Levenshtein distance
- List comprehensions
- Literals/String
- Logical operations
- Long multiplication
- Long primes
- Long year
- Longest common prefix
- Longest common subsequence
- Longest common substring
- Longest increasing subsequence
- Look-and-say sequence
- Loop over multiple arrays simultaneously
- Loop structures
- Loops/Continue
- Loops/Do-while
- Loops/Downward for
- Loops/For
- Loops/For with a specified step
- Loops/Foreach
- Loops/Infinite
- Loops/N plus one half
- Loops/While
- Loops/With multiple ranges
- Lucas-Lehmer test
- Ludic numbers
- Lychrel numbers
M
- Magic constant
- Mandelbrot set
- Mastermind
- Matrix multiplication
- Matrix transposition
- Maximum triangle path sum
- Maze generation
- Maze solving
- Menu
- Merge and aggregate datasets
- Mersenne primes
- Mertens function
- Metaprogramming
- Middle three digits
- Miller–Rabin primality test
- Minesweeper game
- Minimum multiple of m where digital sum equals m
- Modular arithmetic
- Modular exponentiation
- Modular inverse
- Monty Hall problem
- Morse code
- Multiplication tables
- Multisplit
- Munching squares
- Mutex
- Mutual recursion
N
O
P
- Palindrome detection
- Palindromic gapful numbers
- Pangram checker
- Parallel calculations
- Parametric polymorphism
- Parse command-line arguments
- Parsing/RPN calculator algorithm
- Partial function application
- Partition an integer x into n primes
- Partition function P
- Pascal's triangle
- Pascal's triangle/Puzzle
- Password generator
- Peano curve
- Pell's equation
- Penney's game
- Perfect numbers
- Permutations
- Pi
- Pick random element
- Pierpont primes
- Playing cards
- Poker hand analyser
- Polymorphism
- Power set
- Primality by trial division
- Prime conspiracy
- Prime decomposition
- Prime numbers p for which the sum of primes less than or equal to p is prime
- Priority queue
- Program name
- Program termination
- Proper divisors
- Pythagorean triples
R
S
- Search a list
- Self-describing numbers
- Semiprime
- Sequence of primes by trial division
- Set
- Set puzzle
- Sexy primes
- SHA-1
- Shell one-liner
- Short-circuit evaluation
- Show ASCII table
- Sierpinski arrowhead curve
- Sierpinski carpet
- Sierpinski pentagon
- Sierpinski triangle
- Sierpinski triangle/Graphical
- Sieve of Eratosthenes
- Simple windowed application
- Sleep
- Smallest square that begins with n
- Sockets
- Solve a Hidato puzzle
- Solve a Hopido puzzle