Category:Prolog: Difference between revisions
Content added Content deleted
mNo edit summary |
No edit summary |
||
| Line 3: | Line 3: | ||
|checking=dynamic |
|checking=dynamic |
||
|gc=yes |
|gc=yes |
||
|exec=both |
|||
| ⚫ | |||
|LCT=yes |
|||
|compat=structural |
|||
|parampass=value |
|||
|bnf=[http://cdn.bitbucket.org/muspellsson/rosetta/downloads/prolog-bnf.html] |
|||
| ⚫ | |||
[[wp:Prolog|Prolog]] is a [[logic programming]] language. It is programmed declaratively, using ''resolution'' and ''backtracking'' to confirm propositions based on declared facts and rules. |
[[wp:Prolog|Prolog]] is a [[logic programming]] language. It is programmed declaratively, using ''resolution'' and ''backtracking'' to confirm propositions based on declared facts and rules. |
||
<br clear="both"> |
<br clear="both"> |
||
Latest revision as of 10:40, 9 June 2012
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 481 total.
(previous page) (next page)A
- A+B
- Abbreviations, automatic
- Abbreviations, easy
- ABC problem
- Abundant, deficient and perfect number classifications
- Accumulator factory
- Ackermann function
- AKS test for primes
- Algebraic data types
- Align columns
- Aliquot sequence classifications
- Almost prime
- Alternade words
- Amb
- Amicable pairs
- Anagrams
- Anagrams/Deranged anagrams
- Animate a pendulum
- Animation
- Anonymous recursion
- 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
- Aspect oriented programming
- Assertions
- Associative array/Creation
- Associative array/Iteration
- Attractive numbers
- Averages/Arithmetic mean
- Averages/Median
- Averages/Root mean square
B
- Babbage problem
- Balanced brackets
- Balanced ternary
- Barnsley fern
- Base64 decode data
- Bell numbers
- Benford's law
- Best shuffle
- Binary digits
- Binary search
- Binary strings
- Bitmap
- Bitmap/Bresenham's line algorithm
- Bitmap/Write a PPM file
- Box the compass
- Brace expansion
- Brilliant numbers
- Bulls and cows
- Bulls and cows/Player
C
- Caesar cipher
- Calculating the value of e
- Calendar
- Calkin-Wilf sequence
- Call a foreign-language function
- Carmichael 3 strong pseudoprimes
- Cartesian product of two or more lists
- Case-sensitivity of identifiers
- Catalan numbers
- Catamorphism
- Change e letters to i in words
- Changeable words
- Character codes
- Chat server
- Check that file exists
- Chernick's Carmichael numbers
- Chinese remainder theorem
- Chinese zodiac
- Chowla numbers
- Church numerals
- Circular primes
- Closest-pair problem
- Closures/Value capture
- Collections
- Combinations
- Combinations with repetitions
- Comma quibbling
- Command-line arguments
- Comments
- Compare a list of strings
- Compile-time calculation
- Compiler/lexical analyzer
- Compiler/virtual machine interpreter
- Compound data type
- Concurrent computing
- Conditional structures
- Constrained random points on a circle
- Continued fraction
- Convert seconds to compound duration
- Conway's Game of Life
- Copy a string
- Copy stdin to stdout
- Count in octal
- Count occurrences of a substring
- Count the coins
- Countdown
- Cramer's rule
- Create a two-dimensional array at runtime
- Create an HTML table
- CSV data manipulation
- CSV to HTML translation
- Currying
D
- Date format
- Day of the week
- Deceptive numbers
- Department numbers
- Descending primes
- Detect division by zero
- Determine if a string has all the same characters
- Determine if a string has all unique characters
- Determine if a string is collapsible
- Determine if a string is numeric
- Determine if a string is squeezable
- Digital root
- Dijkstra's algorithm
- Dinesman's multiple-dwelling problem
- Dining philosophers
- Discordian date
- Dot product
- Dragon curve
- Draw a cuboid
- Dutch national flag problem
- Dynamic variable names
E
- Egyptian division
- Elementary cellular automaton
- Empty directory
- Empty string
- Entropy
- Enumerations
- Environment variables
- Equilibrium index
- Esthetic numbers
- Ethiopian multiplication
- Euler's identity
- Euler's sum of powers conjecture
- Even or odd
- Evolutionary algorithm
- Exceptions
- Execute a Markov algorithm
- Execute a system command
- Execute Brain****
- Exponentiation operator
F
- Factorial
- Factors of a Mersenne number
- Factors of an integer
- Farey sequence
- Fast Fourier transform
- Faulhaber's triangle
- Fibonacci sequence
- Filter
- Find common directory path
- Find the intersection of a line with a plane
- Find words with alternating vowels and consonants
- Finite state machine
- First-class functions
- Five weekends
- FizzBuzz
- Flatten a list
- Floyd's triangle
- Floyd-Warshall algorithm
- Four bit adder
- Fractal tree
- Fractran
- Function composition
- Function definition
- Fusc sequence
G
- Galton box animation
- Gamma function
- General FizzBuzz
- Generate Chess960 starting position
- Generate lower case ASCII alphabet
- Generic swap
- Golden ratio/Convergence
- Gray code
- Greatest common divisor
- Greatest element of a list
- Greatest subsequential sum
- Greedy algorithm for Egyptian fractions
- Guess the number
- Guess the number/With feedback
- Guess the number/With feedback (player)
- GUI component interaction
- GUI enabling/disabling of controls