Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
helmut_brandl
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
7 ms
·
1.
▲
Simulating Lambda Calculus in Lambda Calculus
(hbr.github.io)
1 points
by
helmut_brandl
2y ago
|
0 comments
2.
▲
Limits of Computability in Lambda Calculus
(hbr.github.io)
2 points
by
helmut_brandl
3y ago
|
0 comments
3.
▲
Calculus of Constructions
(hbr.github.io)
2 points
by
helmut_brandl
4y ago
|
0 comments
4.
▲
Limits of Computability
(hbr.github.io)
2 points
by
helmut_brandl
6y ago
|
0 comments
5.
▲
Red Black Trees
(hbr.github.io)
2 points
by
helmut_brandl
6y ago
|
0 comments
6.
▲
Programming in Lambda Calculus
(hbr.github.io)
2 points
by
helmut_brandl
6y ago
|
0 comments
7.
▲
Programming in Lambda Calculus
(hbr.github.io)
4 points
by
helmut_brandl
6y ago
|
0 comments
8.
▲
Lambda Calculus – Step by Step
(dropbox.com)
3 points
by
helmut_brandl
8y ago
|
0 comments
9.
▲
by
helmut_brandl
9y ago
The language is currently being developed. It is fully supported.
10.
▲
Verified Software with Albatross
(gitbook.com)
2 points
by
helmut_brandl
9y ago
|
2 comments
11.
▲
Inductively defined sets and relations
(hbr.gitbooks.io)
1 points
by
helmut_brandl
10y ago
|
0 comments
12.
▲
A Quick Tour Through the Albatross Programming Language
(hbr.gitbooks.io)
1 points
by
helmut_brandl
10y ago
|
0 comments
13.
▲
Description of the Albatross Programming Language
(hbr.gitbooks.io)
1 points
by
helmut_brandl
10y ago
|
0 comments
14.
▲
by
helmut_brandl
11y ago
For non-terminating programs I use processes as described by Tony Hoare in "Communicating Sequential Processes". Procedures must always terminate in Albatross. If I have more documentation on aliasing, I can give you hint. Could y
15.
▲
by
helmut_brandl
11y ago
Predicate logic is the base. Hoare logic rests on top of it to reason about the effect of commands in imperative code. Total correctness is used for Hoare logic. I.e. {Q} S {R} means that the program fragment S started in a state that satis
16.
▲
by
helmut_brandl
11y ago
The used logic: Classical predicate logic + Hoare Logic. Aliasing is an issue in verifying any programming language with imperative elements and mutable data types. However this issue is addressed properly in Albatross.
17.
▲
Albatross – A Programming Language with Static Verification
(albatross-lang.sourceforge.net)
15 points
by
helmut_brandl
11y ago
|
7 comments