Explore
Connect
Documentation
Snippets
Log in
Sign up
Functional Modelling System
ingdas
25.2K views
Open Source Your Knowledge, Become a Contributor
Technology knowledge has to be shared and made accessible for free. Join the movement.
Create Content
11/11
Code Examples
Previous:
Syntax
Code Examples
Simple Equation
1
2
3
4
a :: element of {1,2,3}.
b :: element of {1,2,3}.
a + b = 5.
Enter to Rename, Shift+Enter to Preview
Run
Propositions
1
2
3
4
5
p :: proposition.
q :: proposition.
p | q.
Enter to Rename, Shift+Enter to Preview
Run
Graph Coloring
1
2
3
4
5
6
7
8
9
#printDetail 0.
//Declaration of given sets
borders := {("a","b"), ("b","c"), ("c","a")}.
colours := {1..3}.
//Declaration of the interpretation we are looking
for
colorof/1 :: function to colours.
! borders (\(x,y) -> colorof x ~= colorof y).
Enter to Rename, Shift+Enter to Preview
Run
NQueens
1
2
3
4
5
6
7
8
9
10
11
dom := {1..8}.
column/1 :: function to dom.
alldiff f := ! dom (\x -> ! dom (\y -> x ~= y => f
x ~= f y)).
! {
column,
\x -> x - column x,
\x -> x + column x
} alldiff.
Enter to Rename, Shift+Enter to Preview
Run
Peano
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
//declare s and nil as constructors
s/1 :: constructor.
nil/0 :: constructor.
//converts explains how to build a peano number fr
om an integer
conv x := case x of 0 -> nil; > 0 -> s (conv (x-1)
);.
//c is a number which should have a certain peano
representation
c :: element of {1..10}.
conv c = s ( s( s( s (nil)))).
//d is the peano representation of 3
d := conv 3.
relevant d.
Enter to Rename, Shift+Enter to Preview
Run
Transitive Closure
1
2
3
4
5
6
7
8
9
10
11
12
closure s := union s { (a,d) ||
(a,b) <- (closure s),
(c,d) <- (closure s),
b = c
}.
s := {(1,2) , (2,3) , (3,4)}.
sClosed := closure s.
relevant sClosed.
Enter to Rename, Shift+Enter to Preview
Run
External Functions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
#script(lua)
clingo = require("clingo")
N = clingo.Number
function gcd(a, b)
if a.number == 0 then
return b
else
na = a.number
nb = b.number
nc = nb % na
return gcd(N(nc), a)
end
end
#end.
gcd :: external Int -> Int -> Int.
gcd 15 20 = 5.
Enter to Rename, Shift+Enter to Preview
Run
0
Suggested playgrounds
Kotlin basics, part 1
By
MykolaHodovychenko
3,407
51
Java(Say hello through your code)!
By
debapriya_dutta
7,575
59
Java 8 Stream map tutorial
By
Unnamed contributor
59.4K
77
Rust for Python Developers - Unsigned, Signed Integers and Casting
By
Shin_O
33.8K
6
Open Source Your Knowledge: become a Contributor and help others learn.
Create New Content
